A query-adaptive partial distributed hash table for peer-to-peer systems

Authors:
Fabius Klemm;Anwitaman Datta;Karl Aberer
Affiliations:
School of Computer and Communication Sciences, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland;School of Computer and Communication Sciences, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland;School of Computer and Communication Sciences, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
Venue:
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Year:
2004

Citing 9
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Self-Organizing Subsets: From Each According to His Abilities, to Each According to His Needs

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Complex Queries in DHT-based Peer-to-Peer Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: A Self-Organizing Access Structure for P2P Information Systems

CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The two main approaches to find data in peer-to-peer (P2P) systems are unstructured networks using flooding and structured networks using a distributed index A distributed index is usually built over all keys that are stored in the network whether they are queried or not Indexing all keys is no longer feasible when indexing metadata, as the key space becomes very large Here we need a query-adaptive approach that indexes only keys worth indexing, i.e keys that are queried at least with a certain frequency In this paper we study the cost of indexing and propose a query-adaptive partial distributed hash table (PDHT) that does not keep all keys in the index We model and analyze a scenario to show that query-adaptive partial indexing outperforms pure flooding and “index-everything” strategies Furthermore, our scheme is able to automatically adjust the index to changing query frequencies and distributions.