XPath containment in the presence of disjunction, DTDs, and variables

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

Volumn 2572, Issue , 2003, Pages 315-329

  Neven, Frank ^a   Schwentick, Thomas ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BASIC OPERATION; COMPLETE CLASSIFICATION; XML TREES;

SEMANTICS;

EID: 35248872431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36285-1_21     Document Type: Article

References (23)

1. M. Benedikt, W. Fan, and G. M. Kuper. Structural properties of XPath fragments. ICDT 2003, this volume.
2. G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21-39, 2002.
3. 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.
4. B. S. Chlebus. Domino-tiling games. Journal of Computer and System Sciences, 32(3):374-392, 1986.
5. J. Clark. XML Path Language (XPath). http://www.w3.org/TR/xpath.
6. James Clark. XSL transformations version 1.0. http://www.w3.org/TR/WD-xslt, August 1999.
7. World Wide Web Consortium. XML schema. http://www.w3.org/XML/Schema.
8. S. DeRose, E. Maler, and R. Daniel. XML pointer language (XPointer) version 1.0. http://www.w3.org/TR/xptr/, 2001.
9. S. DeRose, E. Maler, and D. Orchard. XML linking language (XLink) version 1.0. http://www.w3.org/TR/xlink/, 2001.
10. 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.
11. G. Gottlob and C. Koch. Monadic queries over tree-structured data. In Proc. 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002.
12. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of 28th Conf. on VLDB, 2002.
13. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
14. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 65-76, 2002.
15. G. Moerkotte. Incorporating XSL processing into database engines. In Proc. of 28th Conf. on VLDB, 2002.
16. F. Neven. Automata, logic, and XML. In J. C. Bradfield, editor, CSL, volume 2471 of Lecture Notes in Computer Science, pages 2-26. Springer, 2002.
17. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002.
18. F. Neven and T. Schwentick. Automata- and logic-based pattern languages for tree-structured data. Unpublished, 2001.
19. F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633-674, 2002.
20. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41(2-3):305-318, 1985.
21. P. T. Wood. Containment for XPath fragments under DTD constraints. ICDT 2003, this volume.
22. P. T. Wood. Minimising simple XPath expressions. WebDB informal proceedings, 2001.
23. 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.