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
Book ChapterDOI
Text-Based p2p content search using a hierarchical architecture
Junjie Jiang,Weinong Wang +1 more
TL;DR: This paper proposes a text-based peer-to-peer content search solution, which uses a hierarchical architecture, and the experimental results show that the solution is feasible and efficient.
Dissertation
FreeCore : un système d'indexation de résumés de document sur une Table de Hachage Distribuée (DHT)
TL;DR: In this article, the problem of indexation and recherche dans the tables of distributed hash tables (DHTs) has been studied, and the authors propose an indexing scheme based on the Filtre de Blooms (FBs) to represent the resumes of documents.
P2P Web Search Technology
TL;DR: Key techniques for building a feasible and efficient P2P Web search engine are reviewed, including system topology, data placement, query routing, index partitioning, collection selection, relevance ranking and Web crawling.
Proceedings ArticleDOI
Bandwidth-Efficient Continuous Query Processing over DHTs
TL;DR: This paper proposes novel techniques to reduce bandwidth cost in a continuous keyword query processing system that is based on a distributed hash table and argues that query indexing and document announcement are of significant importance towards this goal.
Proceedings ArticleDOI
Hybrid Overlay Structure Based on Virtual Node
TL;DR: Aiming at integrating the flexibility of unstructured architectures with the regularity of structured architectures, a hybrid overlay structure based on virtual node is proposed, which can work well with low maintenance cost in the dynamic environment.
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