A Survey of Approaches to Automatic Schema Matching-英文文献.pdfVIP

The VLDB Journal 10: 334–350 (2001) / Digital Object Identifier (DOI) 10.1007/s007780100057 A survey of approaches to automatic schema matching 1 2 Erhard Rahm , Philip A. Bernstein 1 Universit¨at Leipzig, Institut f¨ur Informatik, 04109 Leipzig, Germany; (e-mail: rahm@informatik.uni-leipzig.de) 2 Microsoft Research, Redmond, WA 98052-6399, USA; (e-mail: philbe@) Edited by P. Scheuermann. Received: 5 February 2001 / A epted: 6 September 2001 Published online: 21 November 2001 – Springer-Verlag 2001 Abstract. Schema matching is a basi cproblem in many applications, their schemas become larger, further increasing database application domains, such as data integration, E- the number of matches to be performed. The level of effort business, data warehousing, and semanti cquery processing. is at least linear in the number of matches to be performed, In current implementations, schema matching is typically per- maybe worse than linear if one needs to evaluate each match in formed manually, which has significant limitations. On the the context of other possible matches of the same elements. A other hand, previous research papers have proposed many faster and less labor-intensive integration approach is needed. techniques to achieve a partial automation of the match op- This requires automated support for schema matching. eration for specifi capplication domains. We present a taxon- To provide this automated support, we would like to see omy that covers many of these existing approaches, and we a generic, customizable implementation of Match that is us- describe the approaches in some detail. In particular, we distin- able across application areas. This would make it easier to guish between schema-level and instance-level, element-level build applicatio