XML Database Transformations with Tree Updates

Authors:
Qing Wang;Klaus-Dieter Schewe;Bernhard Thalheim
Affiliations:
Massey University, New Zealand;Information Science Research Centre, Palmerston North, New Zealand;Institute of Computer Science, CAU Kiel, Kiel, Germany
Venue:
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Year:
2008

Citing 2
Cited 0

An algebraic characterization of frontier testable tree languages

ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Partial updates

Theoretical Computer Science - Abstract state machines and high-level system design and analysis

Quantified Score

Hi-index	0.00

Visualization

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.