Region-based memory management
Information and Computation
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
On the Intersection of XPath Expressions
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Links: web programming without tiers
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
Commutativity analysis in XML update languages
ICDT'07 Proceedings of the 11th international conference on Database Theory
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
On the expressive power of XQuery-based update languages
XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
XQuery!: an XML query language with side effects
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Semantics, Types and Effects for XML Updates
DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Schema-based independence analysis for XML updates
Proceedings of the VLDB Endowment
A schema-based translation of XQuery updates
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Satisfiability algorithms for conjunctive queries over trees
Proceedings of the 14th International Conference on Database Theory
Dynamic reasoning on XML updates
Proceedings of the 14th International Conference on Extending Database Technology
Projection for XML update optimization
Proceedings of the 14th International Conference on Extending Database Technology
Types and constraints: from relational to XML data
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
A generic calculus of XML editing deltas
Proceedings of the 11th ACM symposium on Document engineering
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
| Hi-index | 0.00 |
An effective approach to support XML updates is to use XQuery extended with update operations. This approach results in very expressive languages which are convenient for users but are difficult to optimize or reason about. A crucial question underlying many static analysis problems for such languages, from optimization to view maintenance, is whether two expressions commute. Unfortunately, commutativity is undecidable for most existing XML update languages. In this article, we propose a conservative analysis for an expressive XML update language that can be used to determine commutativity. The approach relies on a form of path analysis that computes upper bounds for the nodes that are accessed or modified in a given expression. Our main result is a theorem that can be used to identify commuting expressions. We illustrate how the technique applies to concrete examples of query optimization in the presence of updates.