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.
|Number of pages||12|
|State||Published - 2001|
|Event||20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems - Santa Barbara, CA, United States|
Duration: 21 May 2001 → 23 May 2001
|Conference||20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems|
|City||Santa Barbara, CA|
|Period||21/05/01 → 23/05/01|