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
Dissertation
Erkennung und Vermeidung von unkooperativem Verhalten in Peer-to-Peer-Datenstrukturen.
TL;DR: FairNet beruht darauf, dass topologisch benachbarte Peers nachvollziehbare Beobachtungen über geleistete oder verweigerte Arbeit austauschen, bevor sie am P2P-Netz partizipieren können.
DissertationDOI
Autonomous management for service specific overlay networks
TL;DR: This dissertation investigates the problem of SSON's management, and proposes an autonomous SSON management framework based on a self-organizing approach, which is powered by learning rules induced from biological systems, and endowed with filtering rules to achieve the highest possible performance.
Friticores: A RSS Feed Monitoring and Dissemination System
TL;DR: The key contributions presented comprise the architecture of the system and the services offered to both consumers and providers, a partitioned persistent representation of feeds, and a distributed index scheme.
Book ChapterDOI
Performing efficient keyword search by keyword grouping in DHT peer-to-peer network
Yin Li,Fanyuan Ma,Liang Zhang +2 more
TL;DR: Experiments results clearly demonstrated that the improved keyword search system can match standard inverted index in insert overhead and storage overhead, while can compete with KSS index in query overhead.
Proceedings ArticleDOI
An Efficient Hierarchical DHT-Based Complex Query for Multimedia Information
Haiyang Zhang,Huadong Ma +1 more
TL;DR: This paper proposes an efficient hierarchical DHT-based method for addressing two important problems that are encountered while using DHTs in distributed multimedia information queries: multi-attribute query, and range query.
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