Making sense of top-k matchings: a unified match graph for schema matching
Proceedings of the Ninth International Workshop on Information Integration on the Web(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 that our approach is able to identify a significant share of complex correspondences.
更多查看译文
关键词
unified match graph,significant share,experimental evaluation,top-k matchings,attribute cluster,schema matching,complex correspondence,common matchers,unified top-k match graph,uncertain environment,clustering problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要