Abstract
For many years the eXtensible Markup Language (XML) has attracted much research attention from database communities, particularly in the area of query and transformation languages such as XQuery and XSLT. XML documents are usually represented as trees. In order to accommodate the diversity of user requirements, it is desirable to conduct transformations on XML trees at flexible abstraction levels. However, most of current approaches have a fixed abstraction level at which updates must be identified for individual nodes and edges. In this paper we study XML database transformations with structured updates, for example, manipulations on portions of a tree, including deleting, modifying or inserting subtrees, copying contexts, etc, by using Abstract State Machines (ASMs) as it has turned out in [3] to be a universal computation model capturing database transformations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Gurevich, Y., Tillmann, N.: Partial updates. Theor. Comput. Sci. 336(2-3), 311–342 (2005)
Walukiewicz, I., Bojanczyk, M.: Forest algebras. In: Flum, J., Graedel, E., Wilke, T. (eds.) Logic and Automata. Amsterdam University Press (2007)
Wang, Q., Schewe, K.-D.: Axiomatization of database transformations. In: Proceedings of the ASM 2007: The 14th International ASM Workshop (2007)
Wilke, T.: An algebraic characterization of frontier testable tree languages. Theor. Comput. Sci. 154(1), 85–106 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Q., Schewe, KD., Thalheim, B. (2008). XML Database Transformations with Tree Updates. In: Börger, E., Butler, M., Bowen, J.P., Boca, P. (eds) Abstract State Machines, B and Z. ABZ 2008. Lecture Notes in Computer Science, vol 5238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87603-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-87603-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87602-1
Online ISBN: 978-3-540-87603-8
eBook Packages: Computer ScienceComputer Science (R0)