J4 ›› 2007, Vol. 29 ›› Issue (10): 57-60.
• 论文 • 上一篇 下一篇
王聪 刘国华 苑迎 张凌宇
出版日期:
发布日期:
Online:
Published:
摘要:
本文的主要目的是找到一种通用的方法来解决模式匹配中的复杂匹配问题。文中描述了一种通过在数据库中搜索和匹配列的q-grams子串来找到一个源列和目标列间对应关系 的代数表达式,从而获得匹配结果的方法。该方法的优点是不需要再附加任何额外的用于匹配的信息就可以有效地找到模式中那些复杂的匹配,并且可以处理固定和可变长度类 型的列。文章中使用了一个递归的算法来推论列的子串拼接的正确顺序,并结合一些例子介绍了这一算法,然后测试了算法的实际表现。
关键词: 模式匹配 编辑配方 匹配公式
Abstract:
The purpose of this paper is finding a common method to solve complex matching problems in schema matching. The paper describes a method for searching and matching q-grams of columns in the database to build an algebraic expression which can express how the source column relates to the target column, and from which we can get a matching result. The merits of the method are that it can find complex matching in schemas effectively and does not need any additional information about schemas, and is capable of dealing with both fixed and variable-length field columns. In the paper we use an iterative alg orithm to deduce the correct sequence of concatenations of column substrings, introduce the algorithm along with examples, and examine its real performa nce.
Key words: (schema matching, edit reeipes;matehing formulas)
王聪 刘国华 苑迎 张凌宇. 一种基于子串运算的模式匹配方法[J]. J4, 2007, 29(10): 57-60.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2007/V29/I10/57