
Mark Last
A scalable algorithm for one-to-one, onto, and partial schema matching with uninterpreted column names and column values
In this paper, the authors propose a five-step approach to the problem of identifying semantic correspondences between attributes of two database schemas. It is one of the key challenges in many database applications such as data integration and data warehousing. The authors' research is focused on uninterpreted schema matching, where the column names and column values are uninterpreted or unreliable. The approach implements Bayesian networks, Pearson's correlation and mutual information to identify inter-attribute dependencies. Additionally, the authors propose an extension to their algorithm that allows the user to manually enter the known mappings to improve the automated matching results. The five-step approach also allows data privacy preservation. The authors' evaluation experiments show that the proposed approach enhances the current set of schema matching techniques.
| Publication language | English |
| Pages | 1-16 |
| Journal | Journal of Database Management |
| Volume | 25 |
| Issue number | 4 |
| Publication status | Published - 01.10.2014 |