Research on matching algorithm for XML-based software component query

Ruan Jian Xue Bao/Journal of Software

Volumn 14, Issue 7, 2003, Pages 1195-1202

  Xu, Ru Zhi ^a   Qian, Le Qiu ^a   Cheng, Jian Ping ^b   Wang, Yuan Feng ^a   Zhu, San Yuan ^c  

^a FUDAN UNIVERSITY   (China)

^b CVIC Software Engineering Co Ltd   (China)

^c Development Center of Computer Software Technology   (China)

Author keywords

Component query; Software component; Tree matching; XML

Indexed keywords

ALGORITHMS; COMPONENTS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; QUERY LANGUAGES; SOFTWARE PROTOTYPING; TREES (MATHEMATICS); XML;

COMPONENT QUERY; MATCHING ALGORITHMS; MATCHING COST; SOFTWARE COMPONENTS; THREE MATCHING;

COMPUTER SOFTWARE REUSABILITY;

EID: 0142028800     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Ivar J. Software reuse: Architecture, process and organization for business success. Reading: Addison-Wesley Publishing Company, 1997. 4-15.
2. Mili H, Mill A. Reuse based software engineering. New York: John Wiley and 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, 120(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 SIG1R 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.