Graph-Based Semantic Web Service Composition for Healthcare Data Integration

Abstract

Within the numerous and heterogeneous web services offered through different sources, automatic web services composition is the most convenient method for building complex business processes that permit invocation of multiple existing atomic services. The current solutions in functional web services composition lack autonomous queries of semantic matches within the parameters of web services, which are necessary in the composition of large-scale related services. In this paper, we propose a graph-based Semantic Web Services composition system consisting of two subsystems: management time and run time. The management-time subsystem is responsible for dependency graph preparation in which a dependency graph of related services is generated automatically according to the proposed semantic matchmaking rules. The run-time subsystem is responsible for discovering the potential web services and nonredundant web services composition of a user's query using a graph-based searching algorithm. The proposed approach was applied to healthcare data integration in different health organizations and was evaluated according to two aspects: execution time measurement and correctness measurement.

Automatic Web Service Composition for SaaS Business Intelligence

“…In the first case presented in this paper, as shown in Fig. 1 [11]. A similar method was also proposed by F. Zhang, Q. Zeng, H. Duan, and C. Liu [12], but the weakness of this concept is also the same as those proposed by [11].…”

“…Some concepts about business processes have also been proposed by previous authors, namely, R. Sarno, W. W. Ayu, A. N. Fajrin, D. Manfaat, M. S. Arif, and I. Baihaqi [13], C. S. Wahyuni, K. R. Sungkono, and R. Sarno [14], and K. R. Sungkono, U. E. N. Rochmah, and R. Sarno [15]. The weakness of these concepts is the same as the weakness of the method proposed by [11,12].…”

“…Several workflows can be combined to more complex workflows. Web service composition can be done using existing tools such as Business Process Execution Language (BPEL) Designer Project [3], Business Process Model and Notation (BPMN) [4], and several other methods that have been proposed by previous authors [5][6][7][8][9][10][11][12][13][14][15][16][17].…”

“…To resolve the branched-search problem several authors have proposed methods. N. Arch-int, S. Arch-int, S. Sonsilphong, and P. Wanchai [11] proposed a graph-based method that can overcome the problem well. However, it cannot overcome more complex branched-search problems, i.e.…”

“…1 [11]. A similar method was also proposed by F. Zhang, Q. Zeng, H. Duan, and C. Liu [12], but the weakness of this concept is also the same as those proposed by [11]. Some concepts about business processes have also been proposed by previous authors, namely, R. Sarno, W. W. Ayu, A. N. Fajrin, D. Manfaat, M. S. Arif, and I. Baihaqi [13], C. S. Wahyuni, K. R. Sungkono, and R. Sarno [14], and K. R. Sungkono, U. E. N. Rochmah, and R. Sarno [15].…”