基于XML的软件构件查询匹配算法研究

徐如志; 钱乐秋; 程建平; 王渊峰; 朱三元

引用本文:	徐如志,钱乐秋,程建平,王渊峰,朱三元.基于XML的软件构件查询匹配算法研究.软件学报,2003,14(7):1195-1202

【打印本页】【下载PDF全文】【查看/发表评论】【EndNote】【RefMan】【BibTex】

←前一篇|后一篇→

过刊浏览高级检索

本文已被：浏览 5248次下载 6894次	码上扫一扫！
分享到：微信更多字体:加大+\|默认\|缩小-
基于XML的软件构件查询匹配算法研究
徐如志¹, 钱乐秋¹, 程建平², 王渊峰¹, 朱三元³
1.复旦大学,计算机与信息技术系,上海,200433;2.中创软件工程股份有限公司,软件研究院,山东,济南,250014;3.上海计算机软件技术开发中心,上海,200233

摘要:

在研究无序树包含匹配的基础上,提出一种新的基于XML的软件构件查询匹配算法.该算法可以在保持较高构件查准率的前提下,显著地提高构件的查全率,并提供对布尔查询的支持.此外,通过合理地设定约束条件以及利用动态规划的方法,将计算查询匹配代价的算法时间复杂度限定为多项式级,确保构件查询具有足够的查询效率.最后,通过在构件库原型系统RCRS上进行的一系列实验,进一步证明了新的查询匹配算法在软件构件查询实际应用中的可行性和有效性.

关键词: 软件构件 XML 构件查询树匹配

DOI：

分类号:

基金项目:Supported by the National High-Tech Research and Development Plan of China under Grant No.2001AA1100241 (国家高技术研究发展计划(863))

Research on Matching Algorithm for XML-Based Software Component Query

XU Ru-Zhi,QIAN Le-Qiu,CHENG Jian-Ping,WANG Yuan-Feng,ZHU San-Yuan

Abstract:

Based on the research of unordered tree-inclusion matching, a matching algorithm for XML-based component query is proposed. This algorithm can greatly improve the recall and provide support for Boolean query while maintaining a high level precision. Moreover, by adding some constraints on the basis of features of software component and using dynamic programming, the computation of matching cost is resolved in polynomial time, so that a high efficiency for the component query is guaranteed. Furthermore, the feasibility and efficiency of the new matching algorithm in practical application to software component query are confirmed by the results of a series of experiments on a prototype system RCRS.

Key words: software component XML component query tree matching