Open Access Open Access  Restricted Access Subscription Access

Parallel Optimization for Data-Intensive Service Composition

Shui-Guang Deng,
Long-Tao Huang,
Bin Wu,
Li-Rong Xiong,


The age of Big Data has inspired the appearance and application of data-intensive Web service. In most cases, multiple data-intensive services are assembled into a service composition to meet complicated requirements. As the number of Data-intensive Web services on the Internet is increasing rapidly and dramatically, traditional central service composition approaches have come to a performance bottleneck. This paper proposes a method for automatic data-intensive service composition, which can be executed in parallel. Firstly, the problem of automatic service composition is defined by combing the approaches of State Space Search and Planning Graph. Then, a heuristic algorithm is proposed to compose data-intensive Web service automatically. After that, more details are given to present the parallel optimization for the composition algorithm. A series of experiments show that the proposed parallel optimization method improves the efficiency of automatic Web service composition to a great extent.


Data-intensive service; Service composition; Prallel optimization

Citation Format:
Shui-Guang Deng, Long-Tao Huang, Bin Wu, Li-Rong Xiong, "Parallel Optimization for Data-Intensive Service Composition," Journal of Internet Technology, vol. 14, no. 5 , pp. 817-824, Sep. 2013.

Full Text:



  • There are currently no refbacks.

Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314  E-mail: