On the complexity of XPath containment in the presence of disjunction, DTDS, and variables

Logical Methods in Computer Science

Volumn 2, Issue 3, 2006, Pages

  Neven, Frank ^a,b   Schwentick, Thomas ^c  

^a HASSELT UNIVERSITY   (Belgium)

^b HASSELT UNIVERSITY   (Belgium)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Automata; Complexity; Containment; XML pattern language; XPath

Indexed keywords

XML;

AUTOMATA; COMPLEXITY; CONTAINMENT; PATTERN LANGUAGES; XPATH;

SEMANTICS;

EID: 84948579632     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(3:1)2006     Document Type: Article

References (37)

1. M. Benedikt, W. Fan, and F. Geerts. XPath satisfiability in the presence of DTDs. In Proceedings 24th Symposium on Principles of Database Systems (PODS 2005), pages 25-36. ACM Press, 2005.
2. M. Benedikt, W. Fan, and G.M. Kuper. Structural properties of XPath fragments. Theoretical Computer Science, 336(1):3-31, 2005.
3. G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21-39, 2002.
4. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
5. D. Chamberlin, J. Clark, D. Florescu, J. Robie, J. Simeon, and M. Stefanascu. XQuery 1.0: An XML query language. http://www.w3.org/TR/xquery/, 2002.
6. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings 9th ACM Symposium on Theory of Computing, pages 77-90. ACM, 1977.
7. A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
8. B. S. Chlebus. Domino-tiling games. Journal of Computer and System Sciences, 32(3):374-392, 1986.
9. J. Clark. XML Path Language (XPath). http://www.w3.org/TR/xpath.
10. James Clark. XSL transformations version 1.0. http://www.w3.org/TR/WD-xslt, august 1999.
11. World Wide Web Consortium. XML schema. http://www.w3.org/XML/Schema.
12. S. DeRose, E. Maler, and R. Daniel. XML pointer language (XPointer) version 1.0. http://www.w3.org/TR/xptr/, 2001.
13. S. DeRose, E. Maler, and D. Orchard. XML linking language (XLink) version 1.0. http://www.w3.org/TR/xlink/, 2001.
14. A. Deutsch and V. Tannen. Containment and integrity constraints for XPath. In Maurizio Lenzerini, Daniele Nardi, Werner Nutt, and Dan Suciu, editors, Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), number 45 in CEUR Workshop Proceedings, 2001.
15. F. Geerts and W. Fan. Satisfiability of XPath queries with sibling axes. In G. M. Bierman and C. Koch, editors, Database Programming Languages, volume 3774 of Lecture Notes in Computer Science, pages 122-137. Springer, 2005.
16. G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proceedings 17th IEEE Symposium on Logic in Computer Science (LICS 2002), pages 189-202, 2002.
17. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proceedings of 28th Conference on Very Large Databases (VLDB), pages 95-106, 2002.
18. J. Hidders. Satisfiability of XPath expressions. In G. Lausen and D. Suciu, editors, Database Programming Languages (DBPL 2003), volume 2921 of Lecture Notes in Computer Science, pages 21-36. Springer, 2004.
19. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
20. H. Lewis and C. Papadimitriou. Elements of the theory of computation. Prentice-Hall, 2 edition, 1997.
21. W. Martens and F. Neven. On the complexity of typechecking top-down XML transformations. Theoretical Computer Science, 336(1):153-180, 2005.
22. W. Martens and J. Niehren. Minimizing tree automata for unranked trees. In G. M. Bierman and C. Koch, editors, Database Programming Languages, volume 3774 of Lecture Notes in Computer Science, pages 232-246. Springer, 2005.
23. M. Marx. Conditional XPath, the first order complete XPath dialect. In Proceedings 23th Symposium on Principles of Database Systems (PODS 2004), pages 13-22. ACM Press, 2004.
24. M. Marx. XPath with conditional axis relations. In E. Bertino, S. Christodoulakis, D. Plexousakis, V. Christophides, M. Koubarakis, K. Böhm, and E. Ferrari, editors, Advances in Database Technology (EDBT 2004), volume 2992 of Lecture Notes in Computer Science, pages 477-494. Springer, 2004.
25. M. Marx. First order paths in ordered trees. In Proceedings of the 10th International Conference on Database Theory (ICDT), pages 114-128, Berlin, 2005. Springer.
26. M. Marx and M. de Rijke. Semantic characterizations of navigational XPath. SIGMOD Record, 34(2):41-46, 2005.
27. G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. Journal of the ACM, 51(1):2-45, 2004.
28. G. Moerkotte. Incorporating XSL processing into database engines. In Proceedings of 28th Conf. on VLDB, pages 107-118, 2002.
29. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002.
30. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In Proceedings of the 9th International Conference on Database Theory (ICDT 2003), pages 315-329, 2003.
31. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
32. R. Sedgewick. Algorithms. Addison-Wesley, 1983.
33. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41(2-3):305-318, 1985.
34. R. Van der Meyden. The complexity of querying indefinite data about linearly ordered domains. Journal of Computer and System Sciences, 54(1):113-135, 1997.
35. P. T. Wood. Minimising simple XPath expressions. WebDB informal proceedings, 2001.
36. P. T. Wood. On the equivalence of XML patterns. In Lloyd et al., editor, Computational Logic-CL 2000, volume 1861 of Lecture Notes in Artificial Intelligence, pages 1152-1166. Springer, 2000.
37. P. T. Wood. Containment for XPath fragments under DTD constraints. In D. Calvanese, M. Lenzerini, and R. Motwani, editors, Database Theory-ICDT 2003, volume 2572 of Lecture Notes in Computer Science, pages 300-314. Springer, 2002.