research-article

The (Almost) Complete Guide to Tree Pattern Containment

Authors:

Wojciech Czerwiński,

Marcin PrzybylkoAuthors Info & Claims

PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

Pages 117 - 130

https://doi.org/10.1145/2745754.2745766

Published: 20 May 2015 Publication History

Abstract

Tree pattern queries are being investigated in database theory for more than a decade. They are a fundamental and flexible query mechanism and have been considered in the context of querying tree structured as well as graph structured data. We revisit their containment, validity, and satisfiability problem, both with and without schema information. We present a comprehensive overview of what is known about the complexity of containment and develop new techniques which allow us to obtain tractability- and hardness results for cases that have been open since the early work on tree pattern containment. For the tree pattern queries we consider in this paper, it is known that the containment problem does not depend on whether patterns are evaluated on trees or on graphs. This means that our results also shed new light on tree pattern queries on graphs.

References

[1]

J. Albert, D. Giammerresi, and D. Wood. Normal form algorithms for extended context free grammars. Theoretical Computer Science, 267(1-2):35--47, 2001.

Digital Library

[2]

M. Arenas, J. Daenen, F. Neven, M. Ugarte, J. Van den Bussche, and S. Vansummeren. Discovering XSD keys from XML data. In International Conference on Management of Data (SIGMOD), pages 61--72, 2013.

Digital Library

[3]

M. Arenas and L. Libkin. XML data exchange: Consistency and query answering. J. ACM, 55(2), 2008.

Digital Library

[4]

P. Barceló. Querying graph databases. In Principles of Database Systems (PODS), pages 175--188, 2013.

Digital Library

[5]

P. Barceló, L. Libkin, A. Poggi, and C. Sirangelo. XML with incomplete information. Journal of the ACM, 58(1):4, 2010.

Digital Library

[6]

M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. Journal of the ACM, 55(2), 2008.

Digital Library

[7]

A. Berglund, S. Boag, D. Chamberlin, M. F. Fernández, M. Kay, J. Robie, and J. Siméon. XML Path Language (XPath) 2.0. Technical report, World Wide Web Consortium, January 2007. W3C Recommendation, http://www.w3.org/TR/2007/REC-xpath20--20070123/.

[8]

H. Björklund, W. Martens, and T. Schwentick. Optimizing conjunctive queries over trees using schema information. In International Symposium on Mathematical Foundations of Computer Science (MFCS), pages 132--143, 2008.

Digital Library

[9]

H. Björklund, W. Martens, and T. Schwentick. Conjunctive query containment over trees. Journal of Computer and System Sciences, pages 450--472, 2010.

Digital Library

[10]

H. Björklund, W. Martens, and T. Schwentick. Validity of tree pattern queries with respect to schema information. In Mathematical Foundations of Computer Science (MFCS), pages 171--182, 2013.

[11]

S. Boag, D. Chamberlin, M. F. Fernández, D. Florescu, J. Robie, and J. Siméon. XQuery 1.0: An XML query language. Technical report, World Wide Web Consortium, January 2007. W3C Recommendation, http://www.w3.org/TR/2007/REC-xquery-20070123/.

[12]

I. Boneva, R. Ciucanu, and S. Staworko. Schemas for unordered XML on a DIME. CoRR, abs/1311.7307, 2013.

[13]

T. Bray, J. Paoli, C. M. Sperberg-McQueen, E. Maler, and F. Yergeau. Extensible Markup Language XML 1.0 (fifth edition). Technical report, World Wide Web Consortium (W3C), November 2008. W3C Recommendation, http://www.w3.org/TR/2008/REC-xml-20081126/.

[14]

J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In International Conference on Data Engineering, (ICDE), pages 913--922, 2008.

Digital Library

[15]

C. David, N. Francis, and F. Murlak. Consistency of injective tree patterns. In Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pages 279--290, 2014.

[16]

C. David, A. Gheerbrant, L. Libkin, and W. Martens. Containment of pattern-based queries over data trees. In International Conference on Database Theory (ICDT), pages 201--212, 2013.

Digital Library

[17]

S. DeRose, E. Maler, and R. Daniel. XML pointer language (XPointer) version 1.0. Technical report, World Wide Web Consortium (W3C), 2001.

[18]

