Typechecking for XML transformers

  • Authors:
  • Tova Milo;Dan Suciu;Victor Vianu

  • Affiliations:
  • Tel Aviv University;AT&T Labs;U.C. San Diego

  • Venue:
  • PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the typechecking problem for XML transformers: given an XML transformation program and a DTD for the input XML documents, check whether every result of the program conforms to a specified output DTD. We model XML transformers using a novel device called a k-pebble transducer, that can express most queries without data-value joins in XML-QL, XSLT, and other XML query languages. Types are modeled by regular tree languages, a nobust extension of DTDs. The main result of the paper is that typechecking for k-pebble transducers is decidable. Consequently, typechecking can be performed for a broad range of XML transformation languages, including XML-QL and a fragment of XSLT.