Issue No. 02 - February (2010 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.69
Anuj Jaiswal , Pennsylvania State University, University Park
David J. Miller , Pennsylvania State University, University Park
Prasenjit Mitra , Pennsylvania State University, University Park
Schema matching and value mapping across two heterogenous information sources are critical tasks in applications involving data integration, data warehousing, and federation of databases. Before data can be integrated from multiple tables, the columns and the values appearing in the tables must be matched. The complexity of the problem grows quickly with the number of data attributes/columns to be matched and due to multiple semantics of data values. Traditional research has tackled schema matching and value mapping independently. We propose a novel method that optimizes embedded value mappings to enhance schema matching in the presence of opaque data values and column names. In this approach, the fitness objective for matching a pair of attributes from two schemas depends on the value mapping function for each of the two attributes. Suitable fitness objectives include the euclidean distance measure, which we use in our experimental study, as well as relative (cross) entropy. We propose a heuristic local descent optimization strategy that uses sorting and two-opt switching to jointly optimize value mappings and attribute matches. Our experiments show that our proposed technique outperforms earlier uninterpreted schema matching methods, and thus, should form a useful addition to a suite of (semi) automated tools for resolving structural heterogeneity.
Schema matching, opaque conditions, embedded schema matching with value mapping.
P. Mitra, A. Jaiswal and D. J. Miller, "Uninterpreted Schema Matching with Embedded Value Mapping under Opaque Column Names and Data Values," in IEEE Transactions on Knowledge & Data Engineering, vol. 22, no. , pp. 291-304, 2009.