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.