Typechecking top-down XML transformations: Fixed input or output schemas

Information and Computation

Volumn 206, Issue 7, 2008, Pages 806-827

  Martens, Wim ^a   Neven, Frank ^b   Gyssens, Marc ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

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

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION MANAGEMENT; MARKUP LANGUAGES; XML;

(ALGORITHMIC) COMPLEXITY; ELSEVIER (CO); GENERAL (CO); INPUT AND OUTPUT (I/O); INPUT TYPE; SCHEMAS; TOP-DOWN; TYPE-CHECKING; XML TRANSFORMATIONS;

MATHEMATICAL TRANSFORMATIONS;

EID: 46149123187     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.01.002     Document Type: Article

References (35)

1. Alon N., Milo T., Neven F., Suciu D., and Vianu V. Typechecking XML views of relational databases. ACM Transactions on Computational Logic 4 3 (2003) 315-354
2. Alon N., Milo T., Neven F., Suciu D., and Vianu V. XML with data values: typechecking revisited. Journal of Computer and System Sciences 66 4 (2003) 688-727
3. Balmin A., Papakonstantinou Y., and Vianu V. Incremental validation of XML documents. ACM Transactions on Database Systems 29 4 (2004) 710-751
4. V. Benzaken, A. Frisch, G. Castagna, CDuce: an XML-centric general-purpose language, in: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), ACM Press, New York, 2003, pp. 51-63.
5. Bex G.J., Maneth S., and Neven F. A formal model for an expressive fragment of XSLT. Information Systems 27 1 (2002) 21-39
6. A. Brüggemann-Klein, M. Murata, D. Wood, Regular Tree and Regular Hedge Languages Over Unranked Alphabets: Version 1, Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, April 3, 2001.
7. Buck R. Partition of space. American Mathematical Monthly 50 9 (1943) 541-544
8. Buneman P., Fernandez M., and Suciu D. UnQl: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal 9 1 (2000) 76-110
9. Chlebus B.S. Domino-tiling games. Journal of Computer and System Sciences 32 3 (1986) 374-392
10. Cook S.A. An observation on time-storage trade-off. Journal of Computer and System Sciences 9 3 (1974) 308-316
11. Edelsbrunner H. Algorithms in Combinatorial Geometry (1987), Springer-Verlag, Berlin
12. Engelfriet J., and Maneth S. A comparison of pebble tree transducers with macro tree transducers. Acta Informatica 39 (2003) 613-698
13. Ferrante J., and Rackoff C. A decision procedure for the first order theory of real addition with order. SIAM Journal on Computing 4 1 (1975) 69-76
14. Hosoya H., and Pierce B.C. XDuce: a statically typed XML processing language. ACM Transactions on Internet Technology (TOIT) 3 2 (2003) 117-148
15. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, A.R. Meyer, N. Nivat, M.S. Paterson, D. Perrin (Eds.), Handbook of Theoretical Computer Science, vol. A, Chapter 2, North-Holland, 1990, pp. 67-161.
16. D. Kozen, Lower bounds for natural proof systems, in: Proceedings 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), IEEE, 1977, pp. 254-266.
17. D. Lee, M. Mani, M. Murata, Reasoning about XML Schema Languages Using Formal Language Theory, Technical Report, IBM Almaden Research Center, Log# 95071, 2000.
18. Lenstra H.W. Integer programming with a fixed number of variables. Mathematics of Operations Research 8 (1983) 538-548
19. Maneth S., and Neven F. Structured document transformations based on XSL. In: Connor R., and Mendelzon A. (Eds). Research Issues in Structured and Semistructured Database Programming (DBPL 1999). Lecture Notes in Computer Science vol. 1949 (2000), Springer, Berlin 79-96
20. S. Maneth, T. Perst, A. Berlea, H. Seidl, XML type checking with macro tree transducers, in: Proceedings of the 24th Symposium on Principles of Database Systems (PODS 2005), ACM Press, New York, 2005, pp. 283-294.
21. W. Martens, Static Analysis of XML Transformation and Schema Languages, Ph.D. Thesis, Hasselt University, 2006.
22. W. Martens, F. Neven, Frontiers of tractability for typechecking simple XML transformations, in: Proceedings of the 23rd Symposium on Principles of Database Systems (PODS 2004), ACM Press, New York, 2004, pp. 23-34.
23. Martens W., and Neven F. On the complexity of typechecking top-down XML transformations. Theoretical Computer Science 336 1 (2005) 153-180
24. Martens W., and Neven F. Frontiers of tractability for typechecking simple XML transformations. Journal of Computer and System Sciences 73 3 (2007) 362-390
25. T. Milo, D. Suciu, Type inference for queries on semistructured data, in: Proceedings of the Eighteenth Symposium on Principles of Database Systems (PODS 1999), ACM Press, New York, 1999, pp. 215-226.
26. Milo T., Suciu D., and Vianu V. Typechecking for XML transformers. Journal of Computer and System Sciences 66 1 (2003) 66-97
27. Neven F. Automata theory for XML researchers. SIGMOD Record 31 3 (2002) 39-46
28. F. Neven, T. Schwentick, XML Schemas Without Order, Unpublished manuscript, 1999.
29. Y. Papakonstantinou, V. Vianu, DTD inference for views of XML data, in: Proceedings of the 19th Symposium on Principles of Database Systems (PODS 2000), ACM Press, New York, 2000, pp. 35-46.
30. Seidl H. Haskell overloading is DEXPTIME-complete. Information Processing Letters 52 2 (1994) 57-60
31. C.M. Sperberg-McQueen, H. Thompson, XML Schema. Available from: , 2005.
32. L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential time: preliminary report, in: Conference Record of Fifth Annual ACM Symposium on Theory of Computing (STOC 1973), ACM Press, New York, 1973, pp. 1-9.
33. D. Suciu, Typechecking for semistructured data, in: Proceedings of the Eighth Workshop on Data Bases and Programming Languages (DBPL 2001), Springer, Berlin, 2001, pp. 1-20.
34. Suciu D. The XML typechecking problem. SIGMOD Record 31 1 (2002) 89-96
35. A. Tozawa, Towards static type checking for XSLT, in: Proceedings of the ACM Symposium on Document Engineering (DOCENG 2001), 2001 pp. 18-27.