With the deepening of reuse practice and scaling up of the component repository, the research of representing and retrieving software components gains more attention in software engineering research. A method based on tree inclusion is proposed to retrieve reusable components classified in faceted scheme, which combines the theory of tree matching and the feature of faceted classification scheme. The analysis and the experimental results demonstrate the feasibility and effectiveness of this method.
[1] Podgurski, A., Pierce, L. Retrieving reusable software by sampling behavior. ACM Transactions on Software Engineering and Methodology, 1993,2(3):286~303.
[2] Zaremski, A.M. Signature and specification matching [Ph.D. Thesis]. School of Computer Science Carnegie Mellon University, 1996.
[3] Merkl, D., Tjoa, A.M., Kappel, G. Learning the semantic similarity of reusable software components. In: Frakes, W.B., ed. Proceedings of the 3rd International Conference on Software Reuse (ICSR'94). Rio de Janeiro: IEEE Computer Society Press, 1994. 33~41.
[4] Damiani, E., Fugini, M.G., Bellettini, C. A hierarchy-aware approach to faceted classification of objected-oriented components. ACM Transactions on Software Engineering and Methodology, 1999,8(3):215~262.
[5] Henninger, S. Supporting the process of satisfying information needs with reusable software libraries: an empirical study. In: Samadzadeh, M.H., Mansour, K.Z., eds. Proceedings of the 17th International Conference on Software Engineering on Symposium on Software Reusability. Seattle, WA: ACM Press, 1995. 267~270.
[6] Chang, Ji-chuan, Li,Ke-qin, Guo, Li-feng, et al. Representing and retrieving reusable software components in JB (JadeBird) system. Electronica Journal, 2000,28(8):20~24 (in Chinese).
[7] Sorumgard, L.S., Sindre, G., Stokke, F. Experiences from application of a faceted classification scheme. In: Proceedings of the 2nd International Conference on Software Reuse (REUSE'93). IEEE Computer Society Press, 1993. 24~26.
[8] Gibb, F., McCartan, C., O'Donnell, R., et al. The integration of information retrieval techniques within a software reuse environment. Journal of Information Science, 2000,26(4):520~539.
[9] Wang, J.T.L., Shapiro, B.A., Shasha, D., et al. An algorithm for finding the largest approxmately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1998,20(8):889~895.
[10] Schlieder, T. ApproXQL: design and implementation of an approximate pattern matching language for XML. Technical Report, B 01-02, Freie Universit?t Berlin, 2001.
[11] Tai, Kuo-chung. The tree-tree correction problem. Journal of the Association for Computing Machinery, 1979,26,(3):422~433.