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
Journal ArticleDOI
Design and implementation trade-offs for wide-area resource discovery
TL;DR: This paper describes the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems, and finds that the decentralized implementation, both in emulation and running continuously on over 200 PlanetLab nodes, performs well while benefiting from the DHT's self-healing properties.
Proceedings ArticleDOI
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
TL;DR: BubbleStorm as mentioned in this paper is a probabilistic search system built on random multigraphs, which can handle up to 90% simultaneous peer departure and 50% simultaneous crash.
Proceedings ArticleDOI
Design and implementation tradeoffs for wide-area resource discovery
TL;DR: This paper describes the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems, and finds that the decentralized implementation, both in emulation and running continuously on over 200 PlanetLab nodes, performs well while benefiting from the DHT's self-healing properties.
Proceedings ArticleDOI
Debunking some myths about structured and unstructured overlays
TL;DR: A comparison of structured and unstructured overlays that decouples overlay topology maintenance from query mechanism is presented and techniques that exploit structural constraints to achieve low maintenance overhead and a modified neighbour selection algorithm is presented that can exploit heterogeneity effectively.
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval.
Torsten Suel,Chandan Mathur,Jo-wen Wu,Jiangong Zhang,Alex Delis,Mehdi Kharrazi,Xiaohui Long,Xiaohui Long,Kulesh Shanmugasundaram +8 more
TL;DR: A prototype system called ODISSEA (Open DIStributed Search Engine Architecture) is described, which provides a highly distributed global indexing and query execution service that can be used for content residing inside or outside of a P2P network.
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