Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
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)
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
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
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Rewriting of visibly pushdown languages for xml data integration
Proceedings of the 17th ACM conference on Information and knowledge management
Visibly pushdown transducers for approximate validation of streaming XML
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Querying and repairing inconsistent XML data
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
In this paper we model schema evolution for XML by defining formal language operators on Visibly Pushdown Languages (VPLs). Our goal is to provide a framework for efficient validation of streaming XML in the realistic setting where the schemas of the exchanging parties evolve and thus diverge from one another. We show that Visibly Pushdown Languages are closed under the defined language operators and this enables us to expand the schemas (for XML) in order to account for flexible or constrained evolution.