Towards a novel approach of structural schema matching

Modern enterprise system landscapes leverage heterogeneous applications. In order to launch and maintain communication, matching the schema of these diverse applications is of key importance. Since the manual matching of schemas is time-consuming and error prone, only the application of automated schema matchers constitute a viable solution to this problem. Several solutions are available to solve this problem, but an unwelcome common characteristic of them is that their accuracy may become mediocre under certain conditions; consequently an expensive follow-on human correctional step cannot be omitted. We would like to improve the performance of schema matchers so as to reduce costs. In this paper, we present our new schema matching solution, which is based on a unique structural matching approach which takes into account the similarity of neighboring nodes. Our schema matcher also makes use of our related terms set comparison approach, which we have separately tested and later integrated into a complex hybrid schema matcher.