標(biāo)題: Titlebook: Keyword Search in Databases; Jeffrey Xu Yu,Lu Qin,Lijun Chang Book 2010 Springer Nature Switzerland AG 2010 [打印本頁] 作者: Flexibility 時(shí)間: 2025-3-21 17:19
書目名稱Keyword Search in Databases影響因子(影響力)
書目名稱Keyword Search in Databases影響因子(影響力)學(xué)科排名
書目名稱Keyword Search in Databases網(wǎng)絡(luò)公開度
書目名稱Keyword Search in Databases網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Keyword Search in Databases被引頻次
書目名稱Keyword Search in Databases被引頻次學(xué)科排名
書目名稱Keyword Search in Databases年度引用
書目名稱Keyword Search in Databases年度引用學(xué)科排名
書目名稱Keyword Search in Databases讀者反饋
書目名稱Keyword Search in Databases讀者反饋學(xué)科排名
作者: Heart-Rate 時(shí)間: 2025-3-21 22:58 作者: DEAF 時(shí)間: 2025-3-22 02:33 作者: ALB 時(shí)間: 2025-3-22 08:17 作者: Admire 時(shí)間: 2025-3-22 11:18
Jeffrey Xu Yu,Lu Qin,Lijun Changl Driven Architecture approach is used that simplifies VANET development using abstract models. It only subdues VANET rigidity but also comply with SDN principals. This system is implemented in VEINS framework. Results demonstrate its efficacy for large scale VANET.作者: 有偏見 時(shí)間: 2025-3-22 13:47
Jeffrey Xu Yu,Lu Qin,Lijun Chang between the application level, with its own TDMA round and slots allocated to engaged nodes, e.g., a platoon, and the global level that manages multiple TDMA rounds in a mutually agnostic manner, thus, dynamic and scalable. We believe this is the first applications-oriented MAC protocol proposed fo作者: GREEN 時(shí)間: 2025-3-22 20:40
Jeffrey Xu Yu,Lu Qin,Lijun Chang. The presence of resource-constrained sensors in the core of each IoT device make it resource-starving and as such require extremely lightweight but secured algorithms to combat various attacks and malevolent entities from spreading their malicious data. In this paper we aim to propose an extremely作者: 使成核 時(shí)間: 2025-3-23 00:56
Jeffrey Xu Yu,Lu Qin,Lijun Chang, the design gives prioritized channel access to vehicles experiencing dropped beacons. The proposed design can be readily incorporated into the IEEE 802.11p standard. The discrete-event simulations show that synchronous collisions can be reduced significantly to achieve higher message reception rat作者: 拾落穗 時(shí)間: 2025-3-23 04:57 作者: 天賦 時(shí)間: 2025-3-23 09:04 作者: employor 時(shí)間: 2025-3-23 11:44
Keyword Search in Databases978-3-031-79426-1Series ISSN 2153-5418 Series E-ISSN 2153-5426 作者: Hyperlipidemia 時(shí)間: 2025-3-23 14:25
Keyword Search in XML Databases,er a keyword query on . tree, and we discuss efficient algorithms to find the answers under such semantics. A main difference between this chapter and the previous chapters is that the underlying data structure is a large tree instead of a large graph.作者: kindred 時(shí)間: 2025-3-23 21:27
Other Topics for Keyword Search on Databases, are proposed to select some . among many to answer a keyword query. In Section 5.2, we discuss keyword search in a spatial database. In Section 5.3, we introduce a Page Rank based approach called . in ., and an approach that projects a database that only contains tuples relating to a keyword query.作者: interpose 時(shí)間: 2025-3-24 01:17 作者: 吃掉 時(shí)間: 2025-3-24 03:09 作者: semble 時(shí)間: 2025-3-24 06:39 作者: GLUT 時(shí)間: 2025-3-24 14:16
Graph-Based Keyword Search,Based on the primary and foreign key references defined on a relational schema, an . can be modeled as a data graph where nodes represent tuples and edges represent the foreign key references between tuples.作者: 廣告 時(shí)間: 2025-3-24 16:18 作者: 人類 時(shí)間: 2025-3-24 22:15 作者: Myofibrils 時(shí)間: 2025-3-24 23:28
Introduction,In this book, we concentrate on two kinds of databases, a relational database . and an . database. In an ., an object is a tuple that consists of many attribute values where some attribute values are strings or full-text; there is a connection between two objects if there exists at least one referen作者: 狂熱語言 時(shí)間: 2025-3-25 04:25 作者: Retrieval 時(shí)間: 2025-3-25 10:16
Graph-Based Keyword Search,Wide Web also can be modeled as a graph, and there also exists general graphs with textual information stored on the nodes. In the previous chapter, we discussed keyword search on a relational database (.) using the underlying relational schema that specifies how tuples are connected to each other. 作者: 輕率的你 時(shí)間: 2025-3-25 14:07 作者: FLAGR 時(shí)間: 2025-3-25 18:24
Other Topics for Keyword Search on Databases, are proposed to select some . among many to answer a keyword query. In Section 5.2, we discuss keyword search in a spatial database. In Section 5.3, we introduce a Page Rank based approach called . in ., and an approach that projects a database that only contains tuples relating to a keyword query.作者: 表示向下 時(shí)間: 2025-3-25 20:46 作者: BRAVE 時(shí)間: 2025-3-26 01:49 作者: invulnerable 時(shí)間: 2025-3-26 06:44 作者: 地殼 時(shí)間: 2025-3-26 08:47
Jeffrey Xu Yu,Lu Qin,Lijun Changafety. In these networks, the Medium Access Control (MAC) plays an important role in providing an efficient communication channel. Currently, there are two protocols for ITS, proposed in the USA (IEEE WAVE) and in Europe (ETSI ITS-G5). Both cases use the PHY and MAC of IEEE 802.11p, the latter being作者: 縱欲 時(shí)間: 2025-3-26 14:29
Jeffrey Xu Yu,Lu Qin,Lijun Change the information gathered from phenomena of interest. IoT is a broad term and has attain popularity with the integration of Cloud Computing and Big Data. The partnership among these technologies is revolutionizing the world in which we live and interact with different devices. On the down side, the作者: adhesive 時(shí)間: 2025-3-26 20:31
Jeffrey Xu Yu,Lu Qin,Lijun Changless communication in the US and Europe use a single shared channel for the periodic broadcast of safety messages. Coupled with the short contention window and inflexibility in window size adaptation, the synchronous collisions of periodic messages are inevitable in a large scale intelligent transpo作者: 你敢命令 時(shí)間: 2025-3-26 21:47 作者: 數(shù)量 時(shí)間: 2025-3-27 01:31 作者: Glossy 時(shí)間: 2025-3-27 05:22 作者: 南極 時(shí)間: 2025-3-27 11:28
An Efficient ElGamal Encryption Scheme Based on Polynomial Modular Arithmetic in ,, decryption process. The proposed scheme is as secure as the original ElGamal scheme, since both schemes are based on the DLP. The preliminary result shows that the proposed scheme minimizes complex arithmetic operations and achieves very practical performance compared to the classic ElGamal algorit作者: 富饒 時(shí)間: 2025-3-27 14:30
Sooyeong Yi,Narendra Ahujarations, as opposed to adult mathematical phrases rooted in concepts that do not reflect—and which in the classroom may even suppress—youngsters’ learning experiences...Highlights of the coverage:.....To978-1-4899-8466-1978-1-4419-0591-8作者: GNAW 時(shí)間: 2025-3-27 17:55 作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-28 01:27 作者: 偶然 時(shí)間: 2025-3-28 02:06
https://doi.org/10.1007/978-3-658-44527-0Genossenschaftsbanken; Volksbanken; Raiffeisenbanken; Digitalisierung; Kundenrückgewinnung; Bankdienstlei
