Rank Aggregation for Automatic Schema Matching
- 5 March 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 19 (4), 538-553
- https://doi.org/10.1109/tkde.2007.1010
Abstract
Schema matching is a basic operation of data integration, and several tools for automating it have been proposed and evaluated in the database community. Research in this area reveals that there is no single schema matcher that is guaranteed to succeed in finding a good mapping for all possible domains and, thus, an ensemble of schema matchers should be considered. In this paper, we introduce schema metamatching, a general framework for composing an arbitrary ensemble of schema matchers and generating a list of best ranked schema mappings. Informally, schema metamatching stands for computing a "consensus" ranking of alternative mappings between two schemata, given the "individual" graded rankings provided by several schema matchers. We introduce several algorithms for this problem, varying from adaptations of some standard techniques for general quantitative rank aggregation to novel techniques specific to the problem of schema matching, and to combinations of both. We provide a formal analysis of the applicability and relative performance of these algorithms and evaluate them empirically on a set of real-world schemataKeywords
This publication has 28 references indexed in Scilit:
- A composite approach to automating direct and indirect schema mappingsInformation Systems, 2006
- A framework for modeling and evaluating automatic semantic reconciliationThe VLDB Journal, 2005
- On the Cardinality of Schema MatchingLecture Notes in Computer Science, 2005
- Introduction to the special issue on semantic integrationACM SIGMOD Record, 2004
- Optimal aggregation algorithms for middlewareJournal of Computer and System Sciences, 2003
- Comparing Top k ListsSIAM Journal on Discrete Mathematics, 2003
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001
- The Semantic WebScientific American, 2001
- The Clio projectACM SIGMOD Record, 2001
- K best solutions to combinatorial optimization problemsAnnals of Operations Research, 1985