An Application of Bitwise-Based Indexing to Web Service Composition and Verification

Huỳnh Tấn Khải, B. H. Thắng, Q. T. Tho
{"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.
位索引在Web服务组合与验证中的应用
如今,web服务的出现被认为是一项带来在线B2B(企业对企业)和B2C(企业对客户)应用程序操作革命的技术。然而,用户对web服务的需求是多样而复杂的。在大多数情况下,简单的web服务无法满足用户需求。因此,web服务的组合(或web服务组合- WSC)是必不可少的。当存储库中的web服务数量增加时,组合问题的计算成本也会显著增加。组合过程的性能取决于我们在存储库中组织web服务的方式。索引是数据挖掘领域的一种技术,它可以帮助我们对web服务进行组织和优化检索。在本文中,我们提出了一种基于位的索引机制,用于快速定位合适的web服务。该方法在包含数千个web服务的真实数据集上实现并证明了其有效性。因此,性能有了显著的提高,特别是与同一领域的其他现有工程相比。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信