Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New Rewritings and Optimizations for Regular Path Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
An Optimization Technique for Answering Regular Path Queries
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Taxonomy of XML schema languages using formal language theory
ACM Transactions on Internet Technology (TOIT)
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Mastering Regular Expressions
Journal of Computer and System Sciences
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Evolving schemas for streaming XML
Theoretical Computer Science
Evolving schemas for streaming XML
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems where the system is asked to find and assemble XML documents from the data sources and produce documents which satisfy a target schema. As schema representation, we consider Visibly Pushdown Automata (VPAs) which accept Visibly Pushdown Languages (VPLs). The latter have been shown to coincide with the family of (word-encoded) regular tree languages which are the basis of formalisms for specifying XML schemas. Furthermore, practical semi-formal XML schema specifications (defined by simple pattern conditions on XML) compile into VPAs which are exponentially more concise than other representations based on tree automata. Notably, VPLs enjoy a "well-behavedness" which facilitates us in addressing rewriting problems for XML data integration. Based on VPAs, we positively solve these problems, and present detailed complexity analyses.