ACM SIGMOD Record
ACM SIGMOD Record
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Typechecking for Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
A Web odyssey: from codd to XML
ACM SIGMOD Record
XML with data values: typechecking revisited
Journal of Computer and System Sciences - Special issu on PODS 2001
Types for path correctness of XML queries
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Validating key constraints over XML document using XPath and structure checking
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Static analysis for path correctness of XML queries
Journal of Functional Programming
DTD-directed publishing with attribute translation grammars
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A uniform system for publishing and maintaining XML data
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Validating key constraints over XML document using XPath and structure checking
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Hi-index | 0.00 |
Abstract: Motivated by the need to export relational databases as XML data in the context of the Web, we investigate the typechecking problem for transformations of relational data into tree data (XML).The problem consists of statically verifying that the output of every transformation belongs to a given output tree language (specified for XML by a DTD), for input databases satisfying given integrity constraints. The typechecking problem is parameterized by the class of formulas defining the transformation, the class of output tree languages, and the class of integrity constraints. While undecidable in its most general formulation, the typechecking problem has many special cases of practical interest that turn out to be decidable. The main contribution of this paper is to trace a fairly tight boundary of decidability for typechecking in this framework. In the decidable cases we examine the complexity, and show lower and upper bounds. We also exhibit a practically appealing restriction for which typechecking is in PTIME.