We study the problem of type checking and type inference for queries over semistructured data. Introducing a novel traces technique, we show that the problem is difficult in general (NP-complete), but can be solved in PTIME for many practical cases, including, in particular, queries over XML data. Besides being interesting by itself, we show that type inference and the related traces technique have several important applications, facilitating query formulation, optimization, and verification.
|Number of pages||12|
|State||Published - 1999|
|Event||Proceedings of the 1999 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99 - Philadelphia, PA, USA|
Duration: 31 May 1999 → 2 Jun 1999
|Conference||Proceedings of the 1999 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99|
|City||Philadelphia, PA, USA|
|Period||31/05/99 → 2/06/99|