Change Detection In XML Documents

Published

March 1, 2003

Author(s)

K H. Lee, Y C. Choy, S B. Cho, Xiao Tang, V R. McCrary

Abstract

This paper presents an efficient algorithm to detect changes between old and new versions of an XML document. The difference between the two versions can be considered to be an edit script that transforms one document tree into another. The proposed algorithm is based on a hybridization of bottom-up and top-down methods: the matching relationships between nodes in the two versions are produced in a bottom-up manner and then the top-down breadth-first search computes an edit script. Faster matching can be achieved because the algorithm does not need to investigate possible existence of matchings for all nodes. Furthermore, it can detect structurally meaningful changes such as the movement and copy of a subtree as well as simple changes to the node itself like insertion, deletion, and update.

Citation

Lecture Notes In Computer Science

Pub Type

Journals

Keywords

change detection, difference computation, edit operation, edit script, XML

Citation

Lee, K. , Choy, Y. , Cho, S. , Tang, X. and Mccrary, V. (2003), Change Detection In XML Documents, Lecture Notes In Computer Science (Accessed July 17, 2025)