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
Peer to Peer search operations by the Distributed applications using public Cloud
TL;DR: This paper presents a novel algorithm at node level to offload queries to cloud based on the resources and bandwidth consumed by the query and the cost is dynamically calculated at the cloud platform to decide on offloading.
A Novel Method for Content Consistency and Efficient Full-text Search for P2P Content Sharing Systems.
Hideki Mima,Hideto Tomabechi +1 more
TL;DR: A new P2P content sharing system in which the consistency of contents in the network is maintained after updates or modifications have been made to the contents.
Minimization of Churn and Load of Continuous Queries in P2P Networks
TL;DR: This paper presents CoQUOS a scalable and lightweight middleware to support continuous queries in unstructured P2P networks and focuses on the issues that are of particular importance to the performance of the CoquOS system, namely Churn of the P2p overlay and Load distribution among peers.
Proceedings ArticleDOI
Scalable Approach for Content-Based Image Retrieval in Peer-to-Peer Networks
TL;DR: This work proposes a codebook updating method by sharpen the mutual information between the follow –up codebook, and the workload balance among peers that manage different code words in order to further improve retrieval performance and reduce network cost.
Bloom's filters : their types and analysis bloom fltreler : çetlerve analz
TL;DR: This paper examines and analyse the different types of this Bloom filter, a randomized data-structure for concisely representing a set in order to support approximate membership queries.
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