Back to Search
Start Over
A Component Retrieval Tree Matching Algorithm Based on a Faceted Classification Scheme
- Source :
- Cybernetics and Information Technologies. 15:14-23
- Publication Year :
- 2015
- Publisher :
- Walter de Gruyter GmbH, 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.
- Subjects :
- Scheme (programming language)
General Computer Science
Matching (graph theory)
Computer science
business.industry
InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL
Relaxation (iterative method)
Pattern recognition
computer.software_genre
Faceted classification
Tree (data structure)
Software
Component (UML)
Data mining
Artificial intelligence
business
computer
Blossom algorithm
computer.programming_language
Subjects
Details
- ISSN :
- 13144081
- Volume :
- 15
- Database :
- OpenAIRE
- Journal :
- Cybernetics and Information Technologies
- Accession number :
- edsair.doi...........97e1d2839b347ecbe4f2baead674dfa8
- Full Text :
- https://doi.org/10.1515/cait-2015-0002