基于有效路径权重的XML树匹配算法  

XML tree matching algorithm based on effective path weight

作　　者：赵艳妮[1,2] 郭华磊[3] 

机构地区：[1]西安理工大学计算机科学与工程学院,陕西西安710048 [2]陕西职业技术学院计算机科学系,陕西西安710100 [3]西安通信学院信息服务系,陕西西安710106

出　　处：《计算机工程与设计》2016年第4期949-953,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(61272284);陕西省自然科学基金项目(2014JM8354);陕西省教育厅自然科学专项基金项目(2013JK1202)

摘　　要：针对当前XML文档信息查询算法的不足,提出一种基于有效路径权重的树匹配算法。在保持XML文档树有效结点和树结构的基础上,树根结点信息最重要,随着树深度增加,结点信息重要性逐渐减弱的特点,按照路径层次自动计算路径权重,并赋予相应路径,根据树结点的有效信息和树结构的有效路径计算树的匹配度。在大规模XML文档查询方面,实验验证了该算法在保证较高查准率和查全率的基础上,有效提高了查询效率。Focusing on the deficiency of the current XML document information query algorithm,a matching algorithm based on effective path weight tree was proposed.On the basis of maintaining the XML document tree effective nodes and tree structure,the root node information was most important,and as the tree＇s depth increases,the importance of node information was gradually weakened.According to the path＇s layer,the path weights were automatically calculated and then given to the corresponding path.According to the effective information of tree nodes and the effective path of tree structure,the tree matching degree was calculated.For queries in large XML document,the experimental results demonstrate that the algorithm not only guarantees the high precision ratio and the recall ratio,but effectively improves the query efficiency.

关 键 词：路径权重 树匹配 树深度 查询树 文档树 

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