ie.technion.ac.il

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

Authors: 
Avigdor Gal
Year: 
2007
Venue: 
Sigmod Record

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.

Measuring the Relative Performance of Schema Matchers

Authors: 
Berkovsky, S.; Eytani, Y.; Gal, A.
Year: 
2005
Venue: 
Proc. Web Intelligence Conf., 2005
Syndicate content