Have a personal or library account? Click to login
A Component Retrieval Tree Matching Algorithm Based on a Faceted Classification Scheme Cover

A Component Retrieval Tree Matching Algorithm Based on a Faceted Classification Scheme

By: Yao Wang,  Bo Wang and  Minghan Liu  
Open Access
|Mar 2015

Abstract

An efficient scheme of component retrieval can significantly reduce the cost of software reuse. For this purpose, a method of successfully retrieving of specified components from the component repository is a crucial consideration. However, neither the retrieval efficiency, nor the query-matching rate of the traditional method, which is based on a faceted classification scheme, satisfies the requirements of component retrieval. In this paper a novel component retrieval method combining the features of the faceted classification scheme and the theory of tree matching is proposed. This method not only accurately retrieves components that match queries, but also considers any incomplete descriptions of the retrieval component to completely ensure the relaxation ability of the component retrieval. The experimental results show that the retrieval matching method proposed is highly efficient, and it retrieves feasibly and efficiently the components.

DOI: https://doi.org/10.1515/cait-2015-0002 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 14 - 23
Published on: Mar 13, 2015
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2015 Yao Wang, Bo Wang, Minghan Liu, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.