概率XML文件树结点概率的查询算法  

Node Probability Query Algorithm in Probabilistic XML Document Tree

作　　者：王建卫[1,2] 郝忠孝[1,3] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080 [2]东北林业大学机电工程学院,哈尔滨150040 [3]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机研究与发展》2012年第4期785-794,共10页Journal of Computer Research and Development

基　　金：黑龙江省自然科学基金项目(F200702)

摘　　要：概率XML文件是概率数据的网络数据交换和表示标准,元素取值及其概率的查询与计算是概率XML文件的重要研究内容.概率XML文件树是一种有效的概率XML文件的数据模型,定义了概率XML文件树的基本路径和扩展路径,提出了根据可能世界原理将概率XML文件树分解为普通子XML树的集合的算法,根据路径分析原理将概率XML文件树分解为子概率XML树的集合的算法和相应的查询与计算结点及结点集合概率的算法,并通过实验进行了比较分析.实验结果表明:这两种方法是有效的;与前一种方法比较,后一种方法适合较大的概率XML文件树、结点及结点集合的概率的查询,计算过程较简单.Because probabilistic XML document is the network data exchange and representation standard of probabilistic data,query and computation method of the element or elements and the probability is a main research content.Probabilistic XML document tree is an effective data model of probabilistic XML document,so this paper presents two kinds of query algorithms based on the definitions of basic path expression and extended path expression.One is that the probabilistic XML tree is firstly decomposed into the set of ordinary XML subtrees based on possible world principle and then the probability query algorithm of a single node or some nodes is designed.The other is that the probabilistic XML tree is firstly decomposed into the set of probabilistic XML subtrees based on the path analysis principle and then the probability query algorithm is also designed.The two algorithms are compared and analyzed through the experiments and the results show that they are effective.Compared with the first method,the second one fits the larger probabilistic XML document tree,and the quering and computeation of node probability are easier.

关 键 词：概率XML文件树 基本路径 扩展路径 结点概率 查询 

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