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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.