Pattern Tree最小简单分解策略  

Minimal Simple Decomposition Strategy of Pattern Tree

作　　者：邓娜[1] 王宇[1] 范士勇[1] 齐鸿志[1] 安海宁[1] 肖胜刚[1] 

机构地区：[1]河北大学计算中心,河北保定071002

出　　处：《计算机工程与应用》2006年第18期160-163,共4页Computer Engineering and Applications

摘　　要：PatternTree(PTQ)是复杂的树状结构,求解PTQ需要在XML文档集合中查找与之匹配的数据。在PTQ中,只有部分节点是需要输出的查询目标节点,其余节点则是中间结果。因此,如何在求解过程中尽量避免中间结果的产生,是XML查询优化面临的一个关键问题。论文提出了一种PTQ分解策略,能够根据不同查询操作的粒度,将PTQ分解为可用一种内部操作实现的最大片断集合。从而有效的限制中间结果的产生,提高查询效率。Pattern tree has complex structure.To evaluate the pattern needs to find all the matching nodes in the XML data.But only some of the nodes of the pattern tree are the target nodes of the query,and the others are intermediate results.It is a key problem on how to decrease the size of the intermediate results and limit the existing periods of the results.In this paper,we present a pattern tree decomposition strategy,which can decompose the Pattern tree into the set of the largest parts based on the query granularity.Each part can be dealt with just one query operation.The experiments indicate the query efficiency can be promoted by avoiding the unrelated intermediate results.

关 键 词：Pattem TREE 分解 XML 

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