关键词: 数据模式匹配, 非透明条件, 互信息, 无向图匹配

Abstract: As a key issue of data integration, schema matching is the core task in data merging process of heterogeneous data sources. At present, a mass of schema matching methods have been proposed. However, most of them are lack of universality since they depend on the description information of schema heavily. Therefore, it is difficult to apply these approaches to other scenarios. To solve the problem, this paper proposes a novel schema matching method which uses ordered mutual information and does not rely on any description information of schema, such as column name, column type and foreign constraints, which make it own a strong universality. Furthermore, extensive experiments on various datasets indicate that the proposed technique outperforms earlier schema matching methods in terms of efficiency and accuracy.

Key words: schema matching, opaque conditions, mutual information, undirected graph matching