Article

Efficient processing of XML twig queries with OR-predicates

Authors:

Wei WangAuthors Info & Claims

SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

Pages 59 - 70

https://doi.org/10.1145/1007568.1007578

Published: 13 June 2004 Publication History

Abstract

An XML twig query, represented as a labeled tree, is essentially a complex selection predicate on both structure and content of an XML document. Twig query matching has been identified as a core operation in querying tree-structured XML data. A number of algorithms have been proposed recently to process a twig query holistically. Those algorithms, however, only deal with twig queries without OR-predicates. A straightforward approach that first decomposes a twig query with OR-predicates into multiple twig queries without OR-predicates and then combines their results is obviously not optimal in most cases. In this paper, we study novel holistic-processing algorithms for twig queries with OR-predicates without decomposition. In particular, we present a merge-based algorithm for sorted XML data and an index-based algorithm for indexed XML data. We show that holistic processing is much more efficient than the decomposition approach. Furthermore, we show that using indexes can significantly improve the performance for matching twig queries with OR-predicates, especially when the queries have large inputs but relatively small outputs.

References

[1]

IBM XML data generator. http://www.alphaworks.ibm.com/tech/xmlgenerator.]]

[2]

S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Minimization of tree pattern queries. In SIGMOD, pages 497--508, 2001.]]

Digital Library

[3]

N. Bruno, N. Koudas, and D. Srivastava. Holistic twig joins: Optimal XML pattern matching. In SIGMOD, pages 310--321, 2002.]]

Digital Library

[4]

S.-Y. Chien, Z. Vagena, D. Zhang, V. J. Tsotras, and C. Zaniolo. Efficient structural joins on indexed XML documents. In VLDB, pages 263--274, 2002.]]

Digital Library

[5]

B. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, and M. Shadmon. A fast index for semistructured data. In VLDB, pages 341--350, 2001.]]

Digital Library

[6]

T. Fiebig, S. Helmer, C.-C. Kanne, G. Moerkotte, J. Neumann, R. Schiele, and T. Westmann. Anatomy of a native XML base management system. VLDB Journal, 11(4):292--314, 2002.]]

Digital Library

[7]

R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, pages 436--445, 1997.]]

Digital Library

[8]

A. Halverson, J. Burger, A. Kini, R. Krishnamurthy, A. N. Rao, F. Tian, S. Viglas, Y. Wang, J. F. Naughton, and D. J. DeWitt. Mixed mode XML query processing. In VLDB, pages 225--236, 2003.]]

Digital Library

[9]

H. V. Jagadish, S. Al-Khalifa, A. Chapman, L. V. S. Lakshmanan, A. Nierman, S. Paparizos, J. M. Patel, D. Srivastava, N. Wiwatwattana, Y. Wu, and C. Yu. TIMBER: A native XML database. VLDB Journal, 11(4):274--291, 2002.]]

Digital Library

[10]

H. Jiang, H. Lu, W. Wang, and B. C. Ooi. XR-Tree: Indexing XML data for efficient structural joins. In ICDE, pages 253--264, 2003.]]

[11]

H. Jiang, W. Wang, H. Lu, and J. X. Yu. Holistic twig joins on indexed XML documents. In VLDB, pages 273--284, 2003.]]

Digital Library

[12]

R. Kaushik, P. Bohannon, J. Naughton, and H. Korth. Covering indexes for branching path queries. In SIGMOD, pages 133--144, 2002.]]

Digital Library

[13]

Q. Li and B. Moon. Indexing and querying XML data for regular path expressions. In VLDB, pages 361--370, 2001.]]

Digital Library

[14]

J. McHugh, S. Abiteboul, R. Goldman, D. Quass, and J. Widom. Lore: A database management system for semistructured data. SIGMOD Record, 26(3):54--66, 1997.]]

Digital Library

[15]

J. McHugh and J. Widom. Query optimization for XML. In VLDB, pages 315--326, 1999.]]

Digital Library

[16]

T. Milo and D. Suciu. Index structures for path expressions. In ICDT, pages 277--295, 1999.]]

Digital Library

[17]

D. Quass, J. Widom, R. Goldman, K. Haas, Q. Luo, J. McHugh, S. Nestorov, A. Rajaraman, H. Rivero, S. Abiteboul, J. D. Ullman, and J. L. Wiener. LORE: A lightweight object REpository for semistructured data. In SIGMOD, pages 549--549, 1996.]]

Digital Library

[18]

D. Srivastava, S. Al-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, and Y. Wu. Structural joins: A primitive for efficient XML query pattern matching. In ICDE, pages 141--152, 2002.]]

Digital Library

[19]

H. Wang, S. Park, W. Fan, and P. S. Yu. Vist: A dynamic index method for querying XML data by tree structures. In SIGMOD, pages 110--121, 2003.]]

Digital Library

[20]

Y. Wu, J. M. Patel, and H. V. Jagadish. Structural join order selection for XML query optimization. In ICDE, pages 443--454, 2003.]]

