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.
- 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
- 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.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.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.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