Research For Retrieving Software Components Based On Faceted Classification

The software development method that based on component reuse is one of the available ways to resolve the crisis of software, and the component base management system plays an important role in this development. In this system, component retrieval is the most basic and important function. Effective mechanism of component retrieval can reduce the cost for software reuse evidently. This paper give an improved algorithm which based on path containment matching algorithm and combined with the features of faceted classification scheme and the theory of tree matching. The results of experiment show the improved algorithm has high search efficiency in component retrieval.This thesis has three parts. The first part introduces the composition, function, and application of the component base management system. Then, provide some introduction to component classification scheme, especially to faceted classification scheme. The purpose is to prepare for the following content.In the second part, on the basis of faceted classification scheme and tree matching model, according to relaxation degree of matching condition, the thesis mainly discuss 6 matching model, and then pay more attention to the analysis of path matching algorithm which built on tree contain matching model.In the third part, the paper put forward a bidirectional improved path matching algorithm. Compared with the former algorithm, this improved algorithm provides a new kind of matching route which from component tree to query tree. Meanwhile, in order to reduce the time complexity of the improved algorithm, a beforehand judging mechanism is quoted what called "selective path matching mechanism". On the basis of above research, the paper makes a full-scale analysis in theory. Then, to compare with the former algorithm, a practical programmed test has been carried out. From the testing results, we can know more about the advantage and the deficiency of the improved algorithm.