微信服务号

微信订阅号

2025-4-13- 11
Home > Archive>Volume 14, Issue 7, 2003 >1195-1202
PDF HTML XML Export Cite reminder
Research on Matching Algorithm for XML-Based Software Component Query
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [14]
    • |
  • Related [20]
    • |
  • Cited by [33]
    • | |
  • Comments
    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.

    Reference
    [1]Ivar J. Software reuse: Architecture, process and organization for business success. Reading: Addison-Wesley Publishing Company, 1997. 4～15.
    [2]Mili H, Mili A. Reuse based software engineering. New York: John Wiley & Sons Inc., 2002. 444～459.
    [3]Frakes WB, Pole TP. An empirical study of representation methods for reusable software components. IEEE Transactions on Software Engineering, 1994,l20(8):617～630.
    [4]Gibb F, McCartan C, O'Donnell R, Sweeney N, Leon R. The integration of information retrieval techniques within a software reuse environment. Journal of Information Science, 2000,26(4):520～539.
    [5]Torshen S. ApproXQL: Design and implementation of an approximate pattern matching language for XML. Technical Report, B 01-02, Freie University at Berlin, 2001.
    [6]Thorsten R. A new measure of the distance between ordered trees and its applications. Research Report, 85166, Department of Computer Science, University of Bonn, 1997.
    [7]Torshen S, Naumann F. Approximate tree embedding for querying XML data. In: Proceedings of ACM SIGIR Workshop on XML and Information Retrieval. Athens, 2000.
    [8]Zhang KZ. On the editing distance between unordered labeled trees. Information Processing Letters, 1992,42(3):133～139.
    [9]Wang YF. Research on retrieving reusable components classified in faceted scheme [Ph.D. Thesis]. Shanghai: Fudan University, 2002 (in Chinese with English abstract).
    [10]Chang JC, Li KQ, Guo LF, Mei H, Yang FQ. Representing and retrieving reusable software components in JB (Jadebird) system. Electronic Journal, 2000,28(8):20～24 (in Chinese with English abstract).
    [11]Kilpelainen P. Tree matching problems with applications to structured text databases. Technical Report, A-1992-6, Department of Computer Science, University of Helsinki, 1992.
    [12]Kilpelainen P. Ordered and unordered tree inclusion. SIAM Journal on Computing, 1995,24(2):340～356.
    [13]王渊峰.基于刻面描述的构件检索算法研究[博士学位论文].上海:复旦大学,2002.
    [14]常继传,李克勤,郭立峰,梅宏,杨芙清.青鸟系统中可复用软件构件的表示与查询.电子学报,2000,28(8):20～24.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

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

Copy
Share
Article Metrics
  • Abstract:4601
  • PDF: 5921
  • HTML: 0
  • Cited by: 0
History
  • Received:November 08,2002
  • Revised:January 20,2003
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2034841Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063