Definition
A schema mapping (or mapping) is a triple \({\cal M}\) = (S 1, S 2, Σ), where S 1 and S 2 are relational schemas with no relation symbols in common and Σ is a set of formulas of some logical formalism over (S 1, S 2). An instance of \({\cal M}\) is a pair (I, J) where I is an instance of S 1 and J is an instance of S 2 such that (I, J) satisfies every formula in the set Σ. The set of all instances of \({\cal M}\) is denoted as Inst(\({\cal M}\)).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Beeri C. and Vardi M.Y. A Proof Procedure for Data Dependencies. J. ACM, 31(4):718–741, 1984.
Bernstein P.A., Green T.J., Melnik S., and Nash A. Implementing Mapping Composition. In Proc. 32nd Int. Conf. on Very Large Data Bases, 2006, pp. 55–66.
Bernstein P.A., Halevy A.Y., and Pottinger R. A Vision of Management of Complex Models. ACM SIGMOD Rec., 29(4):55–63,2000.
Dessloch S., Hernández M., Wisnesky R., Radwan A., and Zhou J. Orchid: Integrating Schema Mapping and ETL. In Proc. 24th Int. Conf. on Data Engineering, 2008, pp. 1307–1316.
Fagin R. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, R.M. Karp (ed.), 1974, pp. 43–73.
Fagin R. 2007. Inverting Schema Mappings. ACM Trans. Database Syst., 32(4):24,
Fagin R., Kolaitis P.G., Miller R.J., and Popa L. Data Exchange: Semantics and Query Answering. Theoretical Computer Science, 336(1):89–124, 2005.
Fagin R., Kolaitis P.G., Popa L., and Tan W.C. Composing Schema Mappings: Second-Order Dependencies to the Rescue. ACM Trans. Database Syst., 30(4):994–1055, 2005.
Lenzerini M. Data Integration: A Theoretical Perspective. In Proc. 21st ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 2002, pp. 233–246.
Madhavan J. and Halevy A.Y. Composing Mappings Among Data Sources. In Proc. 29th Int. Conf. on Very Large Data Bases, 2003, pp. 572–583.
Maier D., Mendelzon A.O., and Sagiv Y. Testing Implications of Data Dependencies. ACM Trans. Database Syst., 4(4):455–469, 1979.
Nash A., Bernstein P.A., and Melnik S. 2007. Composition of Mappings Given by Embedded Dependencies. ACM Trans. Database Syst., 32(1):4,
Popa L., Velegrakis Y., Miller R.J., Hernández M.A., and Fagin R. Translating Web Data. In Proc. 28th Int. Conf. on Very Large Data Bases, 2002, pp. 598–609.
Yu C. and Popa L. Semantic Adaptation of Schema Mappings when Schemas Evolve. In Proc. 31st Int. Conf. on Very Large Data Bases, 2005, pp. 1006–1017.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Tan, WC. (2009). Schema Mapping Composition. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_1467
Download citation
DOI: https://doi.org/10.1007/978-0-387-39940-9_1467
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35544-3
Online ISBN: 978-0-387-39940-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering