Containment for XPath fragments under DTD constraints

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

Volumn 2572, Issue , 2003, Pages 300-314

  Wood, Peter T ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

EQUIVALENCE PROBLEM; INTEGRITY CONSTRAINTS; MINIMISATION; XPATH QUERIES;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (20)

1. S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. Minimization of tree pattern queries. In Proc. ACM SIGMOD Conf., pages 497-508, 2001.
2. J. Bailey, A. Poulovassilis, and P. T. Wood. An event-condition-action language for XML. In Proc. 11th Int. Conf. on the World Wide Web, pages 486-495, 2002.
3. K. Böhm, K. Aberer, M. T. Özsu, and K. Gayer. Query optimization for structured documents based on knowledge of the document type definition. In Proc. IEEE Advances in Digital Libraries, pages 196-205, 1998.
4. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets. Available at ftp://ftp11.informatik.tu-muenchen.de/pub/misc/caterpillars/, 1998.
5. D. Calvanese, G. de Giacomo, and M. Lenzerini. On the decidability of query containment under constraints. In Proc. 17th ACM Symp. on Principles of Databases Systems, pages 149-158, 1998.
6. B. Chidlovskii. Using regular tree automata as XML schemas. In Proc. IEEE Advances in Digital Libraries, pages 89-104, 2000.
7. A. Deutsch and V. Tannen. Containment and integrity constraints for XPath fragments. In Proc. 8th Int. Workshop on Knowledge Representation Meets Databases, 2001.
8. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. on Database Syst., 4(4):455-469, 1979.
9. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. 21st ACM Symp. on Principles of Databases Systems, 2002.
10. F. Neven and T. Schwentick. XPath containment in the presence of disjunction, DTDs, and variables. In Proc. 9th Int. Conf. on Database Theory, 2003.
11. Y. Papakonstantinou and V. Vassalos. Query rewriting for semistructured data. In Proc. ACM SIGMOD Conf., pages 455-466, 1999.
12. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. 19th ACM Symp. on Principles of Databases Systems, pages 35-46, 2000.
13. H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Computing, 19(3):424-437, June 1990.
14. P. Wadler. A formal semantics of patterns in XSLT. In Markup Technologies, pages 183-202, 1999.
15. P. T. Wood. On the equivalence of XML patterns. In Proc. 1st Int. Conf. on Computational Logic, LNAI 1861, pages 1152-1166, 2000. Springer-Verlag.
16. P. T. Wood. Minimising simple XPath expressions. In Proc. WebDB 2001: Fourth Int. Workshop on the Web and Databases, pages 13-18, 2001.
17. World Wide Web Consortium. XML Path Language (XPath), Version 1.0. See http://www.w3.org/TR/xpath, November 1999. W3C Recommendation.
18. World Wide Web Consortium. XSL Transformations (XSLT), Version 1.0. See http://www.w3.org/TR/xslt, November 1999. W3C Recommendation.
19. World Wide Web Consortium. XQuery 1.0: An XML Query Language. See http://www.w3.org/TR/xquery, June 2001. W3C Working Draft.
20. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. 7th Int. Conf. on Very Large Data Bases, pages 82-94, 1981.