The Community for Technology Leaders
Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) (2003)
Bangalore, India
Mar. 5, 2003 to Mar. 8, 2003
ISSN: 1063-6382
ISBN: 0-7803-7665-X
pp: 519
Yuan Wang , University of Wisconsin - Madison
David J. DeWitt , University of Wisconsin - Madison
Jin-Yi Cai , University of Wisconsin - Madison
ABSTRACT
XML has become the de facto standard format for web publishing and data transportation. Since online information changes frequently, being able to quickly detect changes in XML documents is important to Internet query systems, search engines, and continuous query systems. Previous work in change detection on XML, or other hierarchically structured documents, used an ordered tree model, in which left-to-right order among siblings is important and it can affect the change result. This paper argues that an unordered model (only ancestor relationships are significant) is more suitable for most database applications. Using an unordered model, change detection is substantially harder than using the ordered model, but the change result that it generates is more accurate. This paper proposes X-Diff, an effective algorithm that integrates key XML structure characteristics with standard tree-to-tree correction techniques. The algorithm is analyzed and compared with XyDiff [CAM02], a published XML diff algorithm. An experimental evaluation on both algorithms is provided.
INDEX TERMS
null
CITATION

J. Cai, D. J. DeWitt and Y. Wang, "X-Diff: An Effective Change Detection Algorithm for XML Documents," Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405)(ICDE), Bangalore, India, 2003, pp. 519.
doi:10.1109/ICDE.2003.1260818
84 ms
(Ver 3.3 (11022016))