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

@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}
}
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… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering • 2008
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…