|
Schema matching is the task of providing correspondences between concepts describing the
meaning of data in various heterogeneous, distributed data sources. Schema matching is one of the
basic operations required by the process of data and schema integration, and thus has great effect on
its outcomes. Schema matching research has been going on for more than 25 years now. The main
objective of schema matchers is to provide correspondences that will be effective fromthe user’s point
of view, yet computationally efficient.Over the years, a realization has emerged that schema matchers
are inherently uncertain. A matcher may consider several possible correspondences as possible, and
when it needs to choose, it may choose wrong. A prime reason for the uncertainty of the matching
process is the enormous ambiguity and heterogeneity of data description concepts: It is unrealistic to
expect a single matcher to identify the correct mapping for any possible concept in a set. Since 2003,
work on the uncertainty in schema matching has picked up (along with research on uncertainty in
other areas of data management). |
|
|
|
