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
Proceedings ArticleDOI
Implicit Group Messaging over Peer-to-Peer Networks
TL;DR: The results show the P2P model to efficiently support a range of implicit groups with acceptable delivery times and vastly less maximum peer and link stress than a client/server approach.
Journal ArticleDOI
The CoQUOS Approach to Continuous Queries in Unstructured Overlays
Lakshmish Ramaswamy,Jianxia Chen +1 more
TL;DR: It is argued that for many P2P applications, implementing full-fledged publish-subscribe systems is an overkill and a scalable and effective middleware, called CoQUOS, is presented, for supporting continuous queries in unstructured overlay networks.
Proceedings ArticleDOI
The power of DHT as a logical space
TL;DR: It is argued that it maybe more interesting to simply view DHT as a logical space that can dynamically size itself with potentially unlimited amount resources, in someway analogous to the virtual memory in any contemporary operating system.
Data sharing and information retrieval in wide-area distributed systems
Chunqiang Tang,Sandhya Dwarkadas +1 more
TL;DR: The InterWeave system provides a unified programming environment that supports the use of shared-memory programming, remote invocation, relaxed coherence models, and transactions in a single application and is the first system that automates the typesafe sharing of structured data in its internal form across heterogeneous platforms and multiple languages.
Journal ArticleDOI
FlexSig: Implementing flexible hardware signatures
TL;DR: FlexSig is proposed, a new hardware signature organization that can change dynamically the resources assigned to a given signature and the number of signatures in the system, by redistributing the available hardware resources according to the system requirements, which allows higher flexibility than with traditional fixed-resources signatures based on Bloom filters.
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