Authors: Maamar Khater; Salah-Eddine Habibeche; Mimoun Malki
Addresses: Computer Science Department, Tahar Moulay University, Algeria ' Computer Science Department, Tahar Moulay University, Algeria ' Computer Science Department, Tahar Moulay University, Algeria
Abstract: Service discovery is the process of retrieving the service most similar to the query based on the description of functional and/or non-functional semantics. The matchmaking based only on service profile (inputs/outputs) is not sufficient in the case of composite services. To overcome profile matching limitations, we propose an approach-based subgraph isomorphism to check the matching of process structure between two OWL-S process models of composite services and shortest path (OWLS-SP) to compute the score of matching between nodes of service and query (atomic services).
Keywords: composite web services; OWL-S; matchmaking; subgraph isomorphism; shortest path; information systems; service discovery; semantics; composite services; atomic services.
International Journal of Business Information Systems, 2017 Vol.25 No.1, pp.55 - 70
Available online: 16 Mar 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article