期刊文献+

基于刻面描述的构件查询匹配模型及算法研究 被引量:28

Research on Matching Model and Algorithm for Faceted Based Software Component Query
下载PDF
导出
摘要 在软件复用研究不断深入的情况下 ,软件构件库的管理研究得到了产业界与学术界越来越多的重视 作为构件库管理的两个核心技术 ,构件的表示与检索技术已经成为研究热点 ,其中基于刻面描述的构件相关应用得到了广泛研究 ,针对构件查询的特点 ,结合模式分析中的树匹配思想 ,提出了新颖的构件树路径包含匹配模型及其相应的构件查询匹配算法 ,该算法可以在保持构件查准率的前提下 ,有效提高构件的查全率 ,算法的时间复杂度和空间复杂度是线性的 。 As the software reuse practices are deepening and the component repositories are scaling up, representing and retrieving of software components have gained more attention from software engineering researchers Based on the approximate queries of string data, a novel matching model named path containment matching model and the correspondence algorithm is proposed to retrieve reusable components classified in faceted scheme The results show the algorithm has a high search efficiency for the component retrieval The algorithm can be used not only in the component retrieval but also in other fields
出处 《计算机研究与发展》 EI CSCD 北大核心 2004年第10期1634-1638,共5页 Journal of Computer Research and Development
基金 国家"八六三"高技术研究发展计划基金项目 ( 2 0 0 2AA4Z3 43 0 )
关键词 软件复用 构件库 构件查询 刻面分类 路径包含匹配 software reuse component repository component retrieval faceted classification path containment matching
  • 相关文献

参考文献8

  • 1常继传,李克勤,郭立峰,梅宏,杨芙清.青鸟系统中可复用软件构件的表示与查询[J].电子学报,2000,28(8):20-23. 被引量:80
  • 2王渊峰,薛云皎,张涌,朱三元,钱乐秋.刻面分类构件的匹配模型[J].软件学报,2003,14(3):401-408. 被引量:47
  • 3S Torshen, F Naumann. Approximate tree embedding for querying XML data. ACM SIGIR 2000 Workshop on XML and Information Retrieval, Athen, Greece, 2000
  • 4Dennis Shasha, Jason T L Wang. ATreeGrep: Approximate search in unordered trees. The 14th Int'l Conf on Science and Statistical Database Management, Edinburgh, Scotland, 2002
  • 5D Shasha, J Tsong, L Wang. Exact and approximate algorithm for unordered tree matching. IEEE Trans on Systems, Man and Cybernetics, 1994, 24(4): 668~678
  • 6K Z Zhang, R Statman, D Shasha. On the editing distance between unordered labeled trees. Information Processing Letters,1992, 42(3): 133~139
  • 7Pascal Ferraro, Christophe Godin. An edit distance between quotiented trees. Algorithmic a, 2003, 36(1): 1~39
  • 8R Thorsten. A new measure of the distance between ordered trees and its applications. Department of Computer Science, University of Bonn, Tech Rep. 85166, 1997

二级参考文献3

共引文献107

同被引文献131

引证文献28

二级引证文献49

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部