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
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2429)


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.


Query Processing Complex Query Distribute Hash Table Query Plan Very Large Data Base 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Astrahan, M. M., Blasgen, M. W., Chamberlin, D. D., Eswaran, K. P., Gray, J., Griffiths, P. P., III, W. F. K., Lorie, R. A., Mcjones, P. R., Mehl, J. W., Putzolu, G. R., Traiger, I. L., Wade, B. W., and Watson, V. System r: Relational approach to database management. ACM Transactions on Database Systems (TODS) 1, 2 (1976), 97–137.CrossRefGoogle Scholar
  2. [2]
    Bratbergsengen, K. Hashing Methods and Relational Algebra Operations. In Proc. of the International Conferrence on Very Large Data Bases (VLDB) (1984), pp. 323–333.Google Scholar
  3. [3]
    Druschel, P., and Rowstron, A. Past: Persistent and anonymous storage in a peer-to-peer networking environment. In Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems (HotOS 2001) (Elmau/Oberbayern, Germany, May 2001), pp. 65–70.Google Scholar
  4. [4]
  5. [5]
    Graefe, G. Encapsulation of Parallelism in the Volcano Query Processing System. In Proc. ACM-SIGMOD International Conference on Management of Data (Atlantic City, May 1990), pp. 102–111.Google Scholar
  6. [6]
    Graefe, G. Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25, 2 (June 1993), 73–170.CrossRefGoogle Scholar
  7. [7]
    Gribble, S., Halevy, A., Ives, Z., Rodrig, M., and Suciu, D. What can p2p do for database, and vice versa? In Proc. of WebDB Workshop (2001).Google Scholar
  8. [8]
    Haas, P. J., and Hellerstein, J. M. Online Query Processing: A Tutorial. In Proc. ACM-SIGMOD International Conference on Management of Data (Santa Barbara, May 2001). Notes posted online at
  9. [9]
    Hellerstein, J. M., Haas, P. J., and Wang, H. J. Online Aggregation. In Proc. ACM SIGMOD International Conference on Management of Data (1997).Google Scholar
  10. [10]
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., and Zhao, B. OceanStore: An architecture for global-scale persistent storage. In Proceeedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) (Boston, MA, November 2000), pp. 190–201.Google Scholar
  11. [11]
    Plaxton, C., Rajaraman, R., and Richa, A. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA (Newport, Rhode Island, June 1997), pp. 311–320.Google Scholar
  12. [12]
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A scalable content-addressable network. In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161–172.Google Scholar
  13. [13]
    Seltzer, M. I., and Yigit, O. A new hashing package for unix. In Proc. Usenix Winter 1991 Conference (Dallas, Jan. 1991), pp. 173–184.Google Scholar
  14. [14]
    Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM’ 01 Conference (San Diego, California, August 2001).Google Scholar
  15. [15]
    Stonebraker, M., Wong, E., Kreps, P., and Held, G. The design and implementation of ingres. ACM Transactions on Database Systems (TODS) 1, 3 (1976), 189–222.CrossRefGoogle Scholar
  16. [16]
    Wilschut, A. N., and Apers, P. M. G. Dataflow Query Execution in a Parallel Main-Memory Environment. In Proc. First International Conference on Parallel and Distributed Info. Sys. (PDIS) (1991), pp. 68–77.Google Scholar
  17. [17]
    Witten, I. H., Moffat, A., and Bell, T. C. Managing Gigabytes: Compressing and Indexing Documents and Images, second ed. Morgan Kaufmann, 1999.Google Scholar
  18. [18]
    Zhao, B. Y., Kubiatowicz, J., and Joseph, A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkeley, Computer Science Department, 2001.Google Scholar

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

Personalised recommendations