An algebraic framework for schema matching

Abstract

It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms. First, based on universal algebra, we propose a meta-meta structure for schema. This definition has a distinctive feature: it is able to describe any particular style of schemas, and transforms a schema and other matching information into a finite structure over specific signature. Then, we formulize SMP as a schema homomorphism problem, and prove that SMP is equivalent to finding a semantic homomorphism from one schema to another. These results lead to the main contribution of this paper: an algebraic framework for SMP. Thirdly, we show a classification of schema matching based on the algebraic framework. © Springer-Verlag Berlin Heidelberg 2005.