Data indexing in peer-to-peer DHT networks

L. Garcés-Erice, P. A. Felber, E. W. Biersack, G. Urvoy-Keller, K. W. Ross

    Research output: Contribution to conferencePaperpeer-review

    Abstract

    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.

    Original languageEnglish (US)
    Pages200-208
    Number of pages9
    DOIs
    StatePublished - 2004
    EventProceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan
    Duration: Mar 24 2004Mar 26 2004

    Other

    OtherProceedings - 24th International Conference on Distributed Computing Systems
    CountryJapan
    CityHachioji, Tokyo
    Period3/24/043/26/04

    ASJC Scopus subject areas

    • Software
    • Hardware and Architecture
    • Computer Networks and Communications

    Fingerprint Dive into the research topics of 'Data indexing in peer-to-peer DHT networks'. Together they form a unique fingerprint.

    Cite this