Type inference for queries on semistructured data

Tova Milo*, Dan Suciu

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

25 Scopus citations

Abstract

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.

Original languageEnglish
Pages215-226
Number of pages12
DOIs
StatePublished - 1999
EventProceedings of the 1999 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99 - Philadelphia, PA, USA
Duration: 31 May 19992 Jun 1999

Conference

ConferenceProceedings of the 1999 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '99
CityPhiladelphia, PA, USA
Period31/05/992/06/99

Fingerprint

Dive into the research topics of 'Type inference for queries on semistructured data'. Together they form a unique fingerprint.

Cite this