DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM SIGMOD Record
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Automata theory for XML researchers
ACM SIGMOD Record
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Regular path queries under approximate semantics
Annals of Mathematics and Artificial Intelligence
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
Constant-memory validation of streaming XML documents against DTDs
ICDT'07 Proceedings of the 11th international conference on Database Theory
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Querying and repairing inconsistent XML data
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Efficient incremental validation of XML documents after composite updates
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Validation of streaming XML documents with abstract state machines
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
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 |
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent to Extended Document Type Definitions (EDTDs), and thus, they provide means for elegantly solving various problems on XML. Especially, it has been shown that VPAs are the apt device for streaming XML. One of the important problems about XML that can be addressed using VPAs is the validation problem in which we need to decide whether an XML document conforms to the specification given by an EDTD. In this paper, we are interested in solving the approximate version of this problem, which is to decide whether an XML document can be modified by a tolerable number of edit operations to yield a valid one with respect to a given EDTD. For this, we define Visibly Pushdown Transducers (VPTs) that give us the framework for solving this problem under two different semantics for edit operations on XML. While the first semantics is a generalization of edit operations on strings, the second semantics is new and motivated by the special nature of XML documents. Usings VPTs, we give streaming algorithms that solve the problem under both the semantics. These algorithms use storage space that only depends on the size of the EDTD and the number of tolerable errors. Furthermore, they can check approximate validity of an incoming XML document in a single pass over the document, using auxilliary stack space that is proportional to the depth of the XML document.