Algorithm of refactoring XML structure with heuristic strategy
一种启发式XML结构重构算法

Considering the demand of the date relationship and service request multiform based on XML documents, this paper proposed a new frequent pattern tree algorithm for selected incremental vector items set of refactoring XML structure (XFP-tree). Bases on the XML Key, the algorithm firstly dealt with XML structure to vector matrix, then used project frequent pattern tree to optimize the XML structure through dissociating, uniting, updating and canceling to satisfy the conciseness of the XML structure and query multiversity. Combining project and tree-structure manipulation, this paper discussed the dividing rule of xml key vector matrix frequent pattern. This rule improved the algorithm efficiency by establishing heuristic strategy and support thresholds. Contrasted with other algorithms of Association Rule, a series of emulation experiments show that this method has the effectiveness and feasibility as an efficacious attempt of refactoring XML structure.