Non-redundant web services composition based on a two-phase algorithm

Performance formula‐based optimal deployments of multilevel indices for service retrieval

“…One is that their storage structures are related with users' requirements, the other is that they are independent of requirements. The former method is to construct a structure after receiving users' requirements, such as previous studies, while the latter is to insert a new service into a structure when the service is registered, such as previous studies …”

“…Kwon et al and Kwon and Lee use link index to store services. Oh et al use state node network to store services.…”

“…As mentioned above, there are few works studying service storage structure as an independent system. There are only some service composition works 3,8,[12][13][14][15][16][17][18][19][20][21][22][23] that propose storage structure to support their composition methods. These proposed methods are generally classified into two categories.…”

“…The former method is to construct a structure after receiving users' requirements, such as previous studies, 3,8,[17][18][19][20][21][22] while the latter is to insert a new service into a structure when the service is registered, such as previous studies. [12][13][14][15][16]23 A composition method proposed by Tang et al 17 would scan all the registered services in a service repository to construct a structure according to a user's requirement. Another composition method proposed by Wu and Khoury 19 creates a tree to represent all possible composition solutions according to a user's requirement, which also needs to scan all services in a repository.…”

RDBMS for service repository and composition

“…Most of the existing algorithms [3][4][5][6]7,9,11,12] for service composition construct chains of services based on exact matches of input/output parameters to satisfy a given query.However,the making of a chain fails at a point when inputs of a succeeding(I S ) service does not match exactly with the outputs (O P ) of a preceeding service.Here the proposed approach alleviate this problem by making match criteria flexible.In addition to exact match we allow partial as well as super match for conditions O P ⊂ I S and O P ⊃ I S respectively.Partial match is of our interest and here we have shown the possibility of successful service composition by collaboration of services that make only partial matches.In case of traditional matching following exact match criteria we would not have ever discovered possible compositions satisfying user requirements.…”