Abstract
Web Service Mismatch is a major aspect of web mashup problem. To reduce burden of resolving the mismatch for end-users, the approaches proposed in the literature used a mapping solution to resolve service mismatch. However, without structural information, these approaches would lead to inaccuracy. Here, we propose a structure-based data-mediation approach to improve accuracy. We model service mismatch problem as sub-tree homeomorphism problem and use approximate labelled sub-tree homeomorphism algorithm to resolve the mismatch. The paper presents a case to explain how data-mediation works and solves ambiguity caused by other approaches. We also conduct related tests to evaluate our work.
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 callDisclaimer: 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.
