Incremental recursive descent parsing
Computer Languages
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dyn-FO: a parallel, dynamic complexity class
Journal of Computer and System Sciences - Special issue on principles of database systems
Your mediators need data conversion!
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
One-unambiguous regular languages
Information and Computation
Efficient and flexible incremental parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Augmenting Parsers to Support Incrementality
Journal of the ACM (JACM)
DTD inference for views of XML data
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Database Systems: The Complete Book
Database Systems: The Complete Book
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Schemas for Integration and Translation of Structured and Semi-structured Data
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Complete Problems for Dynamic Complexity Classes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Reusing Batch Parsers as Incremental Parsers
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A Simple and Efficient Incremental LL(1) parsing
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
WWW '03 Proceedings of the 12th international conference on World Wide Web
A Web odyssey: from codd to XML
ACM SIGMOD Record
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Incremental evaluation of schema-directed XML publishing
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Managing XML Data: An Abridged Overview
Computing in Science and Engineering
Checking potential validity of XML documents
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Constraint-based wrapper specification and verification for cooperative information systems
Information Systems - Special issue: Data quality in cooperative information systems
IMAX: Incremental Maintenance of Schema-Based XML Statistics
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Finding an optimum edit script between an XML document and a DTD
Proceedings of the 2005 ACM symposium on Applied computing
Designing information-preserving mapping schemes for XML
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
PTDOM: a schema-aware XML database system for MPEG-7 media descriptions
Software—Practice & Experience - Research Articles
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
Efficient Revalidation of XML Documents
IEEE Transactions on Knowledge and Data Engineering
Weaving temporal and reliability aspects into a schema tapestry
Data & Knowledge Engineering
XFlat: Query-friendly encrypted XML view publishing
Information Sciences: an International Journal
Running tree automata on probabilistic XML
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental validation of string-based XML data in databases, file systems, and streams
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
Consistency of temporal XML documents
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Efficient incremental validation of XML documents after composite updates
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Schema-mediated exchange of temporal XML data
ER'06 Proceedings of the 25th international conference on Conceptual Modeling
Reasoning about ORA-SS data models using the semantic web
Journal on Data Semantics VII
On Simplification of Database Integrity Constraints
Fundamenta Informaticae
| Hi-index | 0.00 |
We investigate the incremental validation of XML documents with respect to DTDs and XML Schemas, under updates consisting of element tag renamings, insertions and deletions. DTDs are modeled as extended context-free grammars and XML Schemas are abstracted as "specialized DTDs", allowing to decouple element types from element tags. For DTDs, we exhibit an O(m log n) incremental validation algorithm using an auxiliary structure of size O(n), where n is the size of the document and m the number of updates. For specialized DTDs, we provide an O(m log2 n) incremental algorithm, again using an auxiliary structure of size O(n). This is a significant improvement over brute-force re-validation from scratch.