Abstract
XML query languages feature powerful primitives for formulating queries, involving comparison expressions which are existentially quantified. If such comparisons involve several scopes, they are correlated and, thus, become difficult to evaluate efficiently.
In this paper, we develop a new ternary operator, called Kappa-Join, for efficiently evaluating queries with existential quantification. In XML queries, a correlation predicate can occur conjunctively and disjunctively. Our decorrelation approach not only improves performance in the conjunctive case, but also allows decorrelation of the disjunctive case. The latter is not possible with any known technique. In an experimental evaluation, we compare the query execution times of the Kappa-Join with existing XPath evaluation techniques to demonstrate the effectiveness of our new operator.
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.
Similar content being viewed by others
References
Barbosa, D., Mendelzon, A., Keenleyside, J., Lyons, K.: ToXgene: a template-based data generator for XML. In: Proceedings of the ACM Sigmod, Madison, USA (2002)
Beeri, C., Tzaban, Y.: SAL: An algebra for semistructured data and XML. In: WebDB (Informal Proceedings), pp. 37–42 (1999)
Boncz, P.A., Grust, T., Manegold, S., Rittinger, J., Teubner, J.: Pathfinder: Relational xquery over multi-gigabyte XML inputs in interactive time. Technical Report INS-E0503, CWI. MonetDB 4.8.0, Pathfinder 0.8.0 (March 2005)
Brantner, M., Helmer, S., Kanne, C.-C., Moerkotte, G.: Full-fledged Algebraic XPath Processing in Natix. In: Proceedings of the ICDE Conference, Tokyo, Japan, pp. 705–716 (2005)
Brantner, M., Kanne, C.-C., Helmer, S., Moerkotte, G.: Algebraic Optimization of Nested XPath Expressions. In: Proceedings of the ICDE Conference, Atlanta, p. 128 (2006)
Brantner, M., May, N., Moerkotte, G.: Unnesting SQL queries in the presence of disjunction. Technical report, University of Mannheim (March 2006), http://db.informatik.uni-mannheim.de/publications/TR-06-001.pdf
Bry, F.: Towards an efficient evaluation of general queries: quantifier and disjunction processing revisited. In: Proceedings of ACM SIGMOD Conference, Oregon, USA, pp. 193–204 (1989)
Claußen, J., Kemper, A., Moerkotte, G., Peithner, K., Steinbrunn, M.: Optimization and evaluation of disjunctive queries. IEEE Trans. Knowl. Data Eng. 12(2), 238–260 (2000)
Dayal, U.: Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In: Proceedings of the VLDB Conference, Brighton, England, pp. 197–208 (1987)
Fiebig, T., Helmer, S., Kanne, C.-C., Moerkotte, G., Neumann, J., Schiele, R., Westmann, T.: Anatomy of a native XML base management system. VLDB Journal 11(4), 292–314 (2002)
Galindo-Legaria, C., Joshi, M.: Orthogonal optimization of subqueries and aggregation. In: Proceedings of ACM SIGMOD Conference, Santa Barbara, USA, pp. 571–581 (2001)
Ganski, R.A., Wong, H.K.T.: Optimization of nested sql queries revisited. In: Proceedings of the ACM SIGMOD, San Francisco, California, pp. 23–33. ACM Press, New York (1987)
Gottlob, G., Koch, C., Pichler, R.: XPath query evaluation: Improving time and space efficiency. In: Proceedings of the ICDE Conference, Bangalore, India, pp. 379–390 (2003)
Graefe, G.: Query evaluation techniques for large databases. ACM Computing Surveys 25(2), 73–170 (1993)
Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D., Thompson, K.: Tax: A tree algebra for XML. In: Prcoceedings of the DBPL Conference, Frascati, Italy, pp. 149–164 (2001)
Jarke, M., Koch, J.: Query optimization in database systems. ACM Computing Surveys 16(2), 111–152 (1984)
Kiessling, W.: SQL-like and Quel-like correlation queries with aggregates revisited. ERL/UCB Memo 84/75, University of Berkeley (1984)
Kim, W.: On optimizing an SQL-like nested query. j-TODS 7(3), 443–469 (1982)
Koch, C.: XMLTaskForce XPath evaluator (2004), Released 2004-09-30
May, N., Helmer, S., Moerkotte, G.: Nested queries and quantifiers in an ordered context. In: Proceedings of the ICDE Conference, Boston, MA, USA, pp. 239–250 (2004)
Brantner, M., Helmer, S., Kanne, C.-C., Moerkotte, G.: Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages. Technical Report TR-2006-001, University of Mannheim (2006), http://pi3.informatik.uni-mannheim.de/publikationenDetails.html.en#ID514
Neumann, T.: Efficient Generation and Execution of DAG-Structured Query Graphs. PhD thesis, University of Mannheim (2005)
Re, C., Siméon, J., Fernández, M.F.: A complete and efficient algebraic compiler for xquery. In: Proceedings of the ICDE Conference, Atlanta, USA, p. 14 (2006)
Roy, P.: Optimization of DAG-structured query evaluation plans. Master’s thesis, Indian Institute of Technology, Bombay (1998)
Sartiani, C., Albano, A.: Yet another query algebra for XML data. In: Proceedings of the IDEAS Conference, Edmonton, Canada, pp. 106–115 (2002)
Seshadri, P., Pirahesh, H., Cliff Leung, T.Y.: Complex query decorrelation. In: Proceedings of the ICDE Conference, New Orleans, USA, pp. 450–458 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brantner, M., Helmer, S., Kanne, CC., Moerkotte, G. (2006). Kappa-Join: Efficient Execution of Existential Quantification in XML Query Languages. In: Amer-Yahia, S., Bellahsène, Z., Hunt, E., Unland, R., Yu, J.X. (eds) Database and XML Technologies. XSym 2006. Lecture Notes in Computer Science, vol 4156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841920_1
Download citation
DOI: https://doi.org/10.1007/11841920_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38877-7
Online ISBN: 978-3-540-38879-1
eBook Packages: Computer ScienceComputer Science (R0)