Independence of logic database queries and update
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A symmetric concurrent B-tree algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
A Transaction Model for XML Databases
World Wide Web
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
XML query optimization in the presence of side effects
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
FLUX: functional updates for XML
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Commutativity analysis for XML updates
ACM Transactions on Database Systems (TODS)
Updates and views dependencies in semi-structured databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Regular expression subtyping for XML query and update languages
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Projection for XML update optimization
Proceedings of the 14th International Conference on Extending Database Technology
| Hi-index | 0.00 |
A common approach to XML updates is to extend XQuery with update operations. This approach results in very expressive languages which are convenient for users but are difficult to reason about. Deciding whether two expressions can commute has numerous applications from view maintenance to rewriting-based optimizations. Unfortunately, commutativity is undecidable in most recent XML update languages. In this paper, we propose a conservative analysis for an expressive XML update language that can be used to determine whether two expressions commute. The approach relies on a form of path analysis that computes upper bounds for the nodes that are accessed or modified in a given update expression. Our main result is a commutativity theorem that can be used to identify commuting expressions.