Conjunctive query containment over trees

Journal of Computer and System Sciences

Volumn 77, Issue 3, 2011, Pages 450-472

  Björklund, Henrik ^a   Martens, Wim ^a   Schwentick, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Data management; Logic; Query optimization; XML

Indexed keywords

FORMAL LOGIC; INFORMATION MANAGEMENT; XML;

CONJUNCTIVE QUERIES; CONJUNCTIVE-QUERY CONTAINMENT; LABELED TREES; LOGIC; NP COMPLETE; QUERY OPTIMIZATION; SATISFIABILITY; SATISFIABILITY PROBLEMS;

FORESTRY;

EID: 79952361703     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.04.005     Document Type: Article

References (17)

1. M. Arenas, and L. Libkin XML data exchange: Consistency and query answering J. ACM 55 2 2008
2. A. Berglund, S. Boag, D. Chamberlin, M.F. Fernández, M. Kay, J. Robie, J. Siméon, XML Path Language (XPath) 2.0, Technical report, World Wide Web Consortium, January 2007, http://www.w3.org/TR/xpath20/.
3. H. Björklund, W. Martens, T. Schwentick, Conjunctive query containment over trees, in: 11th International Symposium on Database Programming Languages (DBPL), 2007, pp. 66-80.
4. H. Björklund, W. Martens, T. Schwentick, Optimizing conjunctive queries over trees using schema information, in: 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), 2008, pp. 132-143.
5. S. Boag, D. Chamberlin, M.F. Fernández, D. Florescu, J. Robie, J. Siméon Xquery, 1.0: An XML query language, Technical report, World Wide Web Consortium, January 2007, http://www.w3.org/TR/xquery/.
6. E.P.F. Chan, and R. van der Meyden Containment and optimization of object-preserving conjunctive queries SIAM J. Comput. 29 4 2000 1371 1400
7. J. Clark, S. DeRose, XML Path Language (XPath) version 1.0, Technical report, World Wide Web Consortium, 1999, http://www.w3.org/TR/xpath/.
8. J. Gallant, D. Maier, and J.A. Storer On finding minimal length superstrings J. Comput. System Sci. 20 1 1980 50 58
9. G. Gottlob, C. Koch, R. Pichler, and L. Segoufin The complexity of XPath query evaluation and XML typing J. ACM 52 2 2005 284 335 (Pubitemid 41655762)
10. G. Gottlob, C. Koch, and K.U. Schulz Conjunctive queries over trees J. ACM 53 2 2006 238 272
11. J. Hidders, Satisfiability of XPath expressions, in: 9th International Workshop on Database Programming Languages (DBPL), 2003, pp. 21-36.
12. P.G. Kolaitis, and M.Y. Vardi Conjunctive query containment and constraint satisfaction J. Comput. System Sci. 61 2 2000 302 332
13. G. Miklau, and D. Suciu Containment and equivalence for a fragment of XPath J. ACM 51 1 2004 2 45
14. K.J. Räihä, and E. Ukkonen The shortest common supersequence problem over binary alphabet is NP-complete Theoret. Comput. Sci. 16 2 1981 187 198
15. T. Schaefer, The complexity of satisfiability problems, in: 10th Annual ACM Symposium on Theory of Computing (STOC), 1978, pp. 216-226.
16. B. ten Cate, C. Lutz, The complexity of query containment in expressive fragments of XPath 2.0, in: 26th International Symposium on Principles of Database Systems (PODS), 2007, pp. 73-82. (Pubitemid 47620882)
17. S. Vansummeren On deciding well-definedness for query languages on trees J. ACM 54 4 2007