On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Understanding the new SQL: a complete guide
Understanding the new SQL: a complete guide
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
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
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On the power of walking for querying tree-structured data
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Query automata over finite trees
Theoretical Computer Science
SilkRoute: A framework for publishing relational data in XML
ACM Transactions on Database Systems (TODS)
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
Efficiently publishing relational data as XML documents
The VLDB Journal — The International Journal on Very Large Data Bases
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science - Database theory
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Incremental evaluation of schema-directed XML publishing
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Data exchange: getting to the core
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
XML data exchange: consistency and query answering
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Expressiveness and complexity of xml publishing transducers
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
DTD-directed publishing with attribute translation grammars
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Interpreting tree-to-tree queries
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Query translation from XPath to SQL in the presence of recursive DTDs
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Information and System Security (TISSEC)
Hi-index | 0.00 |
A number of languages have been developed for specifying XML publishing, that is, transformations of relational data into XML trees. These languages generally describe the behaviors of a middleware controller that builds an output tree iteratively, issuing queries to a relational source and expanding the tree with the query results at each step. To study the complexity and expressive power of XML publishing languages, this article proposes a notion of publishing transducers, which generate XML trees from relational data. We study a variety of publishing transducers based on what relational queries a transducer can issue, what temporary stores a transducer can use during tree generation, and whether or not some tree nodes are allowed to be virtual, that is, excluded from the output tree. We first show how existing XML publishing languages can be characterized by such transducers, and thus provide a synergy between theory and practice. We then study the membership, emptiness, and equivalence problems for various classes of transducers. We establish lower and upper bounds, all matching, ranging from PTIME to undecidable. Finally, we investigate the expressive power of these transducers and existing languages. We show that when treated as relational query languages, different classes of transducers capture either complexity classes (e.g., PSPACE) or fragments of datalog (e.g., linear datalog). For tree generation, we establish connections between publishing transducers and logical transductions, among other things.