A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Modulo Constraints and the Complexity of Typechecking XML Views
2008
Theory of Computing Systems
The typechecking problem for transformations of relational data into tree data is the following: given a relational-to-XML transformation P , and an XML type d, decide whether for every database instance D the result of the transformation P on D satisfies d. TreeQL programs with projection-free conjunctive queries (see [2] ) are considered as transformations and DTDs with arbitrary regular expressions as XML types. A non-elementary upper bound for the typechecking problem was already given by
doi:10.1007/s00224-008-9132-z
fatcat:rgpevfdwzjgrnkbg3wb7nygkz4