Non-Redundant Web Services Composition Search System

The increasing number of available web services, maintaining these services and using an efficient search system to search for the ones that satisfy a given requirement have become an important issue. Hence the need to compose these web services together to achieve a new functionality that meets the different needs of end-users. Web service composition can take place among big commercial organizations or across academic institutions. This research presents a model that can be used to overcome this problem. The model, known as the Student Record Management Services (SRMS), proposed an efficient approach to search for information on a non-redundant web services composition. Using the Federal University of Technology Minna as the case study for implementation, the SRMS is a hybrid model that first of all eliminates redundant web services by grouping together web services of similar functionality. It then uses the simplified planning graph method to search for information. The graph contains all possible solutions or goals. When the SRMS receives an input, it locates a new search space at each level of the search. This makes the graph to iteratively expand itself one level at a time. This process continues until it reaches the goal (means that a solution has been found) and returns the result to the user.