Improving Performance of Change Detection Algorithms through the Efficiency of Matching


The KIPS Transactions:PartD, Vol. 14, No. 2, pp. 145-156, Apr. 2007
10.3745/KIPSTD.2007.14.2.145,   PDF Download:

Abstract

Recently, the needs for effective real-time change detection algorithms for XML/HTML documents are increased in such fields as the detection of defacement attacks to web documents, the version management, and so on. Especially, those applications of real-time changedetection for large number of XML/HTML documents require fast heuristic algorithms to be used in real-time environment, instead of algorithms which compute minimal cost-edit scripts. Existing heuristic algorithms are fast in execution time, but do not provide satisfactoryedit script. In this paper, we present existing algorithms XyDiff and X-tree Diff, analyze their problems and propose algorithm X-tree Diff which improve problems in existing ones. X-tree Diff has similar performance in execution time with existing algorithms, but it improves matching ratio between nodes from two documents by refining matching process based on the notion of efficiency of matching.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. K. Lee and D. A. Kim, "Improving Performance of Change Detection Algorithms through the Efficiency of Matching," The KIPS Transactions:PartD, vol. 14, no. 2, pp. 145-156, 2007. DOI: 10.3745/KIPSTD.2007.14.2.145.

[ACM Style]
Suk Kyoon Lee and Dong Ah Kim. 2007. Improving Performance of Change Detection Algorithms through the Efficiency of Matching. The KIPS Transactions:PartD, 14, 2, (2007), 145-156. DOI: 10.3745/KIPSTD.2007.14.2.145.