A Schema Matching Method Based on Substring Operations
Zhang Ling · Computer Engineering and Science · 2007
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 algorithm to deduce the correct sequence of concatenations of column substrings,introduce the algorithm along with examples,and examine its real performance.