|
|
|
     |
                                     |
Return to Meta-Data Management
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing common domains in the data stored in the schemas. While each of these approaches is valuable in many cases, they are not infallible, and there exist instances of the schema matching problem for which they do not even apply. Such problem instances typically arise when the column names in the schemas and the data in the columns are "opaque" or very difficult to interpret. In this paper we propose a two-step technique that works even in the presence of opaque column names and data values. In the first step, we measure the pair-wise attribute correlations in the tables to be matched and construct a dependency graph using mutual information as a measure of the dependency between attributes. In the second stage, we find matching node pairs in the dependency graphs by running a graph matching algorithm. We validate our approach with an experimental study, the results of which suggest that such an approach can be a useful addition to a set of (semi) automatic schema matching techniques.
@inproceedings {DBLP:conf/sigmod/KangN03, author = {Jaewoo Kang and Jeffrey F. Naughton}, booktitle = {SIGMOD Conference}, title = {On Schema Matching with Opaque Column Names and Data Values.}, pages = {205-216}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#KangN03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r08p02.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
