基于序列的不确定XML整体小枝查询技术

针对基于序列的不确定XML小枝模式匹配算法需要子序列匹配和结构过滤两个阶段,而导致查询效率低的问题,提出一种以PrTRIM算法为基础的整体小枝模式匹配算法。H-PrTRIM算法将PrTRIM算法中子序列匹配和结构过滤两个阶段合并,在子序列匹配的同时进行结构过滤,使子序列匹配得到的结果就是查询的最终结果,解决了由于子序列匹配产生过多的中间结果而降低查询效率的问题。实验结果表明,H-PrTRIM算法的效率高于PrTRIM算法,应用于查询大文档和结构复杂的查询语句时更能体现出优势。

A Technology of Uncertain XML Sequence-based Holistic Twig Pattern Matching

In view of the problem that reduces the query efficiency since sequence-based algorithm of uncertain XML twig pattern matching PrTRIM （ Probabilistic TRee Indexing and Matching） needs two stages of subsequence matching and structure matching. H-PrTRIM （Holistic Probabilistic TRee Indexing and Matching） algorithm based on PrTRIM algorithm is thus proposed. It merges subsequence matching and structure matching that in PrTRIM algorithm into one and carries out subsequence matching and structure matching at the same time in H-PrTRIM algorithm. Hence the result of subsequence matching is the final result of query. The problem that reduces the query efficiency since too much intermediate results of subsequence matching is solved. The results of experiment show that H-PrT- RIM algorithm is more efficient than PrTRIM algorithm and has advantages in the case of querying large documents and complex query.