24th International Conference on Distributed Computing Systems, 2004. Proceedings. (2004)
Hachioji, Tokyo, Japan
Mar. 24, 2004 to Mar. 26, 2004
L. Garcés-Erice , Institute Eurecom
P. A. Felber , Institute Eurecom
E. W. Biersack , Institute Eurecom
G. Urvoy-Keller , Institute Eurecom
K. W. Ross , Polytechnic University Brooklin
Peer-to-peer distributed hash table (DHT) systems make it simple to discover specific data when their complete identifiers — or keys — are known in advance. In practice, however, users looking up resources stored in peer-to-peer systems often have only partial information for identifying these resources. In this paper, we describe techniques for indexing data stored in peer-to-peer DHT networks, and discovering the resources that match a given user query. Our system creates multiple indexes, organized hierarchically, which permit users to locate data even using scarce information, although at the price of a higher lookup cost. The data itself is stored on only one (or few) of the nodes. Experimental evaluation demonstrates the effectiveness of our indexing techniques on a distributed peer-to-peer bibliographic database with realistic user query workloads.
L. Garcés-Erice, P. A. Felber, G. Urvoy-Keller, K. W. Ross and E. W. Biersack, "Data Indexing in Peer-to-Peer DHT Networks," 24th International Conference on Distributed Computing Systems, 2004. Proceedings.(ICDCS), Hachioji, Tokyo, Japan, 2004, pp. 200-208.