Date of Award
Park, Young Gil,
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
As libraries of reusable software components continue to grow, the issue of retrieving components from the library has become more and more important. In order to make software reuse possible, the library should collect enough components to support developers, but when the number of components increase, finding and choosing an appropriate component becomes more and more difficult. A few retrieval techniques have been used to address the problem of finding relevant components, but how effectively the library is structured and how the appropriate components are found quickly have received considerably less attention. In the thesis, we propose a method for organizing imperative program components in a library for supporting execution-based retrieval. A prototype system, called OERS, is developed using OOD and OOP. This system could be used to construct and maintain an organized reuse library through the initiation, deletion, adaptation, and browse operations. A retrieval subsystem allows user to retrieve, test and view components. OERS system provides more efficient retrieval method in terms of the retrieval time. The benefit is directly proportional to the total number of components in the library. Based on our experiments, the average retrieval time is 7 times faster than general execution-based retrieval.Dept. of Computer Science. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1999 .Q24. Source: Masters Abstracts International, Volume: 39-02, page: 0531. Adviser: Young Gil Park. Thesis (M.Sc.)--University of Windsor (Canada), 2000.
Qiang, June Xuejun., "Organizing imperative programs for execution-based retrieval for reuse." (2000). Electronic Theses and Dissertations. 2966.