Improved Matching Algorithm to Different Time Stamp Maps

Abstract:

Based on an analysis of the existing research about differences matching algorithms based SVG maps and their insufficiencies, this paper proposes an improved differences matching algorithm improved different of SVG maps(IDiffS). The algorithm defines a node set element, which is a set of path node composed by one or several element node, attribute node and value node. It also defines a labeling rule of structured trees based scalable vector graphics(SVG). Both reduce the number of elements in the arrays related to structured trees and the sum of types of operations in an generated difference script are reduced, which shortens the process of matching. The result of matching is a generated difference script, which records an update operation from the first time stamp map to the second one. Compared with the existing latest DiffS algorithm, this algorithm has lower time complexity. Application validates that DiffS algorithm is effective.