One-unambiguous regular languages
Information and Computation
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A survey on tree edit distance and related problems
Theoretical Computer Science
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)
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Information Processing Letters
The cost of traveling between languages
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Regular Repair of Specifications
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Deterministic automata on unranked trees
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Bounded repairability for regular tree languages
Proceedings of the 15th International Conference on Database Theory
Hi-index | 0.00 |
Integrity constraint management concerns both checking whether data is valid and taking action to restore correctness when invalid data is discovered. In XML the notion of valid data can be captured by schema languages such as Document Type Definitions (DTDs) and more generally XML schemas. DTDs have the property that constraint checking can be done in streaming fashion. In this paper we consider when the corresponding action to restore validity -- repair -- can be done in streaming fashion. We formalize this as the problem of determining, given a DTD, whether or not a streaming procedure exists that transforms an input document so as to satisfy the DTD, using a number of edits independent of the document. We show that this problem is decidable. In fact, we show the decidability of a more general problem, allowing a more general class of schemas than DTDs, and requiring a repair procedure that works only for documents that are already known to satisfy another class of constraints. The decision procedure relies on a new analysis of the structure of DTDs, reducing to a novel notion of game played on pushdown systems associated with the schemas.