Web service schema matching based on invocation instance duplicates

Wang Ke, Ou Wei-jie, Zeng Cheng, Li De-yi, Peng Zhi-yong
{"title":"Web service schema matching based on invocation instance duplicates","authors":"Wang Ke, Ou Wei-jie, Zeng Cheng, Li De-yi, Peng Zhi-yong","doi":"10.1109/NWESP.2011.6088210","DOIUrl":null,"url":null,"abstract":"Web service schema matching is the preliminary phase of service composition and service Mashup. With the entry of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and Mashup. Furthermore, the composition and Mashup candidates must be confirmed by manual work which is very inefficient and even inefficacious. In this work, we present an approach for web service schema matching based on service invocation instance duplicates. This approach predicts the schema relationship between web service parameters based on duplicates among invocation data sets and is very different from the syntactical-based and semantic-based matching approaches. It can be used for predicting and verifying service composition and Mashup candidates.","PeriodicalId":271670,"journal":{"name":"2011 7th International Conference on Next Generation Web Services Practices","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 7th International Conference on Next Generation Web Services Practices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NWESP.2011.6088210","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Web service schema matching is the preliminary phase of service composition and service Mashup. With the entry of large numbers of services on the Internet, it will be difficult to find and suggest the most relevant service candidates for new composition and Mashup. Furthermore, the composition and Mashup candidates must be confirmed by manual work which is very inefficient and even inefficacious. In this work, we present an approach for web service schema matching based on service invocation instance duplicates. This approach predicts the schema relationship between web service parameters based on duplicates among invocation data sets and is very different from the syntactical-based and semantic-based matching approaches. It can be used for predicting and verifying service composition and Mashup candidates.
基于调用实例重复的Web服务模式匹配
Web服务模式匹配是服务组合和服务Mashup的初级阶段。随着互联网上大量服务的进入,为新的组合和Mashup找到并建议最相关的服务候选将变得非常困难。此外,组合和Mashup候选必须通过手工工作来确认,这是非常低效的,甚至是无效的。在这项工作中,我们提出了一种基于服务调用实例重复的web服务模式匹配方法。这种方法基于调用数据集之间的重复来预测web服务参数之间的模式关系,与基于语法和基于语义的匹配方法有很大不同。它可用于预测和验证服务组合和Mashup候选。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信