Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chamberlin, D., Florescu, D., Robie, J.: XQuery update facility. W3C Working Draft (2006)
Lehti, P.: Design and implementation of a data manipulation processor for an XML query processor, Technical University of Darmstadt, Germany, Diplomarbeit (2001)
Tatarinov, I., Ives, Z., Halevy, A., Weld, D.: Updating XML. In: SIGMOD (2001)
Benedikt, M., Bonifati, A., Flesca, S., Vyas, A.: Adding updates to XQuery: Semantics, optimization, and static analysis. In: XIME-P 2005 (2005)
Ghelli, G., Ré, C., Siméon, J.: XQuery!: An XML query language with side effects. In: DataX Workshop, Munich, Germany. LNCS, Springer, Heidelberg (2006)
Boag, S., Chamberlin, D., Fernandez, M.F., Florescu, D., Robie, J., Siméon, J.: XQuery 1.0: An XML query language (2006)
Carey, M., Chamberlin, D., Florescu, D., Robie, J.: Programming with XQuery. Draft submitted for publication (2006)
Marian, A., Simeon, J.: Projecting XML documents. In: Proceedings of International Conference on Very Large Databases (VLDB), Berlin, Germany, pp. 213–224 (2003)
Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of xpath fragments. Theor. Comput. Sci. 336(1), 3–31 (2005)
Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51(1), 2–45 (2004)
Elkan, C.: Independence of logic database queries and updates. In: PODS, pp. 154–160 (1990)
Levy, A.Y., Sagiv, Y.: Queries independent of updates. In: Proceedings of 19th International Conference on Very Large Data Bases, Dublin, Ireland, August 24-27, pp. 171–181. Morgan Kaufmann, San Francisco (1993)
Benedikt, M., Bonifati, A., Flesca, S., Vyas, A.: Verification of tree updates for optimization. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 379–393. Springer, Heidelberg (2005)
Dekeyser, S., Hidders, J., Paredaens, J.: A transaction model for xml databases. World Wide Web 7(1), 29–57 (2004)
Lanin, V., Shasha, D.: A symmetric concurrent b-tree algorithm. In: FJCC, pp. 380–389 (1986)
Ghelli, G., Rose, K., Siméon, J.: Commutativity analysis in XML update languages (2006), http://www.di.unipi.it/~ghelli/papers/UpdateAnalysis.pdf
Fernández, M., Malhotra, A., Marsh, J., Nagy, M., Walsh, N.: XQuery 1.0 and XPath 2.0 data model (2006)
Wadler, P.: Two semantics of xpath. Discussion note for W3C XSLT Working Group (1999), http://homepages.inf.ed.ac.uk/wadler/papers/xpath-semantics/xpath-semantics.pdf
Cooper, E., Lindley, S., Wadler, P., Yallop, J.: Links: Web programming without tiers (unpublished Manuscript) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghelli, G., Rose, K., Siméon, J. (2006). Commutativity Analysis in XML Update Languages. In: Schwentick, T., Suciu, D. (eds) Database Theory – ICDT 2007. ICDT 2007. Lecture Notes in Computer Science, vol 4353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11965893_26
Download citation
DOI: https://doi.org/10.1007/11965893_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69269-0
Online ISBN: 978-3-540-69270-6
eBook Packages: Computer ScienceComputer Science (R0)