Abstract
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, TwigStack and TSGeneric, have been recognized as optimal solutions when the twig pattern only involves A-D(ancestor-descendant) relationships, while iTwigJoin can be optimal for partial twig patterns that contain A-D only or P-C (parent-child) only relationships. However, existing algorithms involve unnecessary computations and CPU cost of them can be further improved, and we in this paper mainly address this problem. We first propose three effective optimization rules to avoid those unnecessary computations, and then present two algorithms incorporated with these optimization rules to effectively answer twig patterns in leaf-to-root combining with root-to-leaf way. Experimental results on various datasets indicate that our algorithms perform significantly better than existing proposals.
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
Al-Khalifa, S., Jagadish, H.V., Koudas, N., Patel, J.M., Srivastava, D., Wu, Y.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: ICDE, pp. 141–152 (2002)
Berglund, A., Boag, S., Chamberlin, D., et al.: XML path language 2.0. Technical report, W3C (2002)
Boag, S., Chamberlin, D., Fernandez, M., et al.: XQuery 1.0: An XML query language. W3C (2002)
Bruno, N., Koudas, N., et al.: Holistic Twig Joins: Optimal XML Pattern Matching. In: SIGMOD (2002)
Chen, T., Ling, T.-W., Chan, C.-Y.: Prefix Path Streaming: A New Clustering Method for Optimal Holistic XML Twig Pattern Matching. In: Galindo, F., Takizawa, M., Traunmüller, R. (eds.) DEXA 2004. LNCS, vol. 3180, pp. 801–810. Springer, Heidelberg (2004)
Chen, T., Lu, J., Ling, T.W.: On Boosting Holism In XML Twig Pattern Matching Using Structural Indexing Techniques. In: SIGMOD (2005)
Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.: Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents. In: VLDB, pp. 283–294 (2006)
Choi, B., Mahoui, M., Wood, D.: On the Optimality of Holistic Algorithms for Twig Queries. In: MaÅ™Ãk, V., Å tÄ›pánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 28–37. Springer, Heidelberg (2003)
Chien, S.-Y., Vagena, Z., et al.: Efficient Structural Joins on Indexed XML Documents. In: VLDB (2002)
Florescu, D., Kossmann, D.: Storing and querying XML data using an RDBMS. In: IEEE Data Eng. (1999)
Grust, T.: Accelerating XPath Location Steps. In: SIGMOD, pp. 109–120 (2002)
Jiang, H.F., Lu, H.J., et al.: XR-Tree:Indexing XML Data for Efficient Structural Joins. In: ICDE (2003)
Jiang, H.F., Wang, W., Lu, H.J., et al.: Holistic Twig Joins on Indexed XML Documents. In: VLDB (2003)
Jiang, H.F., Lu, H.J., et al.: Efficient Processing of Twig Queries with OR-Predicates. In: SIGMOD (2004)
Lu, J., Chen, T., Ling, T.W.: Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach. In: CIKM, pp. 533–542 (2004)
Lu, J., Ling, T.W., Chan, C.-Y., Chen, T.: From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching. In: VLDB, pp. 193–204 (2005)
Li, Q., Moon, B.: Indexing and Quering XML Data for Regular Path Expressions. In: VLDB (2001)
Mathis, C., Härder, T., Haustein, M.: Locking-Aware Structural Join Operators for XML Query Processing. In: SIGMOD (2006)
Shanmugasundaram, J., Tufte, K., Zhang, C., Gang, H., DeWitt, D.J., Naughton, J.F.: Relational databases for querying XML documents: Limitations and opportunities. In: VLDB, pp. 302–314 (1999)
Tatarinov, I., Viglas, S., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered XML using a relational database system. In: SIGMOD, pp. 204–215 (2002)
Wu, Y., Patel, J., Jagadish, H.: Structural join order selection for XML query optimization. In: ICDE (2003)
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD, pp. 425–436 (2001)
University of Washington XML Repository, http://www.cs.washington.edu/research/xmldatasets/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, G., Feng, J., Zhang, Y., Zhou, L. (2007). Efficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)