Making sense of top-k matchings: a unified match graph for schema matching

Abstract

Schema matching in uncertain environments faces several challenges, among them the identification of complex correspondences. In this paper, we present a method to address this challenge based on top-k matchings, i.e., a set of matchings comprising only 1: 1 correspondences derived by common matchers. We propose the unified top-k match graph and define a clustering problem for it. The obtained attribute clusters are analysed to derive complex correspondences. Our experimental evaluation shows that our approach is able to identify a significant share of complex correspondences.

DOI: 10.1145/2331801.2331807

5 Figures and Tables

Cite this paper

@inproceedings{Gal2012MakingSO, title={Making sense of top-k matchings: a unified match graph for schema matching}, author={Avigdor Gal and Tomer Sagi and Matthias Weidlich and Eliezer Levy and Victor Shafran and Zolt225n Mikl243s and Nguyen Quoc Viet Hung}, booktitle={IIWeb '12}, year={2012} }