Abstract
We present X-tree Diff, a change detection algorithm for treestructured data such as XML/HTML documents. X-tree Diff uses a specially designed data structure, called X-tree. Nodes of X-tree have a special hash-valued field representing the structure and data of the subtree rooted at each node, which enables us to compare between subtrees efficiently. X-tree Diff allows exact matchings at early stage, so as to reduce the possibility of wrong matchings. We show that X-tree Diff runs in O(n), where n is the number of nodes in X-trees, in worst case as well as in average case.
The present research was conducted by the research fund of Dankook University in 2001.
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
Preview
Unable to display preview. Download preview PDF.
References
S. M. Selkow, “The tree-to-tree editing problem,” Information Proc. Letters, 6, pp.184–186, 1977.
K. Tai, “The tree-to-tree correction problem,” Journal of the ACM, 26(3), pp.422–433, July 1979.
S. Chawathe and H. G. Molina, “Meaningful Change Detection in Structured Data,” In Proc. of ACM SIGMOD’ 97, pp.26–37, 1997.
Curbera and D. A. Epstein, “Fast Difference and Update of XML Documents,” XTech’ 99, San Jose, March 1999.
G. Cobéna, S. Abiteboul and A. Marian, “Detecting Changes in XML Documents,” The 18th ICDE, 2002.
Y. Wang, D. J. DeWitt, J. Y. Cai, “X-Diff: An Effective Change Detection Algorithm for XML Documents,” To appear in the 19th ICDE, 2003.
H. Maruyama, K. Tamura and N. Uramoto, “Digest values for DOM(DOMHash) Proposal,” IBM Tokyo Research Laboratory, 1998.
R. Rivest, “The MD4 Message-Digest Algorithm,” MIT and RSA Data Security, Inc., April 1992.
Document Object Model (DOM) http://www.w3.org/DOM/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, D.A., Lee, SK. (2003). Efficient Change Detection in Tree-Structured Data. In: Chung, CW., Kim, CK., Kim, W., Ling, TW., Song, KH. (eds) Web and Communication Technologies and Internet-Related Social Issues — HSI 2003. HSI 2003. Lecture Notes in Computer Science, vol 2713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45036-X_74
Download citation
DOI: https://doi.org/10.1007/3-540-45036-X_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40456-9
Online ISBN: 978-3-540-45036-8
eBook Packages: Springer Book Archive