A Survey of Approaches to Automatic Schema Matching

DMCA

A Survey of Approaches to Automatic Schema Matching (2001)

Cached

Download Links

Other Repositories/Bibliography

CiteULike
DBLP

by Erhard Rahm , Philip A. Bernstein

Venue:	VLDB JOURNAL
Citations:	1351 - 51 self

BibTeX

@ARTICLE{Rahm01asurvey,
    author = {Erhard Rahm and Philip A. Bernstein},
    title = {A Survey of Approaches to Automatic Schema Matching},
    journal = {VLDB JOURNAL},
    year = {2001},
    volume = {10},
    pages = {2001}
}

OpenURL

Abstract

Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level and instance-level, element-level and structure-level, and language-based and constraint-based matchers. Based on our classification we review some previous match implementations thereby indicating which part of the solution space they cover. We intend our taxonomy and review of past work to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.

Keyphrases

automatic schema matching schema matching constraint-based matcher past work previous match implementation basic problem partial automation new match algorithm specific application domain different approach many technique schema matching component match operation semantic query processing solution space many database application domain data warehousing data integration current implementation previous research paper significant limitation

DMCA