A web service matching method based on fine-grained data semantics

Yanping Li

Abstract

The service discovery methods based on structure matching has high computational cost and can not distinguish the Web services with similar semantics but in different structure definitions, due to the flexibility of XML Schema. To solve this problem, a so-called fine-grained data semantics method is proposed, which can be obtained by a transformation algorithm that decomposes parameters at message level into a set of fine-grained data parameters. The fine-grained data semantics is transparent to the specific data structure of message-level parameters, therefore, it can help to match successfully similar Web services with different data structures of parameters. Experiments show that the proposed method can improve the effectiveness of service discovery