S. DeRose, E. Maler, D. Orchard, and N. Walsh. XML linking language (XLink) version 1.1. Technical report, World Wide Web Consortium (W3C), 2010.

[19]

D. Figueira. Reasoning on Words and Trees with Data. PhD thesis, École Normale Supérieure de Cachan, 2010.

[20]

S. Flesca, F. Furfaro, and E. Masciari. On the minimization of XPath queries. Journal of the ACM, 55(1), 2008.

Digital Library

[21]

S. Gao, C. M. Sperberg-McQueen, H. Thompson, N. Mendelsohn, D. Beech, and M. Maloney. W3C XML Schema Definition Language (XSD) 1.1 part 1: Structures. Technical report, World Wide Web Consortium, April 2009. W3C Recommendation, http://www.w3.org/TR/2009/CR-xmlschema11-1-20090430/.

[22]

F. Geerts and W. Fan. Satisfiability of XPath queries with sibling axes. In International Symposium on Database Programming Languages (DBPL), pages 122--137, 2005.

Digital Library

[23]

A. Gheerbrant, L. Libkin, and C. Sirangelo. Reasoning about pattern-based XML queries. In International Conference on Web Reasoning and Rule Systems (RR), pages 4--18, 2013.

Digital Library

[24]

G. Gottlob, C. Koch, and K. U. Schulz. Conjunctive queries over trees. Journal of the ACM, 53(2):238--272, 2006.

Digital Library

[25]

K. Hashimoto, Y. Kusunoki, Y. Ishihara, and T. Fujiwara. Validity of positive XPath queries with wildcard in the presence of DTDs. In Database Programming Languages (DBPL), 2011.

[26]

M. Kay. XSL Transformations (XSLT) version 2.0. Technical report, World Wide Web Consortium, January 2007. W3C Recommendation, http://www.w3.org/TR/2007/REC-xslt20--20070123/.

[27]

B. Kimelfeld and Y. Sagiv. Revisiting redundancy and minimization in an XPath fragment. In Extending Database Technology (EDBT), pages 61--72, 2008.

Digital Library

[28]

E. Kopczynski and A. W. To. Parikh images of grammars: Complexity and applications. In IEEE Symposium on Logic in Computer Science (LICS), pages 80--89, 2010.

Digital Library

[29]

E. V. Kostylev, J. L. Reutter, and D. Vrgoč. Containment of data graph queries. In International Conference on Database Theory (ICDT), pages 131--142, 2014.

[30]

L. Libkin, W. Martens, and D. Vrgo\vc. Querying graph databases with XPath. In International Conference on Database Theory (ICDT), pages 129--140, 2013.

Digital Library

[31]

W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for XML schemas and chain regular expressions. Siam Journal on Computing, 39(4):1486--1530, 2009.

Digital Library

[32]

A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM Journal on Computing, 24(6):1235--1258, 1995.

Digital Library

[33]

G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. Journal of the ACM, 51(1):2--45, 2004.

Digital Library

[34]

F. Murlak. Personal communication.

[35]

F. Neven and T. Schwentick. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logical Methods in Computer Science, 2(3), 2006.

[36]

M. Niewerth and T. Schwentick. Reasoning about XML constraints based on xml-to-relational mappings. In International Conference on Database Theory (ICDT), pages 72--83, 2014.

[37]

J. Pérez, M. Arenas, and C. Gutierrez. nsparql: A navigational language for RDF. Journal of Web Semantics, 8(4):255--270, 2010.

Digital Library

[38]

T. Schwentick. XPath query containment. Sigmod RECORD, 33(1):101--109, 2004.

Digital Library

[39]

Shape expressions. http://www.w3.org/2001/sw/wiki/ShEx.

[40]

S. Staworko, I. Boneva, J. E. Labra Gayo, S. Hym, E. G. Prud'hommeaux, and H. Solbrig. Complexity and expressiveness of ShEx for RDF. In International Conference on Database Theory (ICDT), 2015.

[41]

B. ten Cate and C. Lutz. The complexity of query containment in expressive fragments of XPath 2.0. Journal of the ACM, 56(6), 2009.

Digital Library

[42]

P. van Emde Boas. The convenience of tilings. In Complexity, Logic and Recursion Theory, volume 187 of Lecture Notes in Pure and Applied Mathematics, pages 331--363. Marcel Dekker Inc., 1997.

