Extended Uddi-based Web Services Match

With the growing number of Web Services,the web is moving from being a collection of pages toward a collection of services that interoperate through the Internet.The Web provide all kinds of .A fundamental step toward this interoperation is the ability of locating services. This needs Matching Engine to find services that satisfy request. Matching is very important in Web Services.Current matching technology of Web Services is based on UDDI, which does not make any use of semantic information, the matching is based on key words and syntactic,it can not distinguish the information with the same syntactic and differentit semantic,it also can not distinguish the information with the same semantic and differentit syntactic.So it does not match the request with the capabilities. UDDI does not make any use of composition,it can not compose single services into complex services.So it obviously don't fulfill the requirements for the automatic discovery and composition of web service.The Semantic Web markup language can be used to describe the semantics of Web services and make them computer-interpretable entities,so as to enable programs or agents to locate, matching and compose Web services automatically, thus the problem of web service discovery can be transformed into the semantic based reasoning process, and then we can exploit the advantages of the KM domain. The semantic based discovery directly supports the automated composition of web service. the base semantic web languages RDF and OWL has become the recommendation of W3C; other web service-oriented languages such as DAML-S, OWL-S try to describe Web Services semantics from ontology perspective.So it is possible to matching service based on its capabilities.We presents a semantic enhanced UDDI Web Services matching framework based on the Semantic Web and Web Services. We adopt OWL-S to describe the capabilities of Web Services, then we can have capability-based matching, the result of matching can be excellent. On the other hand , a new challenge of Web Services is services should be able to interoperate to compose automatically complex services .So we presents a matching algorithm through compose of Semantic Web Services basedon the matching framework. First we find a single service in publish database to satisfy request,if not succeed,for a given private Semantic Web Services publish database,we have proposed a advertisement graph to be constructed.This graph represents the semantic relationship among all advertised services,and every edge have degree of semantic matching as a weight,we use the shortest path graph algorithm to find the best service.This dissertation focuses on the Semantic Web services composition and aims to develop a technology which can automatically and flexibly compose various existing services to fulfill users' tasks according to their requirements, thus realize so-called service on demand.