skip to main content
10.1145/1031171.1031272acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
Article

Efficient processing of XML twig patterns with parent child edges: a look-ahead approach

Published: 13 November 2004 Publication History

Abstract

With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database. A number of algorithms have been proposed recently to process a twig query holistically. Those algorithms are quite efficient for quires with only ancestor-descendant edges. But for queries with mixed ancestor-descendant and parent-child edges, the previous approaches still may produce large intermediate results, even when the input and output size are more manageable. To overcome this limitation, in this paper, we propose a novel holistic twig join algorithm, namely <i>TwigStackList</i>. Our main technique is to look-ahead read some elements in input data steams and cache limited number of them to <i>lists</i> in the main memory. The number of elements in any list is bounded by the length of the longest path in the XML document. We show that <i>TwigStackList</i> is I/O optimal for queries with only ancestor-descendant relationships below branching nodes. Further, even when queries contain parent-child relationship below branching nodes, the set of intermediate results in <i>TwigStackList</i> is guaranteed to be a subset of that in previous algorithms. We complement our experimental results on a range of real and synthetic data to show the significant superiority of <i>TwigStackList</i> over previous algorithms for queries with <i>parent</i>-<i>child</i> relationships.

References

[1]
S. Al-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel. Y. Wu, N. Koudas, D. Srivastava "Structural Joins: A primitive for efficient XML query pattern matching" In Proceedings of ICDE 2002 pages 141--152
[2]
A. Berglund, S. Boag, D. Chamberlin, M. F. Fernandez, M. Kay, J. Robie, J. Simeon "XML Path Language (XPath) 2.0" W3C Working Draft 22 August 2003
[3]
S. Boag, D. Chamberlin, M. F. Fernandez, D. Florescu J. Robie, J. Simeon "Xquery 1.0: An XML QueryW3C" Working Draft 22 August 2003
[4]
N. Bruno, N. Koudas, and D. Srivastava. "Holistic twig joins: Optimal XML pattern matching" Technical Report Columbia University March 2002
[5]
N. Bruno, N. Koudas, and D. Srivastava. "Holistic twig joins: Optimal XML pattern matching" In Proceedings of ACM SIGMOD 2002 pages 310--321
[6]
Y. Chen, S. B. Davidson, Y. Zheng "BLAS: An Efficient XPath Processing System" In Proceedings of SIGMOD 2004, pages 47--58
[7]
B. Choi, M. Mahoui, D. Wood "On the Optimality of Holistic Algorithms for Twig Queries" DEXA 2003 pages 28--37
[8]
J.Hellerstein, J. Naughton, and A. Pfeifer "Generalized search trees for database systems" In Proceedings of VLDB, 1995 pages 562--573
[9]
H. Jiang, W. Wang, H. Lu and J.X. Yu "Holistic twig joins on indexed XML documents" In Proceedings of VLDB 2003 pages 273--284
[10]
H. Jiang, H. Lu, W. Wang, B. C. Ooi "XR-Tree: Indexing XML Data for Efficient Structural Joins" In Proceedings of ICDE 2003, pages 253--263
[11]
H. Jiang, H. Lu, W. Wang "Efficient Processing of Twig Queries with OR-Predicates" In Proceedings of SIGMOD 2004, pages 59--70
[12]
Q. Li and B. Moon "Indexing and querying XML data for regular path expressions" In Proceedings of VLDB 2001 pages 361--370
[13]
I. Tatarinov, S. Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, and C. Zhang "Storing and Querying Ordered XML Using a Relational Database System" In Proceedings of ACM SIGMOD 2002 pages 204--215
[14]
Y. Wu, J. M. Patel, H. V. Jagadish "Structural Join Order Selection for XML Query Optimization" ICDE 2003 pages 443--454
[15]
XML-benchmark http://monetdb.cwi.nl/xml
[16]
University of Washington XML Repository. Available from http://www.cs.washington.edu/research/xmldatasets/
[17]
C. Zhang, J.F. Naughton, D.J. Dewitt, Q. Luo and G.M. Lohman "On Supporting containment Queries in Relational Database Management Systems" In Proceedings of. ACM SIGMOD, 2001 pages 425--436

Cited By

View all
  • (2021)Demythization of Structural XML Query Processing: Comparison of Holistic and Binary ApproachesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.294615733:4(1439-1452)Online publication date: 1-Apr-2021
  • (2020)Solving the Intractable Problem: Optimal Performance for Worst Case Scenarios in XML Twig Pattern MatchingIEEE Access10.1109/ACCESS.2020.30330088(192569-192586)Online publication date: 2020
  • (2020)Distributed Tree-Pattern Matching in Big Data Analytics SystemsAdvances in Databases and Information Systems10.1007/978-3-030-54832-2_14(171-186)Online publication date: 17-Aug-2020
  • Show More Cited By

Index Terms

  1. Efficient processing of XML twig patterns with parent child edges: a look-ahead approach

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    CIKM '04: Proceedings of the thirteenth ACM international conference on Information and knowledge management
    November 2004
    678 pages
    ISBN:1581138741
    DOI:10.1145/1031171
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 13 November 2004

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. XML
    2. holistic twig pattern matching

    Qualifiers

    • Article

    Conference

    CIKM04
    Sponsor:
    CIKM04: Conference on Information and Knowledge Management
    November 8 - 13, 2004
    D.C., Washington, USA

    Acceptance Rates

    Overall Acceptance Rate 1,861 of 8,427 submissions, 22%

    Upcoming Conference

    CIKM '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Demythization of Structural XML Query Processing: Comparison of Holistic and Binary ApproachesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.294615733:4(1439-1452)Online publication date: 1-Apr-2021
    • (2020)Solving the Intractable Problem: Optimal Performance for Worst Case Scenarios in XML Twig Pattern MatchingIEEE Access10.1109/ACCESS.2020.30330088(192569-192586)Online publication date: 2020
    • (2020)Distributed Tree-Pattern Matching in Big Data Analytics SystemsAdvances in Databases and Information Systems10.1007/978-3-030-54832-2_14(171-186)Online publication date: 17-Aug-2020
    • (2018)TwigStackPrime: A Novel Twig Join Algorithm Based on Prime NumbersWeb Information Systems and Technologies10.1007/978-3-319-93527-0_1(1-20)Online publication date: 19-Jun-2018
    • (2017)Structural XML Query ProcessingACM Computing Surveys10.1145/309579850:5(1-41)Online publication date: 26-Sep-2017
    • (2017)Multi-query processing of XML data streams on multicoreThe Journal of Supercomputing10.1007/s11227-016-1919-073:6(2339-2368)Online publication date: 1-Jun-2017
    • (2017)FSPTwigFastApplied Intelligence10.1007/s10489-017-0949-547:4(1224-1239)Online publication date: 1-Dec-2017
    • (2015)Cost-based holistic twig joinsInformation Systems10.1016/j.is.2015.03.00452:C(21-33)Online publication date: 1-Aug-2015
    • (2013)A Survey of XML Tree PatternsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2011.20925:1(29-46)Online publication date: 1-Jan-2013
    • (2013)Object-Based Semantic Partitioning for XML Twig Query OptimizationProceedings of the 2013 IEEE 27th International Conference on Advanced Information Networking and Applications10.1109/AINA.2013.74(846-853)Online publication date: 25-Mar-2013
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media