Schema matching method based on information unit

被引：0

作者：

Du, Xiao-Kun ^{[1
]}

Li, Guo-Hui ^{[2
]}

Wang, Jiang-Qing ^{[1
]}

Tie, Jun ^{[1
]}

Li, Yan-Hong ^{[1
]}

机构：

[1] College of Computer Science, South-Central University for Nationalities, Wuhan

[2] School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan

来源：

Ruan Jian Xue Bao/Journal of Software | 2015年 / 26卷 / 10期

关键词：

Information unit matching; Schema matching; Structure information; Structure optimization;

D O I：

10.13328/j.cnki.jos.004798

中图分类号：

学科分类号：

摘要：

Structure information is one of the most important types of auxiliary information in schema matching. When a schema has multiple elements with same semantics, the structure information is the most effective information to get correct matching for these elements. This is especially important in big-scale schema. Existing schema matching methods have some weaknesses such as inaccurate structure information, lack of effective description form, and high time complexity in the utilization of structure information therefore greatly hindering the use of structure information. In order to fully use the structure information, a new schema matching method based on information unit(IU_Based) is proposed in this paper. In IU_Based, the elements are first grouped in different information units according to the entity described. Then, the similarity between information units is calculated and the matching relation between information units is obtained based on the similarity. Finally, the matching between elements is selected from the matched information units. Extensive simulation experiments are conducted and the results show that IU_Based method can solve the problems in the use of structure information and take full advantage of structure information to improve the accuracy of match result. © Copyright 2015, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

引用

页码：2596 / 2613

页数：17

共 22 条

[1]

Rahm E., Bernstein P.A., A survey of approaches to automatic schema matching, VLDB Journal, 10, 4, pp. 334-350, (2001)

[2]

Bernstein P.A., Madhavan J., Rahm E., Generic schema matching, ten years later, Proc. of the VLDB Endowment, 4, 11, pp. 695-701, (2011)

[3]

Madhavan J., Bernstein P.A., Rahm E., Generic schema matching with Cupid, Proc. of the VLDB, pp. 49-58, (2001)

[4]

Li W.S., Clifton C., SEMINT: A tool for identifying attribute correspondences in heterogeneous databases using neural networks, Data & Knowledge Engineering, 33, 1, pp. 49-84, (2000)

[5]

Li G.H., Du X.K., Du J.Q., A structure matching method based on partial functional dependencies, Chinese Journal of Computers, 33, 2, pp. 240-250, (2010)

[6]

Bilke A., Naumann F., Schema matching using duplicates, Proc. of the 21st Int'l Conf. on Data Engineering, pp. 69-80, (2005)

[7]

Melnik S., Garcia-Molina H., Rahm E., Similarity flooding: A versatile graph matching algorithm and its application to schema matching, Proc. of the 18th Int'l Conf. on Data Engineering, pp. 117-128, (2002)

[8]

Shen D.R., Yu E.Y., Zhang X., Kou Y., Nie T.Z., Yu G., SKM: A schema matching model based on schema structure and known matching knowledge, Ruan Jian Xue Bao/Journal of Software, 20, 2, pp. 327-338, (2009)

[9]

Elmeleegy H., Elmagarmid A., Lee J., Leveraging query logs for schema mapping generation in U-MAP, Proc. of the 2011 ACM SIGMOD Int'l Conf. on Management of Data, pp. 121-132, (2011)

[10]

Ding G., Dong H., Wang G., Appearance-Order-Based schema matching, Database Systems for Advanced Applications, pp. 79-94, (2012)

← 1 2 3 →