Generic Schema Matching with Cupid

DMCA

Generic Schema Matching with Cupid (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Jayant Madhavan , Philip Bernstein , Erhard Rahm

Venue:	In The VLDB Journal
Citations:	604 - 17 self

BibTeX

@INPROCEEDINGS{Madhavan01genericschema,
    author = {Jayant Madhavan and Philip Bernstein and Erhard Rahm},
    title = {Generic Schema Matching with Cupid},
    booktitle = {In The VLDB Journal},
    year = {2001},
    pages = {49--58}
}

OpenURL

Abstract

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.

Keyphrases

generic schema matching schema element new algorithm particular data model structural matching critical step data type leaf structure schema integration xml message mapping integrated use experimental result rich range schema content resides past approach schema structure data warehouse loading many application past solution schema matching context-dependent matching

DMCA