Typechecking Top-Down Uniform Unranked Tree Transducers

We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input schema. As typechecking quickly turns undecidable for query languages capable of testing equality of data values, we return to the limited framework where we abstract XML documents as labeled ordered trees. We focus on simple top-down recursive transformations motivated by XSLT and structural recursion on trees. We parameterize the problem by several restrictions on the transformations (deleting, non-deleting, bounded width) and consider both tree automata and DTDs as output schemas. The complexity of the typechecking problems in this scenario range from PTIME to EXPTIME.

[1]  Frank Neven,et al.  Automata theory for XML researchers , 2002, SGMD.

[2]  Dan Suciu,et al.  Type inference for queries on semistructured data , 1999, PODS '99.

[3]  Frank Neven,et al.  A formal model for an expressive fragment of XSLT , 2002, Inf. Syst..

[4]  Yannis Papakonstantinou,et al.  DTD inference for views of XML data , 2000, PODS.

[5]  Helmut Seidl,et al.  Haskell Overloading is DEXPTIME-Complete , 1994, Inf. Process. Lett..

[6]  Dan Suciu,et al.  UnQL: a query language and algebra for semistructured data based on structural recursion , 2000, The VLDB Journal.

[7]  Dan Suciu.  The XML typechecking problem , 2002, SGMD.

[8]  Thomas Schwentick,et al.  Query automata over finite trees , 2002, Theor. Comput. Sci..

[9]  Ferenc Gécseg,et al.  Tree Languages , 1997, Handbook of Formal Languages.

[10]  Noga Alon,et al.  XML with data values: typechecking revisited , 2003, J. Comput. Syst. Sci..

[11]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[12]  Akihiko Tozawa.  Towards static type checking for XSLT , 2001, DocEng '01.

[13]  Dan Suciu,et al.  Typechecking for XML transformers , 2000, J. Comput. Syst. Sci..

[14]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

[15]  Frank Neven,et al.  Structured Document Transformations Based on XSL , 1999, DBPL.

[16]  Dan Suciu.  Typechecking for Semistructured Data , 2001, DBPL.

[17]  Moshe Y. Vardi.  A Note on the Reduction of Two-Way Automata to One-Way Automata , 1989, Inf. Process. Lett..

[18]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  Eric van der Vlist,et al.  XML Schema , 2002 .

[21]  Stephen A. Cook,et al.  An observation on time-storage trade off , 1973, J. Comput. Syst. Sci..

[22]  Derick Wood,et al.  Regular tree and regular hedge languages over unranked alphabets , 2001 .

[23]  Noga Alon,et al.  Typechecking XML views of relational databases , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[24]  Thomas Schwentick,et al.  XML schemas without order , 1999 .

[25]  Richard J. Lipton,et al.  Alternating Pushdown and Stack Automata , 1984, SIAM J. Comput..