Frontiers of tractability for typechecking simple XML transformations

Journal of Computer and System Sciences

Volumn 73, Issue 3, 2007, Pages 362-390

  Martens, Wim ^a   Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

Complexity; Tree transformations; Typechecking; Unranked tree transducers; XML; XSLT

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION;

POLYNOMIAL TIME; TRACTABILITY; TREE TRANSFORMATIONS; TYPECHECKING; XML TRANSFORMATION;

XML;

EID: 33845877170     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.005     Document Type: Article

References (40)

1. Alon N., Milo T., Neven F., Suciu D., and Vianu V. Typechecking XML views of relational databases. ACM Trans. Comput. Log. 4 3 (2003) 315-354
2. Alon N., Milo T., Neven F., Suciu D., and Vianu V. XML with data values: Typechecking revisited. J. Comput. System Sci. 66 4 (2003) 688-727
3. Benedikt M., Fan W., and Geerts F. XPath satisfiability in the presence of DTDs. Proceedings of the 24th Symposium on Principles of Database Systems. PODS 2005 (2005), ACM Press 25-36
4. Bex G.J., Maneth S., and Neven F. A formal model for an expressive fragment of XSLT. Information Systems 27 1 (2002) 21-39
5. A. Brüggemann-Klein, M. Murata, 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
6. Buneman P., Fernandez M., and Suciu D. UnQl: A query language and algebra for semistructured data based on structural recursion. VLDB J. 9 1 (2000) 76-110
7. Clark J., and DeRose S. XML Path Language (XPath) (1999). http://www.w3.org/TR/xpath
8. Comon H., Dauchet M., Gilleron R., Jacquemard F., Lugiez D., Tison S., and Tommasi M. Tree automata techniques and applications. available on: (1997). http://www.grappa.univ-lille3.fr/tata
9. Cook S.A. An observation on time-storage trade-off. J. Comput. System Sci. 9 3 (1974) 308-316
10. Frisch A., Castagna G., and Benzaken V. CDuce: An XML-centric general-purpose language. Proceedings of the 8th ACM SIGPLAN International Conference on Functional Programming. ICFP 2003 (2003), ACM Press 51-63
11. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman
12. Gécseg F., and Steinby M. Tree languages. In: Rozenberg G., and Salomaa A. (Eds). Handbook of Formal Languages, vol. 3 (1997), Springer 1-68 (Chapter 1)
13. Green T.J., Miklau G., Onizuka M., and Suciu D. Processing XML streams with deterministic automata. Proceedings of the 9th International Conference on Database Theory. ICDT 2003 (2003), Springer 173-189
14. Hopcroft J.E., Motwani R., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation (2001), Addison-Wesley
15. Hosoya H., and Pierce B.C. XDuce: A statically typed XML processing language. ACM Trans. Internet Technology 3 2 (2003) 117-148
16. Engelfriet J., and Maneth S. A comparison of pebble tree transducers with macro tree transducers. Acta Inform. 39 (2003) 613-698
17. Kozen D. Lower bounds for natural proof systems. Proceedings 18th Annual Symposium on Foundations of Computer Science. FOCS 1977 (1977), IEEE 254-266
18. D. Lee, M. Mani, M. Murata, Reasoning about XML schema languages using formal language theory, Technical report, IBM Almaden Research Center, 2000, Log# 95071
19. Maneth S., and Neven F. Structured document transformations based on XSL. Research Issues in Structured and Semistructured Database Programming. DBPL 1999 (2000), Springer 79-96
20. W. Martens, Static analysis of XML transformation and schema languages, PhD thesis, Hasselt University and Transnational University of Limburg, 2006
21. Martens W., and Neven F. On the complexity of typechecking top-down XML transformations. Theoret. Comput. Sci. 336 1 (2005) 153-180
22. Martens W., Neven F., and Gyssens M. On typechecking top-down XML transformations: Fixed input or output schemas. submitted for publication, CoRR, cs.DB/0606094, avialable at: (2006). http://arxiv.org/abs/cs.DB/0606094
23. Martens W., Neven F., and Schwentick T. Complexity of decision problems for simple regular expressions. Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. MFCS 2004 (2004), Springer 889-900
24. Martens W., Neven F., and Schwentick T. Complexity of decision problems for simple regular expressions. Full Version of [23]. in preparation, available at: (2005). http://lrb.cs.uni-dortmund.de/~martens/
25. Miklau G., and Suciu D. Containment and equivalence for a fragment of XPath. J. ACM 51 1 (2004) 2-45
26. Milo T., and Suciu D. Type inference for queries on semistructured data. Proceedings of the 18th ACM Symposium on Principles of Database Systems. PODS 1999 (1999), ACM Press 215-226
27. Milo T., Suciu D., and Vianu V. Typechecking for XML transformers. J. Comput. System Sci. 66 1 (2003) 66-97
28. Neven F. Automata theory for XML researchers. SIGMOD Record 31 3 (2002)
29. Neven F., and Schwentick T. XPath containment in the presence of disjunction, DTDs, and variables. Proceedings of the 9th International Conference on Database Theory. ICDT 2003 (2003), Springer 315-329
30. Papakonstantinou Y., and Vianu V. DTD inference for views of XML data. Proc. 19th Symposium on Principles of Database Systems. PODS 2000 (2000), ACM Press 35-46
31. Papakonstantinou Y., and Vianu V. Incremental validation of XML documents. Proceedings of the 9th International Conference on Database Theory. ICDT 2003 (2003), Springer 47-63
32. Sipser M. Introduction to the Theory of Computation (1997), Brooks/Cole Publ.
33. Sperberg-McQueen C.M., and Thompson H. XML Schema (2005). http://www.w3.org/XML/Schema
34. Stockmeyer L.J., and Meyer A.R. Word problems requiring exponential time: Preliminary report. Conference Record of the 5th Annual ACM Symposium on Theory of Computing. STOC 1973 (1973), ACM Press 1-9
35. Suciu D. Typechecking for semistructured data. Proceedings of the 8th Workshop on Data Bases and Programming Languages. DBPL 2001 (2001), Springer 1-20
36. Suciu D. The XML typechecking problem. SIGMOD Record 31 1 (2002) 89-96
37. Tozawa A. Towards static type checking for XSLT. Proceedings of the ACM Symposium on Document Engineering. DOCENG 2001 (2001), ACM 18-27
38. P.T. Wood, Containment for XPath fragments under DTD constraints. Full version of [40]
39. P.T. Wood, Minimising simple XPath expressions, in: Proceedings of the 4th International Workshop on the Web and Databases, WebDB 2001, 2001, pp. 13-18
40. Wood P.T. Containment for XPath fragments under DTD constraints. Proceedings of the 9th International Conference on Database Theory. ICDT 2003 (2003), Springer 300-314