Ramsey theory (2nd ed.)
Hilbert's tenth problem
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of programming languages
Foundations of programming languages
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Languages, automata, and logic
Handbook of formal languages, vol. 3
Your mediators need data conversion!
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SilkRoute: trading between relations and XML
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
A relational model of data for large shared data banks
Communications of the ACM
XML with data values: typechecking revisited
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using Schema Matching to Simplify Heterogeneous Data Translation
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficiently Publishing Relational Data as XML Documents
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
XPERANTO: Middleware for Publishing Object-Relational Data as XML Documents
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Querying XML Views of Relational Data
Proceedings of the 27th International Conference on Very Large Data Bases
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding well-definedness of XQuery fragments
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Journal of Computer and System Sciences
Propagating XML constraints to relations
Journal of Computer and System Sciences
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
Well-definedness and semantic type-checking for the nested relational calculus
Theoretical Computer Science
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A crash course on database queries
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Expressiveness and complexity of XML publishing transducers
ACM Transactions on Database Systems (TODS)
Xml publishing: bridging theory and practice
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Complexity of typechecking XML views of relational databases
ICDT'07 Proceedings of the 11th international conference on Database Theory
Well-definedness and semantic type-checking in the nested relational calculus and XQuery
ICDT'05 Proceedings of the 10th international conference on Database Theory
Static and dynamic semantics of NoSQL languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
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 article 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.