Complexity of Typechecking XML Views of Relational Databases
- Cite this paper as:
- Wieczorek P. (2006) Complexity of Typechecking XML Views of Relational Databases. In: Schwentick T., Suciu D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg
The typechecking problem for transformations of relational data into tree data is the following: given a TreeQL program P (called transformation), and a DTD d (called output type), decide whether for every database instance D the result of the transformation P of D is of a type consistent with d (see ). TreeQL programs with projection-free conjunctive queries and DTDs with arbitrary regular expressions are considered here.
A non-elementary upper bound for the typechecking problem is given in  (although in a more general setting, where equality and negation in projection-free conjunctive queries and additional universal integrity constraints are allowed).
In this paper we show that the typechecking problem is in coNEXPTIME.
As an intermediate step we consider the following problem, which can be formulated in a language independent of XML notions. Given a set of triples of the form (ϕ, k, j), where ϕ is a projection-free conjunctive query and k, j are natural numbers, decide whether there exists a database D such that for each triple (ϕ, k, j) in the set, there exists a natural number α, such that there are exactly k + j * α tuples satisfying the query ϕ in D. Our main technical contribution consists of a NEXPTIME algorithm for the last problem.
Unable to display preview. Download preview PDF.