A compressed graph representation for services composition
by Jing Li; Yuhong Yan; Ming Zhu
International Journal of Web and Grid Services (IJWGS), Vol. 14, No. 3, 2018

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.

Online publication date: Mon, 25-Jun-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Web and Grid Services (IJWGS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com