Complex Queries in DHT-based Peer-to-Peer Networks

  • Matthew Harren
  • Joseph M. Hellerstein
  • Ryan Huebsch
  • Boon Thau Loo
  • Scott Shenker
  • Ion Stoica
Conference paper

DOI: 10.1007/3-540-45748-8_23

Volume 2429 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Harren M., Hellerstein J.M., Huebsch R., Loo B.T., Shenker S., Stoica I. (2002) Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel P., Kaashoek F., Rowstron A. (eds) Peer-to-Peer Systems. IPTPS 2002. Lecture Notes in Computer Science, vol 2429. Springer, Berlin, Heidelberg

Abstract

Recently a new generation of P2P systems, offering distributed hash table (DHT) functionality, have been proposed. These systems greatly improve the scalability and exact-match accuracy of P2P systems, but offer only the exact-match query facility. This paper outlines a research agenda for building complex query facilities on top of these DHT-based P2P systems. We describe the issues involved and outline our research plan and current status.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Matthew Harren
    • 1
  • Joseph M. Hellerstein
    • 1
  • Ryan Huebsch
    • 1
  • Boon Thau Loo
    • 1
  • Scott Shenker
    • 2
  • Ion Stoica
    • 1
  1. 1.UC BerkeleyBerkeleyUSA
  2. 2.International Computer Science InstituteBerkeley