Optimizing conjunctive queries over trees using schema information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5162 LNCS, Issue , 2008, Pages 132-143

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

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CAN TESTS; CONJUNCTIVE QUERIES; DATA VALUES; NP-HARD; OPTIMIZING; RELAX NG; SATISFIABILITY; SCHEMA INFORMATIONS;

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; COMPUTERS; FOUNDATIONS; NUCLEAR PROPULSION;

QUERY LANGUAGES;

EID: 54249164120     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_10     Document Type: Conference Paper

References (20)

1. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. J. ACM 55(2) (2007)
2. Bjorklund, H., Martens, W., Schwentick, T.: Conjunctive query containment over trees. In: DBPL, pp. 66-80 (2007)
3. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin. L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10-19 (2006)
4. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114-133 (1981)
5. Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: STOC, pp. 77-90 (1977)
6. Clark, J., De Rose, S.: XML Path Language (XPath) version 1.0. Technical report, World Wide Web Consortium (1999), http://www.w3.org/TR/xpath/
7. Clark, J., Murata, M.: Relax NG specification (December 2001), http://www.relaxng.org/spec-20011203.html
8. David, C.: Complexity of data tree patterns over XML documents. In: MFCS (to appear, 2008)
9. Gallant, J., Maier, D., Storer, J.A.: On finding minimal length superstrings. JCSS 20(1), 50-58 (1980)
10. Geerts, F., Fan, W.: Satisfiability of XPath queries with sibling axes. In: DBPL, pp. 122-137 (2005)
11. Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. J. ACM 53(2), 238-272 (2006)
12. Hidders, J.: Satisfiability of XPath expressions. In: DBPL, pp. 21-36 (2003)
13. Kolaitis, P.G., Vardi, M.Y.: Conjunctive query containment and constraint satisfaction. JCSS 61(2), 302-332 (2000)
14. Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.: On testing satisfiability of tree pattern queries. In: VLDB, pp. 120-131 (2004)
15. Marx, M.: XPath with conditional axis relations. In: EDBT, pp. 477-494 (2004)
16. Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. J. ACM 51(1), 2-45 (2004)
17. Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. LMCS 2(3) (2006)
18. Räihä, K.J., Ukkonen, E.: The shortest common supersequence problem over binary alphabet is NP-complete. TCS 16(2), 187-198 (1981)
19. Gate, B.t., Lutz, C.: The complexity of query containment in expressive fragments of XPath 2.0. In: PODS, pp. 73-82 (2007)
20. Wood, P.T.: Containment for XPath fragments under DTD constraints. In: ICDT (2003): Full version, obtained through personal communication