Abstract
In this work we study how to process complex queries in DHT-based Peer-to-Peer (P2P) data networks. Queries are made over tuples and relations and are expressed in a query language, such as SQL. We describe existing research approaches for query processing in P2P systems, we suggest improvements and enhancements, and propose a unifying framework that consists of a modified DHT architecture, data placement and search algorithms, and provides efficient support for processing a variety of query types, including queries with one or more attributes, queries with selection operators (involving equality and range queries), and queries with join operators. To our knowledge, this is the first work that puts forth a framework providing support for all these query types.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gnutella: http://gnutella.wego.com
Wilcox, B., Hearn, O.: Experiences Deploying a Large-Scale Emergent Network. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 104. Springer, Heidelberg (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, K.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, pp. 149–160. ACM Press, New York (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable Content- Addressable Network. In: ACM SIGCOMM 2001 (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for larg-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, Y.B., Kubiatowitcz, J., Joseph, A.: Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Tech. Rep. UCB/CSD-01-1141, University of California at Berkley, Computer Science Department (2001)
Aberer, K.: P-Grid: A self-organizing access structure for P2P information systems. In: Proc. of the 6th International Conference on Cooperative Information Systems (CoopIS 2001), Trento, Italy (2001)
Gribble, S., Halevy, A., Ives, Z., Rodrig, M., Suciu, D.: What Can Databases Do for Peer-to-Peer? In: Proc. of the WebDB Workshop on Databases and the Web (2001)
Gupta, A., Agrawal, D., Abbadi, A.E.: Approximate Range Selection Queries in Peer-to-Peer Systems. In: Proc. of the 2003 CIDR Conference (2003)
Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations (extended abstract). In: Proc. of the thirtieth annual ACM symposium on Theory of computing, pp. 327–336. ACM Press, New York (1998)
Sahin, O.D., Gupta, A., Agrawal, D., Abbadi, A.E.: Query Processing Over Peer-to-Peer Data Sharing Systems. Technical Report UCSB/CSD-2002-28, University of California at Santa Barbara (2002)
Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proc. of the 2nd IEEE International Conference on Peer-to-Peer (2002)
Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmaier, P.: Space Filling Curves and their use in Geometric Data Structures. Theoretical Computer Science 181, 3–15 (1997)
Felber, P.A., Biersack, E.W., Garces-Erice, L., Ross, K.W., Urvoy-Keller, G.: Data Indexing and querying in DHT Peer-to-Peer Networks (working paper)
Harren, M., Hellerstein, J., Huebch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 242. Springer, Heidelberg (2002)
Huebsch, R., Hellerstein, J., Lanham, N., Loo, B.T., Shenker, S.: Querying the Internet with PIER. In: The Proc. of the 29th VLDB Conference, Berlin, Germany (2003)
FIPS180-1. Secure hash Standard. U.S. Department of Commerce/NIST, National Technical Information Service, Springield, VA (1995)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)
Mishra, P., Eich, M.: Join Processing in Relational Databases. ACM Computing Surveys 24(1) (1992)
Kossman, D.: The State of the Art in Distributed Query Processing. ACM Computing Surveys (2000)
Clarke, I., et al.: Freenet: A Distributed, Anonymous Information Storage and Retrieval System. In: Proc. ICSI Works. on Design Issues in Anonymity and Unobservability (2000)
Triantafillou, P., et al.: Towards High Performance Peer-to-Peer Content and Resource Sharing Systems. In: Proc. CIDR Conf. on Innovative Data Systems Research (2003)
Triantafillou, P.: Peer-to-Peer Network Architectures: The Next Step. In: Invited presentation at SIGCOMM 2003 / FDNA 2003 (2003), www.ceid.upatras.gr/faculty/peter/papers/fdna03.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Triantafillou, P., Pitoura, T. (2004). Towards a Unifying Framework for Complex Query Processing over Structured Peer-to-Peer Data Networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive