{"title":"Redundant-Free Web Services Composition Based on a Two-Phase Algorithm","authors":"Joonho Kwon, Hyeonji Kim, Daewook Lee, Sukho Lee","doi":"10.1109/ICWS.2008.91","DOIUrl":null,"url":null,"abstract":"Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant Web services in the results. In this paper, we proposed a redundant-free Web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the link Index. In the backward phase, redundant-free Web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Web Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS.2008.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 22
Abstract
Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant Web services in the results. In this paper, we proposed a redundant-free Web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the link Index. In the backward phase, redundant-free Web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.