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
Memory-Compact Membership Lookup for Multiple Data Sets by a Single Bloom Filter
Jiyang Chen,Qingjun Xiao +1 more
TL;DR: This paper encodes all data sets in a single large filter and yet supports membership lookup for all of them, with a false positive rate bound that is independently configurable for each set.
Journal ArticleDOI
Textual Based Retrieval System with Bloom in Unstructured Peer-to-Peer Networks
TL;DR: P2P network is the best and popular network sharing of contents by the user through internet, but P2P networks are more vulnerable to malwares, malicious code, viruses, etc., than the traditional client-server networks, due to their lack of structure and unmanaged nature.
Book ChapterDOI
Performance modeling of mobile peer-to-peer systems
TL;DR: The results provide potential useful guidelines for mobile operators, value-added service providers and application developers to design and dimension mobile peer-to-peer systems.
A novel routing technique using route path information in unstructured Peer to Peer network
TL;DR: A novel message passing technique in which each peer maintains the route path of the destination with in itself which uses this route path to send and receive messages to minimizes the packet flow in the unstructured P2P which occur during flooding technique.
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