Noga Alon
Tova Milo
Dan Suciu
Abstract
Motivated by the need to export relational databases as XML data in the context of the Web, we investigate the typechecking problem for transformations of relational data into tree data (XML). The problem consists of statically verifying that the output of every transformation belongs to a given output tree language (specified for XML by a DTD), for input databases satisfying given integrity constraints. The typechecking problem is parameterized by the class of formulas defining the transformation, the class of output tree languages, and the class of integrity constraints. While undecidable in its most general formulation, the typechecking problem has many special cases of practical interest that turn out to be decidable. The main contribution of this article is to trace a fairly tight boundary of decidability for typechecking in this framework. In the decidable cases we examine the complexity, and show lower and upper bounds. We also exhibit a practically appealing restriction for which typechecking is in PTIME.
- Abiteboul, S., Buneman, P., and Suciu, D. 1999. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Mateo, Calif.]] Google Scholar
- Abiteboul, S., Hull, R., and Vianu, V. 1995. Foundations of Data. Addison-Wesley, Reading Mass.]]Google Scholar
- Alon, N., Milo, T., Neven, F., Suciu, D., and Vianu, V. 2001. XML with data values: Typechecking revisited. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS 2001). ACM, New York, 560--572.]] Google Scholar
- Beech, D., Lawrence, S., Maloney, M., Mendelsohn, N., and Thompson, H. 1999. XML schema, Part 1: Structures, May 1999. http://www.w3.org/TR/xmlschema-1/.]]Google Scholar
- Beeri, C. and Milo, T. 1999. Schemas for integration and translation of structured and semi-structured data. In Database Theory---ICDT99, P. B. C. Beeri, Ed. Lecture Notes in Computer Science, vol. 1540. Springer-Verlag, New York, 296--313.]] Google Scholar
- Biron, P. and Malhotra, A. 1999. XML schema, Part 2: Datatypes, May 1999. http://www.w3.org/TR/xmlschema-2/.]]Google Scholar
- Börger, E., Grädel, E., and Gurevich, Y. 1997. The Classical Decision Problem. Springer-Verleg, New York.]]Google Scholar
- Brüggemann-Klein, A., Murata, M., and Wood, D. 2001. Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001. Tech. Rep. HKUST-TCSC-2001-0, The Hong Kong University of Science and Technology.]]Google Scholar
- Büchi, J. R. 1960. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66--92.]]Google Scholar
- Carey, M., Florescu, D., Ives, Z., Lu, Y., Shanmugasundaram, J., Shekita, E., and Subramanian, S. 2000. XPERANTO: Publishing object-relational data as XML. WebDB 2000 (Informal Proceedings).]] Google Scholar
- Chamberlin, D., Clark, J., Florescu, D., Robie, J., Simeon, J., and Stefanascu, M. 2002. XQuery 1.0: An XML query language. http://www.w3.org/TR/xquery/.]]Google Scholar
- Cluet, S., Delobel, C., Siméon, J., and Smaga, K. 1998. Your mediators need data conversion! In SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, L. M. Haas and A. Tiwary, Eds. ACM, New York, 177--188.]] Google Scholar
- Codd, E. 1970. A relational model for large shared databanks. Commun. ACM 13, 6, 377--387.]] Google Scholar
- Deutsch, A., Fernandez, M., Florescu, D., Levy, A., Maier, D., and Suciu, D. 1999. Querying XML data. Data Eng. Bull. 22, 3, 10--18.]]Google Scholar
- Ebbinghaus, H.-D. and Flum, J. 1995. Finite Model Theory. Springer-Verlag, New York.]]Google Scholar
- Fernandez, M., Kadiyska, Y., Morishima, A., Suciu, D., and Tan, W. 2002. SilkRoute: A framework for publishing relational data in XML. Available from www.cs.washington.edu/homes/suciu.]]Google Scholar
- Fernandez, M., Suciu, D., and Tan, W. 2000. SilkRoute: Trading between relations and XML. In Proceedings of the WWW9 Conference. 723--746.]] Google Scholar
- Graham, R., Rothschild, B., and Spencer, J. H. 1990. Ramsey Theory, 2nd ed. Wiley, New York.]] Google Scholar
- Immerman, N. 1982. Upper and lower bounds for first-order expressibility. J. Comput. Syst. Sci. 25, 1, 76--98.]]Google Scholar
- Matiyasevich, Y. V. 1993. Hilbert's tenth problem. Foundations of Computing Series. MIT Press, Cambridge, Mass.]] Google Scholar
- McNaughton, R. and Papert, S. 1971. Counter-Free Automata. MIT Press, Cambridge, Mass.]] Google Scholar
- Milo, T., Suciu, D., and Vianu, V. 2000. Type checking for XML transformers. In Proceedings of the 19th ACM Symposium on Principles of Database Systems. ACM, New York, 11--22.]] Google Scholar
- Milo, T. and Zohar, S. 1998. Using schema matching to simplify heterogeneous data translation. In Proceedings of VLDB. 122--133.]] Google Scholar
- Mitchell, J. 1996. Foundations for Programmng Languages. MIT Press, Cambridge, Mass.]] Google Scholar
- Neven, F. and Schwentick, T. 1999. XML schemas without order. Unpublished manuscript.]]Google Scholar
- Papadimitriou, C. 1985. A note on the expressive power of PROLOG. Bulletin of the EATCS 26, 21--23.]]Google Scholar
- Papakonstantinou, Y. and Vianu, V. 2001. DTD inference for views of XML data. In Proceedings of the 20th Symposium on Principles of Database Systems (PODS 2001). ACM, New York, 35--46.]] Google Scholar
- Ramsey, F. P. 1929. On a problem of formal logic. Proc. London Math. Soc. 30, 2, 264--286.]]Google Scholar
- Shanmugasundaram, J., Shekita, E., Barr, R., Carey, M., Lindsay, B., Pirahesh, H., and Reinwald, B. 2000. Efficiently publishing relational data as XML documents. In Proceedings of VLDB. 65--76.]] Google Scholar
- Shanmugasundaram, J., Kiernana, J., Shekita, E., Fan, C., and Funderburk, J. 2001. Querying XML views of relational data. In Proceedings of VLDB. 261--270.]] Google Scholar
- Thomas, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages. G. Rozenberg and A. Salomaa, Eds. Vol. 3. Springer-Verlag, New York, Chap. 7, 389--456.]] Google Scholar
- van der Meyden, R. 1997. The complexity of querying infinite data about linearly ordered domains. J. Comput. Syst. Sci. 54, 1, 113--135.]] Google Scholar
- Vardi, M. 1995. On the complexity of bounded-variable queries. In Proceedings of the ACM Symposium on Principles of Database Systems. ACM, New York, 266--276.]] Google Scholar
Index Terms
- Typechecking XML views of relational databases
Recommendations
On the complexity of typechecking top-down XML transformations
Database theoryWe investigate the typechecking problem for XML transformations: statically verifying that every answer to a transformation conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for ...
Modulo Constraints and the Complexity of Typechecking XML Views
The typechecking problem for transformations of relational data into tree data is the following: given a relational-to-XML transformation P, and an XML type d, decide whether for every database instance $\mathcal{D}$the result of the transformation P on ...
Constraint Preserving Transformation from Relational Schema to XML Schema
XML has become the standard for publishing and exchanging data on the Web. However, most business data is managed and will remain to be managed by relational database management systems. As such, there is an increasing need to efficiently and accurately ...
Comments