• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2007, Vol. 29 ›› Issue (10): 61-62.

• 论文 • 上一篇    下一篇

发掘数据库模式间的复杂匹配

钱颖   

  • 出版日期:2007-10-01 发布日期:2010-06-02

  • Online:2007-10-01 Published:2010-06-02

摘要:

本文提出一种新的发掘数据库模式间复杂匹配的系统构架CSM。CSM首先通过预处理从数据类型上过滤掉部分不合理的候选匹配,并利用多个具有特殊目的的检索程序分别对 选空间的特殊部分进行检索,发掘1:1和复杂匹配,针对被匹配模式中存在不透明列的问题,还可进一步应用补充匹配器找到不透明列间的匹配关系。实验表明,与其它模式匹配
方法相比,CSM不仅能全面地发掘模式间匹配,还具有较高的效率、查全率和查准率。

关键词: 模式匹配 复杂匹配 补充匹配 相似度

Abstract:

A new system of discovering the complex matches between database schemas called CSM (Complex Schema Matching) is proposed in this paper. It filters  some unreasonable candidate matches based on data types by preprocessing, and employs a set of special-purpose searchers to explore a specialized portio n of the search space, and mining the 1.1 and complex matches. According to the problem that there are opaque columns in the schemas being matched, it c an apply a complementary matcher to find the matching relations between opaque columns further more. Experiments show that CSM does not only discover th e matches between schemas completely, but also improves the efficiency, the recall rate and the precision rate compared with other schema matching methods in practice.

Key words: (schema matching, complex match, complementary matching, similarity)