一种启发式XML结构重构算法  

Algorithm of refactoring XML structure with heuristic strategy

作　　者：刘波[1] 杨路明[1] 邓云龙[2] 

机构地区：[1]中南大学信息科学与工程学院 [2]中南大学湘雅附三医院,长沙410013

出　　处：《计算机应用》2008年第7期1696-1699,共4页journal of Computer Applications

基　　金：湖南信息职业学院科技创新项目(108652006011);湖南省教育厅科研基金资助项目(05c671)

摘　　要：基于海量XML文档查询时信息关联和服务请求多样性的需求,提出一个重构XML结构的频繁向量选择增量模式树(XFP-tree)算法。该算法以XML键为基础,利用向量矩阵处理方法、投影频繁模式树实现XML结构的分裂、合并、更改与取消等操作,同时讨论XML键向量矩阵频繁项集的划分规则及相应启发式策略与支持度阈值。对比其他关联算法,一系列仿真实验表明所提出算法具有一定的有效性及合理性,是重构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.

关 键 词：XML结构重构 XML键 向量矩阵 投影频繁模式树 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]