Sciweavers

Share
TKDE
2008

Schema Matching Using Interattribute Dependencies

9 years 10 months ago
Schema Matching Using Interattribute Dependencies
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, 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 accur...
Jaewoo Kang, Jeffrey F. Naughton
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TKDE
Authors Jaewoo Kang, Jeffrey F. Naughton
Comments (0)
books