Efficient change detection in tree-structured data

Authors:
Dong Ah Kim;Suk-Kyoon Lee
Affiliations:
Division of Information and Computer Science, Dankook University, Seoul, Korea;Division of Information and Computer Science, Dankook University, Seoul, Korea
Venue:
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
Year:
2003

Citing 3
Cited 1

Meaningful change detection in structured data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Detecting Changes in XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering

X-Tree diff+: efficient change detection algorithm in XML documents

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present X-tree Diff, a change detection algorithm for tree-structured 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.