论文信息 - Mining schema matching between heterogeneous databases

Mining schema matching between heterogeneous databases

Schema matching plays a key role in heterogeneous data sources integration which can find out semantic correspondences between elements of two schemas. In this paper, a schema matching algorithm named HDSM is proposed. It can discover both 1:1 and complex matches, and find mappings between opaque columns. Experiments prove that HDSM can not only discover matches between heterogeneous databases roundly, but also enhance the efficiency and precision of schema matching.

Fang Zhang | Wei Chen | Huiling Guo | Xuefei Liu | Xiaowei Pu

[1] Jeffrey F. Naughton,et al. On schema matching with opaque column names and data values , 2003, SIGMOD '03.

[2] Erhard Rahm,et al. Generic Schema Matching with Cupid , 2001, VLDB.

[3] Silvana Castano,et al. ARTEMIS: Analysis and Reconciliation Tool Environment for Multiple Information Sources , 1999, SEBD.

[4] Erhard Rahm,et al. Rondo: a programming platform for generic model management , 2003, SIGMOD '03.

[5] Laura M. Haas,et al. The Clio project: managing heterogeneity , 2001, SGMD.

[6] AnHai Doan,et al. iMAP: Discovering Complex Mappings between Database Schemas. , 2004, SIGMOD 2004.

[7] Wei Chen,et al. An improved schema matching algorithm of opaque database schemas , 2011, 2011 International Conference on Multimedia Technology.

[8] Erhard Rahm,et al. A survey of approaches to automatic schema matching , 2001, The VLDB Journal.

[9] Erhard Rahm,et al. COMA - A System for Flexible Combination of Schema Matching Approaches , 2002, VLDB.

[10] Erhard Rahm,et al. Similarity flooding: a versatile graph matching algorithm and its application to schema matching , 2002, Proceedings 18th International Conference on Data Engineering.