A new algorithm for semantic web service matching

Considering the existing problems in Web service such as lack of semantic information and interoperability, atomic services can not cooperate with each other and be combined into composite services. In this paper, based on extended UDDI, we present a semantic annotation framework for Web service description and composition. The novel service matching algorithm not only takes into account the height factor of ontology tree and local density factor for the impact of semantic distance, but also the degree of semantic overlap. Experimental results show that the proposed service matching algorithm improved the efficiency of Web service discovery, and thus Web service can be composed easily to form more complicated inter-related services. © 2013 ACADEMY PUBLISHER.