Research And Realization On Facet Based Component Retrieval

Component-based Software Development is a realistic way to improve software productivity and software quality. One of the important infrastructures– the component software store - has been attracting more and more attention from industry and academia. In order to help developers do selection and reuse from a large number of components in the component store, component store must provide efficient retrieval method. Therefore, how to inquire in component store effectively for better reuse has become the key point in the research on component store and software reuse.There are many software component's expressions and inquiry methods, Faceted scheme and faceted classification-based retrieval method have obtained attention and application from the software reuse sector. Component's facet description could be expanded to a tree of faceted scheme. The match problem between components in the component store and inquiry components can be converted to a match problem between tree structure descriptions.A new retrieval algorithm is proposed, the traversal match algorithm. This algorithm first limits the component tree to ordered tree, avoiding the NP difficult problem with the unordered tree match. Then, by traversaling the component tree and inquiry tree, the tree match problem can be converted to string match problem. Solving the string match problem helps solve the component retrieval problem. The analysis for the algorithm changes in different match models and the time complexity proves the high efficiency of algorithm theoretically.In the SoftStore system, the traversal match algorithm has been realized. The test for its practical performance proves the high efficiency of the algorithm. The traversal match algorithm also points out how to calculate the match value by the intermediate results, according to which the retrieval results return to users and help the reuse.