Data indexing in peer-to-peer DHT networks

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

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    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)
    Title of host publicationProceedings - 24th International Conference on Distributed Computing Systems
    Pages200-208
    Number of pages9
    Volume24
    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

    Fingerprint

    Costs

    ASJC Scopus subject areas

    • Hardware and Architecture

    Cite this

    Garcés-Erice, L., Felber, P. A., Biersack, E. W., Urvoy-Keller, G., & Ross, K. (2004). Data indexing in peer-to-peer DHT networks. In Proceedings - 24th International Conference on Distributed Computing Systems (Vol. 24, pp. 200-208)

    Data indexing in peer-to-peer DHT networks. / Garcés-Erice, L.; Felber, P. A.; Biersack, E. W.; Urvoy-Keller, G.; Ross, Keith.

    Proceedings - 24th International Conference on Distributed Computing Systems. Vol. 24 2004. p. 200-208.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Garcés-Erice, L, Felber, PA, Biersack, EW, Urvoy-Keller, G & Ross, K 2004, Data indexing in peer-to-peer DHT networks. in Proceedings - 24th International Conference on Distributed Computing Systems. vol. 24, pp. 200-208, Proceedings - 24th International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan, 3/24/04.
    Garcés-Erice L, Felber PA, Biersack EW, Urvoy-Keller G, Ross K. Data indexing in peer-to-peer DHT networks. In Proceedings - 24th International Conference on Distributed Computing Systems. Vol. 24. 2004. p. 200-208
    Garcés-Erice, L. ; Felber, P. A. ; Biersack, E. W. ; Urvoy-Keller, G. ; Ross, Keith. / Data indexing in peer-to-peer DHT networks. Proceedings - 24th International Conference on Distributed Computing Systems. Vol. 24 2004. pp. 200-208
    @inproceedings{39aa3d254ffd4e7c9c7ade10b70aa573,
    title = "Data indexing in peer-to-peer DHT networks",
    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.",
    author = "L. Garc{\'e}s-Erice and Felber, {P. A.} and Biersack, {E. W.} and G. Urvoy-Keller and Keith Ross",
    year = "2004",
    language = "English (US)",
    volume = "24",
    pages = "200--208",
    booktitle = "Proceedings - 24th International Conference on Distributed Computing Systems",

    }

    TY - GEN

    T1 - Data indexing in peer-to-peer DHT networks

    AU - Garcés-Erice, L.

    AU - Felber, P. A.

    AU - Biersack, E. W.

    AU - Urvoy-Keller, G.

    AU - Ross, Keith

    PY - 2004

    Y1 - 2004

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=2442427528&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=2442427528&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:2442427528

    VL - 24

    SP - 200

    EP - 208

    BT - Proceedings - 24th International Conference on Distributed Computing Systems

    ER -