计算机与数字工程2017，Vol.45Issue(3)：492-497,6.DOI:10.3969/j.issn.1672-9722.2017.03.018
基于有序对的不确定XML小枝模式查询算法
Matching Twig Patterns in Uncertain XML Based on Ordered Pair
摘要
Abstract
As the current uncertain XML twig pattern queries do not solve the patent-child relationship effectively, this paper proposes ProOPCTwig algorithms based on ordered pair.The algorithm stores query tree and P-document by ordered pair.It compares the ordered pair of query tree pointed by pointer of stream nodes and the ordered pair with the same label in P-document to query.The main works include dealing with the distributed nodes effectively, calculating probability of every result, and improving efficiency of matching ordered pair.Theoretical analysis and experimental results prove the efficiency of ProOPCTwig.关键词
不确定XML数据/P-文档/小枝模式/父子关系/有序对Key words
uncertain XML data/P-document/twig pattern/patent-child relationship/ordered pair分类
信息技术与安全科学引用本文复制引用
刘立新,王永平..基于有序对的不确定XML小枝模式查询算法[J].计算机与数字工程,2017,45(3):492-497,6.基金项目
国家自然科学基金:连续不确定XML数据管理关键技术研究(编号:61163015) （编号:61163015）
内蒙古高等学校科学研究项目:云计算环境下海量XML数据关键字查询处理技术研究(编号:NJZY143) （编号:NJZY143）
内蒙古科技大学创新基金(编号:2014QDL046)资助. （编号:2014QDL046）
