Efficient peer-to-peer keyword searching
Patrick Reynolds,Amin Vahdat +1 more
- pp 21-40
TLDR
A distributed search engine based on a distributed hash table is designed and analyzed and the simulation results predict that the search engine can answer an average query in under one second, using under one kilobyte of bandwidth.Abstract:
The recent file storage applications built on top of peer-to-peer distributed hash tables lack search capabilities. We believe that search is an important part of any document publication system. To that end, we have designed and analyzed a distributed search engine based on a distributed hash table. Our simulation results predict that our search engine can answer an average query in under one second, using under one kilobyte of bandwidth.read more
Citations
More filters
FreeCore : Un substrat d'indexation des filtres de Bloom fragmentés pour la recherche par mots clés
TL;DR: FreeCore as discussed by the authors is a substrate for indexation de filtres de Bloomfragmentes and recherche par mots cles, and it is based on FreeCore index.
Ontology-based Search Algorithms over Large-Scale Unstructured Peer-to-Peer Networks
TL;DR: A suite of algorithms which provide peers in unstructured P2P overlays with the state necessary in order to efficiently locate, disseminate and replicate objects is presented and new methods are developed for semantic knowledge representation, resource selection, and knowledge evolution for efficient search in dynamic and distributed P1P network environments.
DissertationDOI
Hermes: um arcabouço para a programação de aplicações P2P
TL;DR: Hermes as discussed by the authors is an environment for the development of P2P applications that gives the application developer the possibility of choosing the overlay network implementation and replacing such implementation at any point, from development to production, without changes on the application code.
Proceedings ArticleDOI
A distributed mobile agent based Web search for adaptive meta search engines
M. Koorangi,K. Zamanifar +1 more
TL;DR: An adaptive method for Web meta-search engines with a multi-agent specially the mobile agents is presented to make search engines work more efficiently.
Proceedings ArticleDOI
An efficient multi-keyword search mechanism in structured P2P networks
Mo Hai,Shuhang Guo +1 more
TL;DR: Simulation results show this mechanism outperforms current multiple-keyword search mechanisms in structured P2P networks in both the number of hops and theNumber of messages.
References
More filters
Journal ArticleDOI
The anatomy of a large-scale hypertextual Web search engine
Sergey Brin,Lawrence Page +1 more
TL;DR: This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.
Proceedings Article
The PageRank Citation Ranking : Bringing Order to the Web
TL;DR: This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
Journal Article
The Anatomy of a Large-Scale Hypertextual Web Search Engine.
Sergey Brin,Lawrence Page +1 more
TL;DR: Google as discussed by the authors is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems.
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Journal ArticleDOI
Space/time trade-offs in hash coding with allowable errors
TL;DR: Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.
Related Papers (5)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more