[43]

P. T. Wood. Containment for XPath fragments under DTD constraints. In International Conference Database Theory (ICDT), 2003. Full version, obtained through personal communication.

Digital Library

[44]

Q. Zeng, X. Jiang, and H. Zhuge. Adding logical operators to tree pattern queries on graph-structured data. PVLDB, 5(8):728--739, 2012.

Digital Library

Cited By

Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Bonifati AMartens WTimm T(2019)An analytical study of large SPARQL query logsThe VLDB Journal10.1007/s00778-019-00558-929:2-3(655-679)Online publication date: 2-Aug-2019
CzerwiŃski WMartens WNiewerth MParys P(2018)Minimization of Tree PatternsJournal of the ACM10.1145/318028165:4(1-46)Online publication date: 25-Jul-2018
Show More Cited By

Index Terms

The (Almost) Complete Guide to Tree Pattern Containment
1. Information systems
  1. Data management systems
    1. Query languages

Recommendations

Minimization of Tree Pattern Queries
PODS '16: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

We investigate minimization of tree pattern queries that use the child relation, descendant relation, node labels, and wildcards. We prove that minimization for such tree patterns is Sigma2P-complete and thus solve a problem first attacked by Flesca, ...
Minimization of Tree Patterns
Distributed Computing, Cryptography, Distributed Computing, Cryptography, Coding Theory, Automata Theory, Complexity Theory, Programming Languages, Algorithms, Invited Paper Foreword and Databases

Many of today’s graph query languages are based on graph pattern matching. We investigate optimization of tree-shaped patterns that have transitive closure operators. Such patterns not only appear in the context of graph databases but also were ...
The complexity of query containment in expressive fragments of XPath 2.0
PODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Query containment has been studied extensively for fragments of XPath 1.0. For instance, the problem is known to be ExpTime-complete for CoreXPath, the navigational core of XPath 1.0. Much less is known about query containment in (fragments of) the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems

May 2015

358 pages

ISBN:9781450327572

DOI:10.1145/2745754

General Chair:
Tova Milo
Tel Aviv University, Israel
,
Program Chair:
Diego Calvanese
Free University of Bozen-Bolzano, Italy

Copyright © 2015 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 the author(s) 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: 20 May 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

SIGMOD/PODS'15

Sponsor:

SIGMOD

SIGMOD/PODS'15: International Conference on Management of Data

May 31 - June 4, 2015

Victoria, Melbourne, Australia

Acceptance Rates

PODS '15 Paper Acceptance Rate 25 of 80 submissions, 31%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
196
Total Downloads

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

Reflects downloads up to 07 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Bonifati AMartens WTimm T(2019)An analytical study of large SPARQL query logsThe VLDB Journal10.1007/s00778-019-00558-929:2-3(655-679)Online publication date: 2-Aug-2019
CzerwiŃski WMartens WNiewerth MParys P(2018)Minimization of Tree PatternsJournal of the ACM10.1145/318028165:4(1-46)Online publication date: 25-Jul-2018
Björklund HMartens WSchwentick T(2018)Conjunctive query containment over trees using schema informationActa Informatica10.1007/s00236-016-0282-155:1(17-56)Online publication date: 1-Feb-2018
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
Czerwinski WMartens WNiewerth MParys P(2017)Optimizing Tree Patterns for Querying Graph- and Tree-Structured DataACM SIGMOD Record10.1145/3093754.309375946:1(15-22)Online publication date: 12-May-2017
Abiteboul SArenas MBarceló PBienvenu MCalvanese DDavid CHull RHüllermeier EKimelfeld BLibkin LMartens WMilo TMurlak FNeven FOrtiz MSchwentick TStoyanovich JSu JSuciu DVianu VYi K(2017)Research Directions for Principles of Data Management (Abridged)ACM SIGMOD Record10.1145/3092931.309293345:4(5-17)Online publication date: 11-May-2017
Czerwinski WMartens WNiewerth MParys PMilo TTan W(2016)Minimization of Tree Pattern QueriesProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902295(43-54)Online publication date: 15-Jun-2016
Parys P(2016)Weak containment for partial words is coNP-completeInformation Processing Letters10.1016/j.ipl.2015.09.012116:2(125-127)Online publication date: 1-Feb-2016

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