|
|
|
|
||||
|
||||
Reconciling Equational Heterogeneity Within a Data FederationAykut FiratMassachusetts Institute of Technology (MIT) - Sloan School of Management Stuart MadnickMassachusetts Institute of Technology (MIT) - Sloan School of Management Michael SiegelMassachusetts Institute of Technology (MIT) - Sloan School of Management Benjamin GrosofMassachusetts Institute of Technology (MIT) - Sloan School of Management Frank ManolaIndependent 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.
Number of Pages in PDF File: 26 Keywords: Federated DBs, Logic programming, Heterogeneous information, Mediators and Wrappers working papers seriesDate posted: September 23, 2009Suggested CitationContact Information
|
|
||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo8 in 0.625 seconds