[21]

C. Zhang, J. F. Naughton, D. J. DeWitt, Q. Luo, and G. M. Lohman. On supporting containment queries in relational database management systems. In SIGMOD, pages 425--436, 2001.]]

Digital Library

Cited By

Jaya Lakshmi AJoe Prathap P(2023)An Energy-Efficient Approach to Transfer Data from WSN to Mobile DevicesSentiment Analysis and Deep Learning10.1007/978-981-19-5443-6_11(127-137)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-981-19-5443-6_11
Bača RKrátký MHolubová INečaský MSkopal TSvoboda MSakr S(2017)Structural XML Query ProcessingACM Computing Surveys10.1145/309579850:5(1-41)Online publication date: 26-Sep-2017
https://dl.acm.org/doi/10.1145/3095798
Bi XZhao XWang G(2017)Efficient Processing of Distributed Twig Queries Based on Node DistributionJournal of Computer Science and Technology10.1007/s11390-017-1707-132:1(78-92)Online publication date: 11-Jan-2017
https://doi.org/10.1007/s11390-017-1707-1
Show More Cited By

Efficient processing of XML twig queries with OR-predicates
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Efficient processing of multiple XML twig queries
DEXA'06: Proceedings of the 17th international conference on Database and Expert Systems Applications

Finding all occurrences of a twig pattern in an XML document is a core operation for XML query processing. The emergence of XML as a common mark-up language for data interchange has spawned great interest in techniques for filtering and content-based ...
Efficient Processing of XML Twig Queries with All Predicates
ICIS '09: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Some researches have proposed part solutions to process XML twig queries with AND,OR, or NOT predicates. However, very Little ...
Efficient processing of top-k twig queries over probabilistic XML data

The flexibility of XML data model allows a more natural representation of uncertain data compared with the relational model. Matching twig pattern against XML data is a fundamental problem in querying information from XML documents. For a probabilistic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

June 2004

988 pages

ISBN:1581138598

DOI:10.1145/1007568

Conference Chairs:
Arnd Christian König
Microsoft Research
,
Stefan Dessloch
University of Kaiserslautern, Germany
,
General Chair:
Patrick Valduriez
INRIA, France
,
Program Chair:
Gerhard Weikum
University of the Saarland

Copyright © 2004 ACM.

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

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS04

Sponsor:

SIGMOD

SIGMOD/PODS04: International Conference on Management of Data and Symposium on Principles Database and Systems

June 13 - 18, 2004

Paris, France

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

71
Total Citations
View Citations
1,133
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jaya Lakshmi AJoe Prathap P(2023)An Energy-Efficient Approach to Transfer Data from WSN to Mobile DevicesSentiment Analysis and Deep Learning10.1007/978-981-19-5443-6_11(127-137)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-981-19-5443-6_11
Bača RKrátký MHolubová INečaský MSkopal TSvoboda MSakr S(2017)Structural XML Query ProcessingACM Computing Surveys10.1145/309579850:5(1-41)Online publication date: 26-Sep-2017
https://dl.acm.org/doi/10.1145/3095798
Bi XZhao XWang G(2017)Efficient Processing of Distributed Twig Queries Based on Node DistributionJournal of Computer Science and Technology10.1007/s11390-017-1707-132:1(78-92)Online publication date: 11-Jan-2017
https://doi.org/10.1007/s11390-017-1707-1
Bača RLukáš PKrátký M(2015)Cost-based holistic twig joinsInformation Systems10.1016/j.is.2015.03.00452:C(21-33)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1016/j.is.2015.03.004
Yang WZhu H(2013)Matching of Twig Pattern with AND/OR Predicates over XML StreamsDesign, Performance, and Analysis of Innovative Information Retrieval10.4018/978-1-4666-1975-3.ch005(60-72)Online publication date: 2013
https://doi.org/10.4018/978-1-4666-1975-3.ch005
Park JPark CChung Y(2013)Lineage EncodingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2011.20225:7(1559-1573)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1109/TKDE.2011.202
Liu JMa ZMa R(2013)Efficient processing of twig query with compound predicates in fuzzy XMLFuzzy Sets and Systems10.1016/j.fss.2012.11.004229(33-53)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1016/j.fss.2012.11.004
Baca RKrátký MLing TLu J(2013)Optimal and efficient generalized twig pattern processingThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-012-0295-522:3(369-393)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1007/s00778-012-0295-5
Ding DChe DCao FHou W(2013)A practical approach to holistic b-twig pattern matching for efficient XML query processingProceedings of the 29th British National conference on Big Data10.1007/978-3-642-39467-6_16(165-174)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39467-6_16
Truong BBhowmick S(2013)MustBlend: Blending Visual Multi-Source Twig Query Formulation and Query Processing in RDBMSDatabase Systems for Advanced Applications10.1007/978-3-642-37450-0_17(228-243)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37450-0_17
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents