The Interaction Between Schema Matching and Record Matching in Data Integration
The Interaction Between Schema Matching and Record Matching in Data Integration
复制标题
DOI：
10.1109/tkde.2016.2611577
复制
发表时间：
2017
影响因子：
8.9
通讯作者：
Binbin Gu;Zhixu Li;Xiangliang Zhang;An Liu;Guanfeng Liu;Kai Zheng;Lei Zhao;Xiaofang Zhou
中科院分区：
文献类型：
--
作者：
Binbin Gu;Zhixu Li;Xiangliang Zhang;An Liu;Guanfeng Liu;Kai Zheng;Lei Zhao;Xiaofang Zhou
Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work, we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration. To this end, we define novel matching rules for SM and RM, respectively, that is, every SM decision is made based on intermediate RM results, and vice versa, such that SM and RM can be performed alternately. The quality of integration is guaranteed by a Matching Likelihood Estimation model and the control of semantic drift, which prevent the effect of mismatch magnification. To reduce the computational cost, we design an index structure based on q-grams and a greedy search algorithm that can reduce around 90 percent overhead of the interaction. Extensive experiments on three data collections show that the combination and interaction between SM and RM significantly outperforms previous works that conduct SM and RM separately.
