Algebraic Quantum Information Theory (Synthesis Lectures on Data Management)
This lecture presents various aspects of uncertainty in schema matching within a single unified framework. We introduce basic formulations of uncertainty and provide several alternative representations of schema matching uncertainty. Then, we cover two common methods that have been proposed to deal with uncertainty in schema matching, namely ensembles and top-K matchings, and analyze them in this context. We conclude with a set of real-world applications. 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 a great effect on its outcomes, whether these involve targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, or automatic streamlining of workflow activities that involve heterogeneous data sources. Schema matching research has been going on for more than 25 years. Over the years, a significant body of work has been devoted to the identification of schema matchers, heuristics for schema matching. The main objective of schema matchers is to provide correspondences that will be effective from the user's point of view. Over the years, a realization has emerged that schema matchers are inherently uncertain. Since 2003, work on the uncertainty in schema matching has picked up, along with research on uncertainty in other areas of data management.