Resolving web services mismatch in mashup

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.