Abstract

We solve the service composition problem with plugin semantic matching in a graph database. We present a Prejoined Service Network (PJSN) approach which firstly constructs and stores a service composition network with all services and compositions in a graph database. Then, this approach fetches a satisfying solution by converting the composition request into Cypher and querying the graph database. We evaluate the performance of the proposed PJSN approach by conducting experiments and comparing with that of the Pre-joined Semantic Indexing Graph (PJSIG) method. The experiment results show that compared with the PJSIG method, the proposed approach can always find a solution and lead to higher user’s satisfaction.