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
Book ChapterDOI
The design of PIRS, a peer-to-peer information retrieval system
Wai Gen Yee,Ophir Frieder +1 more
TL;DR: It is shown that PIRS significantly improves over search performance found in todays P2P file sharing systems.
Journal Article
The MINERVA project : Towards collaborative search in digital libraries using peer-to-peer technology
TL;DR: In this article, the authors consider the problem of collaborative search across a large number of digital libraries and query routing strategies in a peer-to-peer (P2P) environment.
Journal ArticleDOI
Towards peer-to-peer content indexing
Carlos Baquero,Nuno Lopes +1 more
TL;DR: This work presents two contributions: A design that allows participating nodes to load balance the indexing of popular keys and avoid content hot-spots on single nodes and a distributed mechanism for probabilistic filtering of popular Keys (with low search relevance) that paves the way for scalable full content indexing.
Journal Article
Exploiting Semantics in Unstructured Peer-to-Peer Networks
TL;DR: This paper describes a design of the semantic P2P keyword search system that exploits the semantics of correlation among nodes to support semantic search.
Book ChapterDOI
Aggregation of a term vocabulary for P2P-IRtest: a DHT stress test
Fabius Klemm,Karl Aberer +1 more
TL;DR: This paper studies the feasibility of aggregating global frequencies for a large term vocabulary in a P2P setting using a distributed hash table (DHT) for analysis, and proposes optimizations to DHTs to efficiently process large numbers of keys.
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