Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Schema Matching

  • Anastasios KementsietsidisEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_962


Attribute or value correspondence


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.


This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Batini C, Lenzerini M, Navathe SB. A comparative analysis of methodologies for database schema integration. ACM Comput Surv. 1986;18(4):323–64.CrossRefGoogle Scholar
  2. 2.
    Bernstein PA, Halevy AY, Pottinger RA. A vision for management of complex models. ACM SIGMOD Rec. 2000;29(4):55–63.CrossRefGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.CrossRefGoogle Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    Rahm E, Bernstein PA. A survey of approaches to automatic schema matching. VLDB J. 1994;10(4):334–50.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.IBM T.J. Watson Research CenterHawthorneUSA

Section editors and affiliations

  • Renée J. Miller
    • 1
  1. 1.Dept. of Computer ScienceUniversity of Toronto, Department of Computer ScienceTorontoCanada