Factorization forests of finite height
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Dyn-FO: a parallel, dynamic complexity class
Journal of Computer and System Sciences - Special issue on principles of database systems
Journal of the ACM (JACM)
Incremental maintenance of recursive views using relational calculus/SQL
ACM SIGMOD Record
Automata theory for XML researchers
ACM SIGMOD Record
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Incremental recomputation in local languages
Information and Computation
Incremental Maintenance of Nested Relational Views
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
ACM SIGMOD Record
Efficient Incremental Validation of XML Documents
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Incremental validation of XML documents
ACM Transactions on Database Systems (TODS)
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
Incremental maintenance for materialized XPath/XSLT views
WWW '05 Proceedings of the 14th international conference on World Wide Web
Incremental maintenance of path-expression views
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
On the complexity of typechecking top-down XML transformations
Theoretical Computer Science - Database theory
Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL
ACM Transactions on Database Systems (TODS)
Incremental evaluation of a monotone XPath fragment
Proceedings of the 14th ACM international conference on Information and knowledge management
Maintaining XPath views in loosely coupled systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
XPath evaluation in linear time
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Computing Surveys (CSUR)
Reasoning about XML with Temporal Logics and Automata
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proceedings of the 12th International Conference on Database Theory
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
XPath evaluation in linear time with polynomial combined complexity
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Incremental query evaluation in a ring of databases
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of text-preserving XML transformations
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Between tree patterns and conjunctive queries: is there tractability beyond acyclicity?
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
Incremental view maintenance for XPath queries asks to maintain a materialized XPath view over an XML database. It assumes an underlying XML database D and a query Q. One is given a sequence of updates U to D, and the problem is to compute the result of Q(U(D)): the result of evaluating query Q on database D after having applied updates U. This article initiates a systematic study of the Boolean version of this problem. In the Boolean version, one only wants to know whether Q(U(D)) is empty or not. In order to quickly answer this question, we are allowed to maintain an auxiliary data structure. The complexity of the maintenance algorithms is measured in, (1) the size of the auxiliary data structure, (2) the worst-case time per update needed to compute Q(U(D)), and (3) the worst-case time per update needed to bring the auxiliary data structure up to date. We allow three kinds of updates: node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D)·poly(|Q|)) per update and conjunctive forward XPath queries in time O(depth(D) · log(width(D))·poly(|Q|)) per update, where |Q| is the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in database D, respectively. The auxiliary data structures for maintenance are linear in |D| and polynomial in |Q| in all these cases.