论文信息 - Conjunctive Query Containment over Trees

Conjunctive Query Containment over Trees

The complexity of containment and satisfiability of conjunctive queries over finite, unranked, labeled trees is studied with respect to the axes Child, NextSibling, their transitive and reflexive closures, and Following. For the containment problem a trichotomy is presented, classifying the problems as in PTIME, coNP-complete, or Π2P -complete. For the satisfiability problem most problems are classified as either in PTIME or NP-complete.

Thomas Schwentick | Henrik Björklund | Wim Martens

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

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

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

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

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

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

[7] Georg Gottlob,et al. Conjunctive queries over trees , 2006, J. ACM.

[8] Georg Gottlob,et al. The complexity of XPath query evaluation and XML typing , 2005, JACM.

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

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

[11] Scott Boag,et al. XQuery 1.0 : An XML Query Language , 2007 .

[12] Stijn Vansummeren,et al. On deciding well-definedness for query languages on trees , 2007, JACM.

[13] Thomas Schwentick,et al. Optimizing Conjunctive Queries over Trees Using Schema Information , 2008, MFCS.

[14] Ron van der Meyden,et al. Containment and Optimization of Object-Preserving Conjunctive Queries , 2000, SIAM J. Comput..