Abstract
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networks which tackle efficient query distribution to a large set of peers but assume that each query can be answered completely at each peer. For queries which need data from more than one peer to be executed this is clearly insufficient. Unfortunately, though quite a few database techniques can be re-used in the P2P context, P2P data management infrastructures pose additional challenges caused by the dynamic nature of these networks. In P2P networks, we can assume neither global knowledge about data distribution, nor the suitableness of static topologies and static query plans for these networks. Unlike in traditional distributed database systems, we cannot assume complete information schema and allocation schema instances but rather work with distributed schema information which can only direct query processing tasks from one node to one or more neighboring nodes.
In this paper we first describe briefly our super-peer based topology and schema-aware distributed routing indices extended with suitable statistics and describe how this information is extracted and updated. Second we show how these indices facilitate the distribution and dynamic expansion of query plans. Third we propose a set of transformation rules to optimize query plans and discuss different optimization strategies in detail, enabling efficient distributed query processing in a schema-based P2P network.
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
Aberer, K., Hauswirth, M.: Semantic gossiping. In: Database and Information Systems Research for Semantic Web and Enterprises, Invitational Workshop, University of Georgia, Amicalola Falls and State Park, Georgia (April 2002)
Bernstein, P.A., Giunchiglia, F., Kementsietsidis, A., Mylopoulos, J., Serafini, L., Zaihrayeu, I.: Data management for peer-to-peer computing: A vision. In: Proceedings of the Fifth International Workshop on the Web and Databases, Madison, Wisconsin (June 2002)
Boncz, P., Treijtel, C.: AmbientDB: Relational Query Processing over P2P Network. In: International Workshop on Databases, Information Systems and Peer-to-Peer Computing, Berlin, Germany (September 2003)
Braumandl, R.: Quality of Service and Query Processing in an Information Economy. PhD thesis, Universität Passau, Fakultät für Mathematik und Informatik, D-94030 Passau, Universität Passau (2001)
Braumandl, R., Keidl, M., Kemper, A., Kossmann, D., Kreutz, A., Seltzsam, S., Stocker, K.: ObjectGlobe: Ubiquitous query processing on the Internet. The VLDB Journal: Special Issue on E-Services 10(3), 48–71 (2001)
Brunkhorst, I., Dhraief, H., Kemper, A., Nejdl, W., Wiesner, C.: Distributed queries and query optimization in schema-based P2P-systems. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) VLDB 2003. LNCS, vol. 2944, pp. 184–199. Springer, Heidelberg (2004)
The Edutella Project (2002), http://edutella.jxta.org/
Ganguly, S., Hasan, W., Krishnamurthy, R.: Query optimization for parallel execution. In: Proc. of the ACM SIGMOD Conf. on Management of Data, San Diego, CA, USA, June 1992, pp. 9–18 (1992)
Gong, L.: Project JXTA: A technology overview. Technical report, SUN Microsystems (April 2001), http://www.jxta.org/project/www/docs/TechOverview.pdf
Halevy, A.Y., Ives, Z.G., Mork, P., Tatarinov, I.: Piazza: Data management infrastructure for semantic web applications. In: Proceedings of the Twelfth International World Wide Web Conference (WWW 2003), Budapest, Hungary (May 2003)
Ioannidis, Y.E.: The History of Histograms. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 19–30 (2003)
Josifovski, V., Schwarz, P., Haas, L., Lin, E.: Garlic: A New Flavor of Federated Query Processing for DB2. In: Proc. of the ACM SIGMOD Conf. on Management of Data, Madison, USA (June 2002)
Project JXTA Homepage, http://www.jxta.org/
Kemper, A., Wiesner, C.: HyperQueries: Dynamic Distributed Query Processing on the Internet. In: Proc. of the Conf. on Very Large Data Bases (VLDB), Rom, Italy, September 2001, pp. 551–560 (2001)
Kemper, A., Wiesner, C., Winklhofer, P.: Building Dynamic Market Places using HyperQueries. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 749–752. Springer, Heidelberg (2002)
Levy, A.Y., Srivastava, D., Kirk, T.: Data Model and Query Evaluation in Global Information Systems. Journal of Intelligent Information Systems (JIIS) 5(2), 121–143 (1995)
Nejdl, W., Wolf, B., Qu, C., Decker, S., Sintek, M., Naeve, A., Nilsson, M., Palmér, M., Risch, T.: EDUTELLA: A P2P Networking Infrastructure based on RDF. In: Proceedings of the 11th International World Wide Web Conference, Hawaii, USA (May 2002), http://edutella.jxta.org/reports/edutella-whitepaper.pdf
Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., Loser, A.: Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks. In: Proceedings of the International World Wide Web Conference, Budapest, Hungary (May 2003), http://citeseer.nj.nec.com/nejdl02superpeerbased.html
Papadimos, V., Maier, D.: Distributed Query Processing and Catalogs for Peer-to-Peer Systems, Asilomar, CA, USA (January 2003)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content addressable network. In: Proceedings of the 2001 Conference on applications, technologies, architectures, and protocols for computer communications. ACM Press, New York (2001)
Schlosser, M., Sintek, M., Decker, S., Nejdl, W.: HyperCuP—Hypercubes, Ontologies and Efficient Search on P2P Networks. In: International Workshop on Agents and Peer-to-Peer Computing, Bologna, Italy (July 2002)
Steinbrunn, M., Moerkotte, G., Kemper, A.: Heuristic and randomized optimization for the join ordering problem. The VLDB Journal 6(3), 191–208 (1997)
Stillger, M., Lohman, G.M., Markl, V., Kandil, M.: LEO - DB2’s LEarning Optimizer. In: Proc. of the Conf. on Very Large Data Bases (VLDB), Rom, Italy, September 2001, pp. 19–28 (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.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. ACM Press, New York (2001)
Stuckenschmidt, H., Vdovjak, R., Houben, G.-J., Broekstra, J.: Index structures and algorithms for querying distributed rdf repositories. In: Proceedings of the 13th International World Wide Web Conference (WWW 2004), New York, USA (May 2004)
Wiesner, C., Kemper, A., Brandl, S.: Dynamic, Extendible Query Processing in Super-Peer Based P2P Systems (Demonstration). In: Proc. IEEE Conf. on Data Engineering, Boston, USA (March 2004)
Yang, B., Garcia-Molina, H.: Improving search in peer-to-peer systems. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, Viena, Austria (July 2002), http://dbpubs.stanford.edu:8090/pub/2001-47
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dhraief, H., Kemper, A., Nejdl, W., Wiesner, C. (2005). Processing and Optimization of Complex Queries in Schema-Based P2P-Networks. In: Ng, W.S., Ooi, BC., Ouksel, A.M., Sartori, C. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2004. Lecture Notes in Computer Science, vol 3367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31838-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-31838-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25233-7
Online ISBN: 978-3-540-31838-5
eBook Packages: Computer ScienceComputer Science (R0)