Abstract |
: |
In today’s world software are used everywhere i.e. every electronic devices use software. So there is a large demand of software but in the same proportion the development is not growing. It is similar to the supply demand problem of management. Hence there is need to resolve this issue. There is a need to find some alternate methods that can help in improvement of this development. Some methods may be like software reuse, develop common software that can be used by various users simultaneously. In software reuse we use the design, code, architecture etc. Software reuse has become of much interest in the software community due to its potential benefits, cost benefit, time saving, etc. which include increased product quality and decreased product development cost and estimated schedule. To select a component for reuse is becoming difficult, because before reusing there is need to retrieve the component from the repository. Repository having a large in size and there are thousands no. of component. Before retrieving a component there is need to search the relevant component as there are many components with approximate same name, same functionality etc. which make the searching of component very time consuming. Hence there is need of a new technique which makes the selection of component efficient and fast. For this purpose, we proposed a scheme for the searching of component using suffix tree, suffix tree is a way to maintain the component repository in well maintained way and result an efficient and fast searching, which will be more efficient than earlier schemes. |