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
Efficient search in file-sharing networks
P. Burstein,Alan Jay Smith +1 more
TL;DR: This paper presents a new and improved implementation of a distributed file-sharing system yielding query result quality better than flooding and close to a centralized index, and low-maintenance network overhead, from optimized approaches to high churn rates and skewed workloads.
Journal ArticleDOI
Low Power Bloom Filter Architectures Using Multi-Stage Lookup Technique
M. Arun,A. Krishnan +1 more
TL;DR: This paper proposes a new multi-stage lookup technique for Bloom filters and the theoretical power analysis of the proposed lookup techniques is presented, which shows that a decrease in the number of hash functions per stage results in power gain.
Proceedings ArticleDOI
SEIF: Search Enhanced by Intelligent Feedback in Unstructured P2P Networks
Xiaoyu Yang,Yiming Hu +1 more
TL;DR: A distributed, content-based, heuristic feedback mechanism is proposed, which allows peers to keep track of recent queries and learn from the assessment of answers to previous queries, so as to self-adaptively route the subsequent query to the most relevant nodes which are responsible for the query.
Distributed resource discovery: architectures and applications in mobile networks
TL;DR: The author Nicklas Beijar presents his dissertation Distributed Resource Discovery: Architectures and Applications in Mobile Networks, which aims to explore distributed resource discovery in mobile networks.
Adaptive Data Propagation in Peer-to-Peer Systems
TL;DR: This work is looking for a way to efficiently locate an object in a fully decentralized, self-organizing network, when a reference to that object is given, for the scalability of the system.
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