计算机应用研究2013，Vol.30Issue(2)：364-366,370,4.DOI:10.3969/j.issn.1001-3695.2013.02.011
一种高效的连续不确定XML小枝模式匹配算法
Efficient algorithm of continuous uncertain XML twig pattern matching
摘要
Abstract
At present on account of the uncertain XML twig pattern matching algorithm were based on merging, which including 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/小枝模式匹配/过滤剪枝/非归并Key words
continuous uncertain XML/ twig pattern matching/ filter pruning/ no-merging分类
信息技术与安全科学引用本文复制引用
张晓琳,吕庆,刘立新,郑春红..一种高效的连续不确定XML小枝模式匹配算法[J].计算机应用研究,2013,30(2):364-366,370,4.基金项目
国家自然科学基金资助项目(61163015) （61163015）
内蒙古自然科学基金重点资助项目(20080404Zd21) （20080404Zd21）
