一种高效的连续不确定XML小枝模式匹配算法  

Efficient algorithm of continuous uncertain XML twig pattern matching

作　　者：张晓琳[1] 吕庆[1] 刘立新[1] 郑春红[1] 

机构地区：[1]内蒙古科技大学信息工程学院,包头014010

出　　处：《计算机应用研究》2013年第2期364-366,370,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61163015);内蒙古自然科学基金重点资助项目(20080404Zd21)

摘　　要：针对目前不确定XML小枝模式匹配算法均基于归并,易造成很大的空间和时间浪费问题,提出基于P-文档模型的连续不确定XML的非归并的小枝模式匹配算法。算法在节点入队列和出队列时分别进行过滤剪枝操作,减少待处理节点的个数,匹配过程使用相互关联的链表存储中间结果,不需要归并。理论分析与实验结果表明,该算法是一种高效的连续不确定XML查询算法。At present on account of the uncertain XML twig pattern matching algorithm were based on merging, which inclu- ding many defects such as waste time and space. This paper proposed a new twig pattern matching algorithm based on existing P-document model which was also for continuous uncertain XML, when the nodes got into the queue and got out of the queue, executed filtering pruning operation, in order to reduce the number of pending nodes, matching process using interrelated list to store the intermediate result, this procedure did not need to merge. The theory research and the results of experiment show that this query algorithm is high efficient.

关 键 词：连续不确定XML 小枝模式匹配 过滤剪枝 非归并 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]