Updating derived relations: detecting irrelevant and autonomously computable updates
ACM Transactions on Database Systems (TODS)
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A comprehensive XQuery to SQL translation using dynamic interval encoding
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath satisfiability in the presence of DTDs
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Intersection of XPath Expressions
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Maintaining XPath views in loosely coupled systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Efficient static analysis of XML paths and types
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Deciding XPath containment with MSO
Data & Knowledge Engineering
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
Semantics, Types and Effects for XML Updates
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
From XQuery to relational logics
ACM Transactions on Database Systems (TODS)
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
XPathMark: an XPath benchmark for the XMark generated data
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Algebraic incremental maintenance of XML views
Proceedings of the 14th International Conference on Extending Database Technology
Parametric polymorphism and semantic subtyping: the logical connection
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Type-based detection of XML query-update independence
Proceedings of the VLDB Endowment
XML query-update independence analysis revisited
Proceedings of the 2012 ACM symposium on Document engineering
On the expressive power of update primitives
Proceedings of the 32nd symposium on Principles of database systems
Revisiting “forward node-selecting queries over trees”
ACM Transactions on Database Systems (TODS)
Algebraic incremental maintenance of XML views
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.01 |
Independence analysis is the problem of determining whether an update affects the result of a query, e.g. a constraint or materialized view. We develop a new, modular framework for static independence analysis that decomposes the problem into two orthogonal subproblems: approximating the destabilizer, that is, a finite representation of the set of updates that can change the result of the query, and testing whether the update and destabilizer overlap via an intersection analysis. Focusing on XML queries as the view language and the XQuery Update Facility as the update language, we present a syntactic query rewriting algorithm for translating queries to destabilizers, and show that intersection checking can be reduced to satisfiability problems for which efficient checkers already exist. We present an implementation based on an expressive tree satisfiability checker and a Satisfiability Modulo Order package, and give experiments confirming that the resulting analysis is both fast and effective.