nach oben

Peer-to-Peer Networking and Applications

Erschienen in:

01.01.2016

Towards bandwidth-efficient keyword continuous query processing over DHTs

verfasst von: Yingwu Zhu

Erschienen in: Peer-to-Peer Networking and Applications | Ausgabe 1/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

In this paper, we focus our studies on a distributed keyword continuous query processing system that is built on distributed hash tables. Treating bandwidth as a first-class resource, we propose novel query indexing algorithms including MHI and SAP-MHI, multicast-based document announcement, and adaptive query resolution to reduce bandwidth cost. Our detailed simulations show that our proposed techniques, combined together, effectively and greatly cut down bandwidth consumption.

Vorheriger Artikel A free rider aware topological construction strategy for search in unstructured P2P networks

Nächster Artikel TEA-CBRP: Distributed cluster head election in MANET by using AHP

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Document alert is outside of the scope of the paper since it can be decoupled from the system and implemented in various ways, e.g., via multicast, emails or RSS.

Note that term IDs uniquely identify terms. Each query inverted list may additionally store the term ID so that the term ID uniquely identifies the inverted list.

Given k term IDs contained in an announcement message, if we piggyback r successor term IDs for each of these k term IDs, the total number of term IDs in the message is at most k+r rather than k⋅r. So, the piggyback overhead is at most r term IDs.

The number of documents in which a term appears.

In this paper, we set y to be larger than \(\log {N}\) where N is the number of nodes in the underlying DHT.

Zhu Y (2008) Bandwidth-efficient continuous query processing over DHTs. In: Proceedings of ICPP

Kannan J, Yang B, Shenker S, Sharma P, Banerjee S, Basu S, Lee S-J (2006) Smartseer: Using a DHT to process continuous queries over peer-to-peer networks. In: Proceedings of IEEE INFOCOM

Nath S, Gibbons PB, Seshan S, Anderson ZR (2004) Synopsis diffusion for robust aggregation in sensor networks. In: Proceedings of the 2nd international conference on embedded networked sensor systems. New York

Reynolds P, Vahdat A (2003) Efficient peer-to-peer keyword searching. In: Proceedings of ACM/IFIP/USENIX international middleware conference (Middleware). Rio de Janeiro, pp 21–40

Li J, Loo BT, Hellerstein J, Kaashoek F, Karger DR, Morris R (2003) On the feasibility of peer-to-peer web indexing and search. In: Proceedings of the 2nd international workshop on peer-to-peer systems (IPTPS). Berkeley, pp 207–215

Tang C, Xu Z, Dwarkadas S (2003) Peer-to-peer information retrieval using self-organizing semantic overlay networks. In: Proceedings of ACM SIGCOMM. Karlsruhe, pp 175–186

Zhu Y, Hu Y (2007) Efficient semantic search on DHT overlays. J Parallel Distrib Comput 67:604–616MATHCrossRef

Avnur R, Hellerstein JM Eddies: continuously adaptive query processing. In: Proceedings of ACM SIGMOD

Babcock B, Babu S, Datar M, Motwani R, Widom J (2002) Models and issues in data stream systems. In: Proceedings of ACM symposium on principles of database systems. New York, pp 1–16

10.

Bollacker KD, Lawrence S, Giles CL (1999) A system for automatic personalized tracking of scientific literature on the web. In: Proceedings of ACM conference on digital libraries. New York, pp 105–113

11.

Huebsch R, Hellerstein JM, Lanham N, Loo BT, Shenker S, Stoica I (2003) Querying the internet with pier. In: Proceedings of VLDB, pp 321–332

12.

Zhu Y, Hu Y (2007) Ferry: A P2P-based architecture for content-based publish/subscribe services. IEEE Trans Parallel Distrib Syst 18:672–685CrossRef

13.

Rowstron AIT, Kermarrec A-M, Castro M, Druschel P (2001) SCRIBE: the design of a large-scale event notification infrastructure. In: Proceedings of the 3rd international networked group communication, pp 30–43

14.

Castro M, Druschel P, Kermarrec A-M, Nandi A, Rowstron A, Singh A (2003) Splitstream: high-bandwidth multicast in cooperative environments. In: Proceedings of the 19th ACM symposium on operating systems principles (SOSP). Bolton Landing

15.

Gupta A, Sahin OD, Agrawal D, Abbadi AE (2004) Meghdoot: content-based publish/subscribe over P2P networks. In: ACM/IFIP/USENIX 5th international middleware conference. Toronto

16.

Stoica I, Morris R, Karger D, Kaashoek M, Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of ACM SIGCOMM. San Diego, pp 149–160

17.

Xie Y, O’Hallaron D (2002) Locality in search engine queries and its implications for caching. In: Proceedings of INFOCOM

18.

Patch K Net scan finds like-minded users. http://www.trnmag.comi/ftories/2003/050703/Net_scan_finds_like-minded_users_050703.html

19.

Text retrieval conference (trec). http://trec.nist.org

20.

Berry MW, Drmac Z, Jessup ER (1999) Matrices, vector spaces, and information retrieval. SIAM Rev 41(2):335–362MATHMathSciNetCrossRef

21.

Castro M, Druschel P, Ganesh A, Rowstron A, Wallach DS (2002) Secure routing for structured peer-to-peer overlay networks. In: Proceedings of OSDI, pp 299–314

Titel: Towards bandwidth-efficient keyword continuous query processing over DHTs
verfasst von: Yingwu Zhu
Publikationsdatum: 01.01.2016
Verlag: Springer US
Erschienen in: Peer-to-Peer Networking and Applications / Ausgabe 1/2016
Print ISSN: 1936-6442
Elektronische ISSN: 1936-6450
DOI: https://doi.org/10.1007/s12083-014-0319-6

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 1/2016

A lightweight privacy preserving authenticated key agreement protocol for SIP-based VoIP

NetSecCC: A scalable and fault-tolerant architecture for cloud computing security

Characterizing peers communities and dynamics in a P2P live streaming system

A novel fairness-aware parallel download scheme

A channel-hopping scheme for continuous rendezvous and data delivery in cognitive radio network

Security analysis and enhancements of an improved authentication for session initiation protocol with provable security