MatchBench: Benchmarking Schema Matching Algorithms for Schematic Correspondences

摘要

Schema matching algorithms aim to identify relationships between database schemas, which are useful in many data integration tasks. However, the results of most matching algorithms are expressed as semantically inexpressive, 1-to-1 associations between pairs of attributes or entities, rather than semantically-rich characterisations of relationships. This paper presents a benchmark for evaluating schema matching algorithms in terms of their semantic expressiveness. The definition of such semantics is based on the classification of schematic heterogeneities of Kim et al.. The benchmark explores the extent to which matching algorithms are effective at diagnosing schematic heterogeneities. The paper contributes: (ⅰ) a wide range of scenarios that are designed to systematically cover several reconcilable types of schematic heterogeneities; (ⅱ) a collection of experiments over the scenarios that can be used to investigate the effectiveness of different matching algorithms; and (ⅲ) an application of the experiments for the evaluation of matchers from three well-known and publicly available schema matching systems, namely COMA++, Similarity Flooding and Harmony.