XML with data values: Typechecking revisited

Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu

Research output: Contribution to journalArticle

38 Scopus citations

Abstract

We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output DTD, for inputs satisfying a given input DTD. This problem had been studied by a subset of the authors in a simplified framework that captured the structure of XML documents but ignored data values. We revisit here the typechecking problem in the more realistic case when data values are present in documents and tested by queries. In this extended framework, typechecking quickly becomes undecidable. However, it remains decidable for large classes of queries and DTDs of practical interest. The main contribution of the present paper is to trace a fairly tight boundary of decidability for typechecking with data values. The complexity of typechecking in the decidable cases is also considered.

Original languageEnglish (US)
Pages (from-to)688-727
Number of pages40
JournalJournal of Computer and System Sciences
Volume66
Issue number4
DOIs
StatePublished - Jun 2003
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'XML with data values: Typechecking revisited'. Together they form a unique fingerprint.

Cite this