Abstract
Most previous work in change detection on XML documents used the ordered tree, with the best complexity of O(nlogn), where n is the size of the document. The best algorithm we had ever known for unordered model achieves polynomial time in complexity. In this paper, we propose a highly efficient algorithm named KF-Diff+. The key property of our algorithm is that the algorithm transforms the traditional tree-to-tree correction into the comparing of the key trees which are substantially label trees without duplicate paths with the complexity of O(n), where n is the number of nodes in the trees. In addition, KF-Diff+ is tailored to both ordered trees and unordered trees. Experiment shows that KF-Diff+ can handle XML documents at extreme speed. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Xu, H., Wu, Q., Wang, H., Yang, G., & Jia, Y. (2002). KF-Diff+: Highly efficient change detection algorithm for XML documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2519 LNCS, pp. 1273–1286). Springer Verlag. https://doi.org/10.1007/3-540-36124-3_80
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
