TY - GEN
T1 - A fast method to find solution for service composition
AU - Huang, Yan
AU - Wang, Xiaoling
AU - Zhou, Aoying
PY - 2008
Y1 - 2008
N2 - Web service has emerged as a new solution for enterprise application integration. Automatic service composite algorithm is to build a composite service for user's request or complex business requirement. Most former work uses the dependence among services, however the relationship is often complicated and the composition algorithm is time consuming. This paper proposes a type based service composition algorithm, which can calculate a feasible solution in linear time. We conduct a series of experiments with real dataset and generated data. The experimental results demonstrate the efficiency of proposed method.
AB - Web service has emerged as a new solution for enterprise application integration. Automatic service composite algorithm is to build a composite service for user's request or complex business requirement. Most former work uses the dependence among services, however the relationship is often complicated and the composition algorithm is time consuming. This paper proposes a type based service composition algorithm, which can calculate a feasible solution in linear time. We conduct a series of experiments with real dataset and generated data. The experimental results demonstrate the efficiency of proposed method.
UR - https://www.scopus.com/pages/publications/57749188889
U2 - 10.1109/ICWS.2008.92
DO - 10.1109/ICWS.2008.92
M3 - 会议稿件
AN - SCOPUS:57749188889
SN - 9780769533100
T3 - Proceedings of the IEEE International Conference on Web Services, ICWS 2008
SP - 771
EP - 772
BT - Proceedings of the IEEE International Conference on Web Services, ICWS 2008
T2 - IEEE International Conference on Web Services, ICWS 2008
Y2 - 23 September 2008 through 26 September 2008
ER -