XML with data values: Typechecking revisited

N. Alon, T. Milo, F. Neven, D. Suciu, V. Vianu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

29 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
Title of host publicationProceedings of the 20th ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS 2001
PublisherAssociation for Computing Machinery (ACM)
Pages138-149
Number of pages12
ISBN (Electronic)9781581133615
StatePublished - 1 May 2001
Externally publishedYes
Event20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2001 - Santa Barbara, CA, United States
Duration: 21 May 200123 May 2001

Publication series

NameProceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
ISSN (Print)1055-6338

Conference

Conference20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2001
Country/TerritoryUnited States
CitySanta Barbara, CA
Period21/05/0123/05/01

ASJC Scopus subject areas

  • General Engineering

Fingerprint

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

Cite this