Synonyms
Attribute or value correspondence
Definition
Schema matching is the problem of finding potential associations between elements (most often attributes or relations) of two schemas. Given two schemas S1 and S2, a solution to the schema matching problem, called a schema matching (or more often a matching), is a set of matches. A match associates a schema element (or a set of schema elements) in S1 to (a set of) schema elements in S2. Research in this area focuses primarily on the development of algorithms for the discovery of matchings. Existing algorithms are often distinguished by the information they use during this discovery. Common types of information used include the schema dictionaries and structures, the corresponding schema instances (if available), external tools like thesauri or ontologies, or combinations of these techniques. Matchings can be used as input to schema mappings algorithms, which discover the semantic relationship between two schemas.
Historical...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Batini C, Lenzerini M, Navathe SB. A comparative analysis of methodologies for database schema integration. ACM Comput Surv. 1986;18(4):323–64.
Bernstein PA, Halevy AY, Pottinger RA. A vision for management of complex models. ACM SIGMOD Rec. 2000;29(4):55–63.
Dhamankar R, Lee Y, Doan A, Halevy A, Domingos P. iMap: discovering complex semantic matches between database schemas. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2004.
Do H, Rahm E. Coma – a system for flexible combination of schema matching approaches. In: Proceedings of the 28th International Conference on Very Large Data Bases; 2002. p. 610–21.
Kang J, Naughton JF. On schema matching with opaque column names and data values. In: Proceedings of the ACM SIGMOD International Conference on Management of Data; 2003. p. 205–16.
Madhavan J, Bernstein PA, Rahm E. Generic schema matching with cupid. In: Proceedings of the 27th International Conference on Very Large Data Bases; 2001. p. 49–58.
Melnik S, Garcia-Molina H, Rahm E. Similarity flooding: a versatile graph matching algorithm. In: Proceedings of the 18th International Conference on Data Engineering; 2002. p. 117–28.
Miller RJ, Haas LM, Hernández MA. Schema matching as query discovery. In: Proceedings of the 26th International Conference on Very Large Data Bases; 2000. p. 77–88.
Rahm E, Bernstein PA. A survey of approaches to automatic schema matching. VLDB J. 1994;10(4):334–50.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Kementsietsidis, A. (2018). Schema Matching. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_962
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_962
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering