{"title":"An Application of Bitwise-Based Indexing to Web Service Composition and Verification","authors":"Huỳnh Tấn Khải, B. H. Thắng, Q. T. Tho","doi":"10.1109/ACOMP.2016.017","DOIUrl":null,"url":null,"abstract":"Nowadays, advent of web service is considered as a technology bringing a revolution operations of online B2B (Business to Business) and B2C (Business to Customer) applications. However, the user requirement for web services is diverse and complex. In most cases, a simple web service cannot meet the user requirement. Therefore, the composition of web services (or Web Service Composition - WSC) is set out as an indispensable. When the number of web services in repository increase, the computational cost of composition problem also increases significantly. The performance of composition process depends on the way we organize web services in the repository. Indexing is a technique of data mining field which can help us organize the web services and retrieve them optimally. In this paper, we proposed a bitwise-based indexing mechanism for fast location of suitable web services. This approach is implemented and proved its effectiveness over the real datasets with thousands of web services. As a result, significant improvement of performance has been made, especially as compared to other existing works in the same field.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Computing and Applications (ACOMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACOMP.2016.017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Nowadays, advent of web service is considered as a technology bringing a revolution operations of online B2B (Business to Business) and B2C (Business to Customer) applications. However, the user requirement for web services is diverse and complex. In most cases, a simple web service cannot meet the user requirement. Therefore, the composition of web services (or Web Service Composition - WSC) is set out as an indispensable. When the number of web services in repository increase, the computational cost of composition problem also increases significantly. The performance of composition process depends on the way we organize web services in the repository. Indexing is a technique of data mining field which can help us organize the web services and retrieve them optimally. In this paper, we proposed a bitwise-based indexing mechanism for fast location of suitable web services. This approach is implemented and proved its effectiveness over the real datasets with thousands of web services. As a result, significant improvement of performance has been made, especially as compared to other existing works in the same field.