Strategies for Efficient Syntactical and Semantic Web Services

In the future, there may be a large number of Web services available in the world. A user will want to have an efficient and effective way to identify the appropriate Web service(s) to satisfy his needs. This paper describes several strategies, including backward service discovery using set overlapping, backward service composition using breadth-first search tree, to achieve correct and efficient Web services discovery and composition based on syntactical matching. We also discuss how the algorithm is extended to perform semantic discovery and composition