Solutions to a complete web service discovery and composition

Mohammad A. Makhzan*, Kwei Jay Lin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


With the increasing number of web services and growingr demand for web service oriented computing, it is necessary to develop fast algorithms that could take a service requirement, and through compositional search of UDDI registered web services, find a cost effective (in terms of length of service response, total cost of composed services, minimal length of services, amount of space used for composition discovery) result. This paper describes two approaches for syntactic search, one for discovery of web services, without chaining, and the second one for the compositional chaining of web services with a front-to-end DAG based search approach. The assumption is that a user provides a XMLfile stating his required output and set of inputs, and the algorithm is supposed to identify one or a chain of services that does the job.

Original languageEnglish
Title of host publicationProceedings - CEC/EEE 2006
Subtitle of host publicationJoint Conference - 8th IEEE International Conference on E-Commerce and Technology (CEC 2006), 3rd IEEE International Conference on Enterprise Computing, E-Commerce
StatePublished - 2006
Externally publishedYes
EventCEC/EEE 2006 Joint Conferences - San Francisco, CA, United States
Duration: 26 06 200629 06 2006

Publication series

NameCEC/EEE 2006 Joint Conferences


ConferenceCEC/EEE 2006 Joint Conferences
Country/TerritoryUnited States
CitySan Francisco, CA


Dive into the research topics of 'Solutions to a complete web service discovery and composition'. Together they form a unique fingerprint.

Cite this