|
||||
|
||||
Reconciling Equational Heterogeneity Within a Data Federation
Aykut Firat Massachusetts Institute of Technology (MIT) - Sloan School of Management Stuart Madnick Massachusetts Institute of Technology (MIT) - Sloan School of Management Michael Siegel Massachusetts Institute of Technology (MIT) - Sloan School of Management Benjamin Grosof Massachusetts Institute of Technology (MIT) - Sloan School of Management Frank Manola Independent Consultant September 23, 2009 MIT Sloan Research Paper No. 4753-09 Abstract: 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.
Keywords: Federated DBs, Logic programming, Heterogeneous information, Mediators and Wrappers Working Paper SeriesDate posted: September 23, 2009 ; Last revised: September 23, 2009Suggested CitationContact Information
|
|
|||||||||||||||||||||
© 2009 Social Science Electronic Publishing, Inc. All Rights Reserved. Terms of Use Privacy Policy
This page was served by apollo4 in 0.109 seconds.