Why is schema matching tough and what can we do about it?
- 1 December 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 35 (4), 2-5
- https://doi.org/10.1145/1228268.1228269
Abstract
In this paper we analyze the problem of schema matching, explain why it is such a "tough" problem and suggest directions for handling it effectively. In particular, we present the monotonicity principle and see how it leads to the use of top- K mappings rather than a single mapping.Keywords
This publication has 12 references indexed in Scilit:
- Holistic Schema Matching for Web Query InterfacesLecture Notes in Computer Science, 2006
- Making holistic schema matching robustPublished by Association for Computing Machinery (ACM) ,2005
- A framework for modeling and evaluating automatic semantic reconciliationThe VLDB Journal, 2005
- Soundness of Schema Matching MethodsLecture Notes in Computer Science, 2005
- Schema Integration Based on Uncertain Semantic MappingsLecture Notes in Computer Science, 2005
- On the Cardinality of Schema MatchingLecture Notes in Computer Science, 2005
- A survey of approaches to automatic schema matchingThe VLDB Journal, 2001
- Data Integration Is Harder than You ThoughtLecture Notes in Computer Science, 2001
- The Semantic WebScientific American, 2001
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968