Reconciling Equational Heterogeneity within a Data Federation
Author(s)Firat, Aykut; Madnick, Stuart; Siegel, Michael; Grosof, Benjamin; Manola, Frank
Mappings in most federated databases are conceptualized and implemented as black-box transformations between source schemas and a federated schema. This approach does not allow specific mappings to be declared once and reused in other situations. We present an alternative approach, in which data-level mappings are represented independent of source and federated schemas as a network between “contexts”. This compendious representation expedites the data federation process via mapping reuse and automated mapping composition from simpler mappings. We illustrate the benefits of mapping reuse and composition by using an example that incorporates equational mappings and the application of symbolic equation solving techniques.
Cambridge, MA; Alfred P. Sloan School of Management, Massachusetts Institute of Technology
MIT Sloan School of Management Working Paper;4753-09CISL Working Paper;2009-06
Federated DBs, Logic programming, Heterogeneous information, Mediators and Wrappers