The Community for Technology Leaders
Green Image
Issue No. 10 - October (2008 vol. 20)
ISSN: 1041-4347
pp: 1393-1407
Jaewoo Kang , Korea University, Seoul
Jeffrey F. Naughton , University of Wisconsin, Madison
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have been proposed. Most of the existing solutions mainly rely upon textual similarity of the data to be matched. However, 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 our previous work [36] we proposed a two-step technique to address this problem. In the first step, we measure the dependencies between attributes within tables using an information-theoretic measure and construct a dependency graph for each table capturing the dependencies among attributes. In the second step, we find matching node pairs across the dependency graphs by running a graph matching algorithm. In our previous work, we experimentally validated the accuracy of the approach. One remaining challenge is the computational complexity of the graph matching problem in the second step. In this paper we extend the previous work by improving the second phase of the algorithm incorporating efficient approximation algorithms into the framework.
Database integration, Schema and subschema

J. F. Naughton and J. Kang, "Schema Matching Using Interattribute Dependencies," in IEEE Transactions on Knowledge & Data Engineering, vol. 20, no. , pp. 1393-1407, 2008.
90 ms
(Ver 3.3 (11022016))