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

Authors:
Avigdor Gal;Tomer Sagi;Matthias Weidlich;Eliezer Levy;Victor Shafran;Zoltán Miklós;Nguyen Quoc Viet Hung
Affiliations:
Technion -- Israel Institute of Technology;Technion -- Israel Institute of Technology;Technion -- Israel Institute of Technology;SAP Research Israel;SAP Research Israel;École Polytechnique Fédérale de Lausanne;École Polytechnique Fédérale de Lausanne
Venue:
Proceedings of the Ninth International Workshop on Information Integration on the Web
Year:
2012

Citing 13
Cited 0

A comparative analysis of methodologies for database schema integration

ACM Computing Surveys (CSUR)
Schema Mapping as Query Discovery

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Generic Schema Matching with Cupid

Proceedings of the 27th International Conference on Very Large Data Bases
A survey of approaches to automatic schema matching

The VLDB Journal — The International Journal on Very Large Data Bases
Discovering Direct and Indirect Matches for Schema Elements

DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
iMAP: discovering complex semantic matches between database schemas

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Automatic complex schema matching across Web query interfaces: A correlation mining approach

ACM Transactions on Database Systems (TODS)
Ontology Matching

Ontology Matching
On Modularity Clustering

IEEE Transactions on Knowledge and Data Engineering
Matching Schemas in Online Communities: A Web 2.0 Approach

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Tuning the ensemble selection process of schema matchers

Information Systems
AMC - A framework for modelling and comparing matching systems as matching processes

ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Managing uncertainty in schema matching with top-k schema mappings

Journal on Data Semantics VI

Quantified Score

Hi-index	0.00

Visualization

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.