链式数据结构下Web服务组合的高效算法

IEEE Asia-Pacific Services Computing Conference Pub Date : 2006-12-12 DOI:10.1109/APSCC.2006.28

Li Lian, Jun Ma, Zhumin Chen, Ling Song

{"title":"链式数据结构下Web服务组合的高效算法","authors":"Li Lian, Jun Ma, Zhumin Chen, Ling Song","doi":"10.1109/APSCC.2006.28","DOIUrl":null,"url":null,"abstract":"Automatic composition of Web services has drawn a great deal of attention recently. Current Web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among Web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log m,n)), improved the known O(n times log m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure","PeriodicalId":437766,"journal":{"name":"IEEE Asia-Pacific Services Computing Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"An Efficient Algorithm for Web Services Composition with a Chain Data Structure\",\"authors\":\"Li Lian, Jun Ma, Zhumin Chen, Ling Song\",\"doi\":\"10.1109/APSCC.2006.28\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automatic composition of Web services has drawn a great deal of attention recently. Current Web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among Web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log m,n)), improved the known O(n times log m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure\",\"PeriodicalId\":437766,\"journal\":{\"name\":\"IEEE Asia-Pacific Services Computing Conference\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Asia-Pacific Services Computing Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APSCC.2006.28\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Asia-Pacific Services Computing Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APSCC.2006.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

Web服务的自动组合最近引起了极大的关注。当前的Web服务组合算法不仅逻辑表述粗糙，而且存在效率低下或适用范围有限的问题。本文提出了一种描述Web服务之间依赖关系的Web服务链表数据结构，并基于该数据结构开发了一种高效的Web服务组合算法。新算法的时间复杂度为O(max(log m,n))，改进了已知的O(n * log m) 1，其中n为WSs的个数，m为WSs输出参数的个数。通过实验比较了不同数据结构下算法的性能

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Efficient Algorithm for Web Services Composition with a Chain Data Structure

Automatic composition of Web services has drawn a great deal of attention recently. Current Web service (WS) composition algorithms are not only logical presented in a rough way, but also existed inefficient or limited applied scope problem. In this paper a data structure called WS chain table, which describes the dependent relations among Web services, is proposed, and an efficient algorithm for WS composition is developed based on the data structure. The time complexity of the new algorithm is O(max(log m,n)), improved the known O(n times log m) one, where n is the number of WSs and m denotes the number of output parameters of WSs. Experiments are carried out in order to compare the performance of the algorithms with different data structure

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Asia-Pacific Services Computing Conference

自引率

0.00%

发文量