Generic Schema Matching With Cupid

Authors: 
Madhavan, J.; Bernstein, P. A.; Rahm, E.
Author: 
Madhavan, J
Bernstein, P
Rahm, E
Year: 
2001
Venue: 
VLDB, 2001
URL: 
http://www.research.microsoft.com/research/db/ModelMgt/CupidVLDB01.pdf
Citations: 
1476
Citations range: 
1000s
AttachmentSize
Madhavan2001GenericSchemaMatchingWith.pdf139.48 KB

Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past solutions, showing that a rich range of techniques is available. We then propose a new algorithm, Cupid, that discovers mappings between schema elements based on their names, data types, constraints, and schema structure, using a broader set of techniques than past approaches. Some of our innovations are the integrated use of linguistic and structural matching, context-dependent matching of shared types, and a bias toward leaf structure where much of the schema content resides. After describing our algorithm, we present experimental results that compare Cupid to two other schema matching systems. This is an extended version of a paper published at the 27th VLDB Conference [7].