Complexity of data tree patterns over XML documents

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

Volumn 5162 LNCS, Issue , 2008, Pages 278-289

  David, Claire ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; COMPUTERS; FOUNDATIONS; MARKUP LANGUAGES; MODEL CHECKING; NUCLEAR PROPULSION; QUERY LANGUAGES; XML;

ATTRIBUTE VALUES; BOOLEAN COMBINATIONS; DATA TREES; QUERY EVALUATIONS; SATISFIABILITY PROBLEMS; TREE PATTERNS; XML DOCUMENTS;

TREES (MATHEMATICS);

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

References (22)

1. Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching, fn: f CDE, pp. 141-153. IEEE, Los Alamitos (2002)
2. Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: typechecking revisited. J. Gomput. Syst. Sci. 66(4), 688-727 (2003)
3. Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. SIGMOD Rec. 30(2), 497-508 (2001)
4. Arenas, M., Libkin, L.: XML data exchange: consistency and query answering. In: PODS, pp. 13-24 (2005)
5. Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. In: PODS, pp. 25-36 (2005)
6. Benedikt, M., Koch, C.: XPath Leashed. ACM Computing Surveys (to appear)
7. Benzaken, V., Castagna, G., Miachon, C.: CQL: a pattern-based query language for XML. fn: BDA, pp. 469-490 (2004)
8. Björklund, H., Martens, W., Schwentick, T.: Conjunctive Query Containment over Trees. In: Arenas, M., Schwartzbach, M.I. (eds.) DBPL 2007. LNCS, vol. 4797. pp. 66-80. Springer, Heidelberg (2007)
9. Björklund, H., Martens, W., Schwentick, T.: Optimizing Conjunctive Queries over Trees using Schema Information. In: MFCS (to appear, 2008)
10. O. 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)
11. Bojanczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-Variable Logic on Words with Data. In: LICS, pp. 7-16. IEEE, Los Alamitos (2006)
12. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310-321. ACM, New York (2002)
13. Demri, S., Lazic, R: LTL with the Freeze Quantifier and Register Automata. In: LICS, pp. 17-26. IEEE, Los Alamitos (2006)
14. Deutsch, A., Tannen, V.: Containment and integrity constraints for xpath. In: KRDB CEUR Workshop Proceedings. CEUR-WS.org, vol. 45 (2001)
15. Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. J. ACM 49(3), 368-406 (2002)
16. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2), 444-49f (2005)
17. f 7. Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. J. ACM 53(2), 238-272 (2006)
18. Jurdzinski, M., Lazic, R.: Alternation-free modal mu-calculus for data trees, fn: LICS, pp. 131-140. IEEE, Los Alamitos (2007)
19. Lakshmanan, L.V.S., Ramesh, G., Wang, H., Zhao, Z.J.: On Testing Satisfiability of Tree Pattern Queries. In: VLDB, pp. 120-131 (2004)
20. Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 134-145. Springer, Heidelberg (1998)
21. Papadimitriou, C.H., Yannakakis, M.: The Complexity of Facets (and Some Facets of Complexity). J. Comput. Syst. Sci. 28(2), 244-259 (1984)
22. Wu, Y., Patel, J.M., Jagadish, H.V.: Structural Join Order Selection for XML Query Optimization. In: 1CDE, pp. 443-454. IEEE, Los Alamitos (2003)