Why is Schema Matching Tough and What Can We Do About It?

Authors: 
Avigdor Gal
Author: 
Avigdor Gal,
Year: 
2007
Venue: 
Sigmod Record
Citations: 
55
Citations range: 
50 - 99
AttachmentSize
qhm.pdf250.79 KB

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.