A compressed graph representation for services composition. (2018)

• Record Type: Journal Article
• Authors: Li, Jing; Yan, Yuhong; Zhu, Ming
• Is Part Of: International journal of web and grid services. Volume 14:Number 3(2018)
• Page Start: 305
• Page End: 331
• Publication Date: 2018
• Subjects: WSC -- web service composition -- QoS optimisation -- graph compression; Web services -- Periodicals; Computational grids (Computer systems) -- Periodicals; 006.78
• Languages: English
• ISSNs: 1741-1106

Abstract

Service-oriented computing enhances business scalability and flexibility. Providers who expect to benefit from it may bring the explosive growth of web services. As a result, the huge storage required in searching a composition solution may be too much to afford. In this paper, we apply a compressed data structure to tackle this challenging issue. We propose a system model to solves web service composition (WSC) problem. In this model, we use a compressed tree to represent the search graph. This work innovatively solve the composition problem with compressed graph representation. The proposed model is verified through theoretical analysis and experimental study. The obtained experimental results show that this system may handle a large number of web services with small space requirement.