作　　者： ; ; ; (翟学敏）;

机构地区： 中南大学信息科学与工程学院

出　　处： 《中国科技论文在线》 2008年第2期85-92,共8页

摘　　要： 基于海量XML文档查询速度已不能满足日益增长的信息关联和服务请求多样性的需求,本文提出一个重构XML结构的频繁向量选择增量模式树(XFP-tree)算法,该算法以XML键为基础,首先对XML结构进行向量矩阵处理,再通过投影频繁模式树实现对XML结构进行分裂、合并、更改与取消等优化措施,满足XML结构简洁性与查询多样性;结合投影和树结构技术,讨论XML键向量矩阵频繁项集的划分规则,而相应启发式策略的制定与支持度阈值的讨论有利于算法效率的提高。对比其它关联算法,一系列仿真实验表明所提出的算法具有一定的有效性及合理性,是重构XML结构的一种有效方法。 Because the query rate based on the XML documents is unable to fulfill the daily increasing demands of the information association and the multiformity of service request, this paper proposed a new frequent pattern tree algorithm for selected incremental vector items set of refactoring XML structure （XFP-tree）. The algorithm bases on the XML key, firstly deals XML structure with vector matrix processing, then uses project frequent pattern tree to optimize the XML structure by dissociating, uniting, updating and canceling etc. in order to satisfy the conciseness of the XML structure and query multiformity. Combining project and tree-structure manipulation, it discusses the divide rule of XML key vector matrix frequent pattern. And it improves the algorithm efficiency by establishing heuristic strategy and support thresholds. Contrasted with other association rule’s algorithms, a series of emulation experiments show that this method which has proper the effectiveness and feasibility is an efficacious method of refactoring XML structure.

关 键 词： 数据库理论 结构重构 键 向量矩阵 投影频繁模式树

领　　域： [自动化与计算机技术] [自动化与计算机技术]