XML with data values: Typechecking revisited

Journal of Computer and System Sciences

Volumn 66, Issue 4, 2003, Pages 688-727

  Alon, Noga ^a   Milo, Tova ^a   Neven, Frank ^b   Suciu, Dan ^c   Vianu, Victor ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b HASSELT UNIVERSITY   (Belgium)

^c UNIVERSITY OF WASHINGTON   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; QUERY LANGUAGES; TREES (MATHEMATICS);

DOCUMENT TYPE DEFINITION (DTD);

XML;

EID: 0038504807     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00032-1     Document Type: Conference Paper

References (28)

1. N. Alon, T. Milo, F. Neven, D. Suciu, V. Vianu, Typechecking XML views of relational databases, in: Proceedings of the 16th IEEE Symposium on Logic in Computer Science, Boston, MA, 2001, pp. 421-430.
2. A. Bruggemann-Klein, M. Murata, D. Wood, Regular tree and regular hedge languages over non-ranked alphabets, Hong Kong University of Science and Technology Computer Science Center Research Report HKUST-TCSC-2001-05, 2001, available at http://www.cs.ust.hk/tcsc/RR/2001-05.ps.gz.
3. J.R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundl. Math. 6 (1960) 66-92.
4. D. Chamberlin, J. Clark, D. Florescu, J. Robie, J. Simeon, M. Stefanescu, XQuery 1.0: an XML query language, 2001, available from the W3C, http://www.w3.org/TR/query.
5. A.K. Chandra, M.Y. Vardi, The implication problem for functional and inclusion dependencies is undecidable, SIAM J. Comput. 14 (3) (1985) 671-677.
6. V. Christophides, S. Cluet, J. Simeon, On wrapping query languages and efficient XML integration, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, 2000, pp. 141-152.
7. J. Clark, XSL transformations (XSLT) specification, 1999, http://www.w3.org/TR/WD-xslt.
8. S. Cluet, C. Delobel, J. Simeon, K. Smaga, Your mediators need data conversion! in: Proceedings of ACM- SIGMOD International Conference on Management of Data, Seattle, WA, 1998, pp. 177-188.
9. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, D. Suciu, A query language for XML, in: Proceedings of the Eighth International World Wide Web Conference (WWW8), Toronto, Canada, Computer Networks 31(11-16) (1999) 1155-1169.
10. H.-D. Ebbinghaus, J. Flum, Finite Model Theory, 2nd Edition, Springer, Berlin, 1999.
11. P. Fankhauser, M. Fernandez, A. Malhotra, M. Rys, J. Simeon, P. Wadler, XQuery 1.0 formal semantics, 2001, available from the W3C, http://www.w3.org/TR/query-semantics.
12. M.R. Garey, D.S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
13. R.L. Graham, B.L. Rothschild, J.H. Spencer, Ramsey Theory, 2nd Edition, Wiley, New York, 1990.
14. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
15. H. Hosoya, B.C. Pierce, XDuce: an XML processing language (preliminary report), in: WebDB 2000 (selected papers), Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 226-244.
16. H. Hosoya, B.C. Pierce, Regular Expression Pattern Matching for XML, in: Proceedings of the ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages (POPL), London, U.K., 2001, pp. 67-80.
17. R. Milner, M. Tofte, R. Harper, The Definition of Standard ML, MIT Press, Cambridge, MA, 1990.
18. T. Milo, D. Suciu, Type inference for queries on semistructured data, in: Proceedings of the ACM Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 215-226.
19. T. Milo, D. Suciu, V. Vianu, Typechecking for XML transformers, in: Proceedings of the SIGMOD-SIGACT- SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 11-22.
20. J.C. Mitchell, The implication problem for functional and inclusion dependencies, Inform. Control 56 (3) (1983) 154-173.
21. M. Murata. Transformation of documents and schemas by patterns and contextual conditions, in: Proceedings of Third International Workshop on Principles of Document Processing (PODP), Palo Alto, CA, 1996, pp. 153-169.
22. M. Murata, Extended path expressions for XML, in: Proceedings of 20th ACM Symposium on Principles of Database Systems, Santa Barbara, CA, May 2001, pp. 126-137.
23. F. Neven, T. Schwentick, XML Schemas without Order, Unpublished manuscript, 1999.
24. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
25. Y. Papakonstantinou, V. Vianu, DTD inference for views of XML data, in: Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, TX, 2000, pp. 35-46.
26. F.P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (2) (1929) 264-286.
27. R. van der Meyden, The complexity of querying infinite data about linearly ordered domains, JCSS 54 (1) (1997) 113-135.
28. W. Thomas, Languages, automata, and logic, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, 1997 (Chapter 7).