Containment between Unions of XPath Queries

In this paper, we address the containment problem for unions of XPath queries with and without schema. We find the problem can be always reduced into containment problem between one single query and a union of queries. When schema is not available, the problem can be further reduced into checking containment between pairwise queries (each from one union), but this only holds for some XPath subsets, such as XP { /,//,[] } , but not for XP { /,//,[],* } . We then show the problem is still solvable in XP { /,//,[],* } , though no efficient algorithm exists. When schema is at hand, we propose a strategy to rewrite a query into a union of simplified queries based on schema information, and then apply methods developed when schema is not taken into account. The problem is then reduced into checking containment between unions of queries in XP { /,[] } without schema.

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

[2]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[3]  Thomas Schwentick,et al.  XPath Containment in the Presence of Disjunction, DTDs, and Variables , 2003, ICDT.

[4]  Matthias Brosemann,et al.  XML Path Language (XPath) 1.0 — Seminararbeit — , 2004 .

[5]  Laks V. S. Lakshmanan,et al.  Tree pattern query minimization , 2002, The VLDB Journal.

[6]  Jeffrey Xu Yu,et al.  On Tree Pattern Query Rewriting Using Views , 2007, WISE.

[7]  Gerhard Weikum,et al.  Efficiently Handling Dynamics in Distributed Link Based Authority Analysis , 2008, WISE.

[8]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

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

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

[11]  Philip Wadler,et al.  A Formal Semantics of Patterns in XSLT and XPath , 2000, Markup languages.

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

[13]  Boualem Benatallah.  Web Information Systems Engineering - WISE 2007, 8th International Conference on Web Information Systems Engineering, Nancy, France, December 3-7, 2007, Proceedings , 2007, WISE.

[14]  Jeffrey Xu Yu,et al.  Contained Rewritings of XPath Queries Using Views Revisited , 2008, WISE.

[15]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[16]  Steven J. DeRose,et al.  XML Path Language (XPath) , 1999 .

[17]  Thomas Schwentick,et al.  XPath query containment , 2004, SGMD.

[18]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[19]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

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

[21]  Gabriel M. Kuper,et al.  Structural Properties of XPath Fragments , 2003, ICDT.

[22]  Raghu Ramakrishnan,et al.  Containment of conjunctive queries: beyond relations as sets , 1995, TODS.