Conjunctive query containment over trees using schema information

We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We show that conjunctive query containment and validity are 2EXPTIME -complete with respect to a schema, in both cases where the schema is given as a DTD or as a tree automaton. Furthermore, we show that satisfiability for conjunctive queries with respect to a schema can be decided in NP . The problem is NP -hard already for queries using only one kind of axis. Finally, we consider conjunctive queries that can test for equalities and inequalities of data values. Here, satisfiability and validity are decidable, but containment is undecidable, even without schema information. On the other hand, containment with respect to a schema becomes decidable again if the “larger” query is not allowed to use both equalities and inequalities.

[1]  Marcelo Arenas,et al.  Foundations of Data Exchange: Preface , 2014 .

[2]  Wenfei Fan,et al.  Satisfiability of XPath Queries with Sibling Axes , 2005, DBPL.

[3]  Michal Pilipczuk,et al.  Synthesizing transformations from XML schema mappings , 2014, ICDT.

[4]  Mikolaj Bojanczyk,et al.  Containment of Monadic Datalog Programs via Bounded Clique-Width , 2015, ICALP.

[5]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[6]  Masako Takahashi,et al.  Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages , 1975, Inf. Control..

[7]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

[8]  Dan Suciu,et al.  Containment and equivalence for a fragment of XPath , 2004, JACM.

[9]  Thomas Schwentick,et al.  Expressiveness and complexity of XML Schema , 2006, TODS.

[10]  Claire David,et al.  Containment of pattern-based queries over data trees , 2013, ICDT '13.

[11]  David Maier,et al.  On Finding Minimal Length Superstrings , 1980, J. Comput. Syst. Sci..

[12]  Esko Ukkonen,et al.  The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..

[13]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[14]  Georg Gottlob,et al.  Conjunctive queries over trees , 2004, JACM.

[15]  Maarten Marx,et al.  Conditional XPath , 2005, TODS.

[16]  Mikolaj Bojanczyk,et al.  Solutions in XML data exchange , 2011, ICDT '11.

[17]  Claire David,et al.  Certain answers for XML queries , 2010, PODS.

[18]  Laks V. S. Lakshmanan,et al.  Minimization of tree pattern queries , 2001, SIGMOD '01.

[19]  Wim Martens,et al.  The (Almost) Complete Guide to Tree Pattern Containment , 2015, PODS.

[20]  Frank Neven,et al.  On the complexity of typechecking top-down XML transformations , 2005, Theor. Comput. Sci..

[21]  Carsten Lutz,et al.  The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.

[22]  Ping Lu,et al.  Deciding Determinism of Regular Languages , 2014, Theory of Computing Systems.

[23]  Cristina Sirangelo,et al.  XML with incomplete information , 2010, JACM.

[24]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[25]  Thomas Schwentick,et al.  Conjunctive query containment over trees , 2011, J. Comput. Syst. Sci..

[26]  Michael Benedikt,et al.  Monadic Datalog Containment , 2012, ICALP.

[27]  Jan Hidders.  Satisfiability of XPath Expressions , 2003, DBPL.

[28]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

[29]  Thomas Schwentick,et al.  On the complexity of XPath containment in the presence of disjunction, DTDs, and variables , 2006, Log. Methods Comput. Sci..

[30]  Thomas Schwentick,et al.  Validity of Tree Pattern Queries with Respect to Schema Information , 2013, MFCS.

[31]  Yehoshua Sagiv,et al.  Revisiting redundancy and minimization in an XPath fragment , 2008, EDBT '08.

[32]  Claire David,et al.  Complexity of Data Tree Patterns over XML Documents , 2008, MFCS.

[33]  Oasis.  RELAX NG Specification , 2001 .

[34]  Bogdan S. Chlebus.  Domino-Tiling Games , 1986, J. Comput. Syst. Sci..

[35]  Peter T. Wood,et al.  Containment for XPath Fragments under DTD Constraints , 2003, ICDT.

[36]  Jörg Flum,et al.  Query evaluation via tree-decompositions , 2001, JACM.

[37]  Laks V. S. Lakshmanan,et al.  On Testing Satisfiability of Tree Pattern Queries , 2004, VLDB.

[38]  Thomas Schwentick,et al.  Complexity of Decision Problems for XML Schemas and Chain Regular Expressions , 2009, SIAM J. Comput..

[39]  Derick Wood,et al.  One-Unambiguous Regular Languages , 1998, Inf. Comput..

[40]  Serge Abiteboul,et al.  Recursive queries on trees and data trees , 2013, ICDT '13.

[41]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[42]  Leonid Libkin,et al.  On the complexity of query answering over incomplete XML documents , 2012, ICDT '12.

[43]  Marcelo Arenas,et al.  Foundations of Data Exchange , 2014 .

[44]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[45]  Filip Murlak,et al.  Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? , 2012, MFCS.