Uncertain Schema Matching (Record no. 84926)

000 -LEADER
fixed length control field 03448nam a22004935i 4500
001 - CONTROL NUMBER
control field 978-3-031-01845-9
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163730.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2011 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031018459
-- 978-3-031-01845-9
082 04 - CLASSIFICATION NUMBER
Call Number 004.6
100 1# - AUTHOR NAME
Author Gal, Avigdor.
245 10 - TITLE STATEMENT
Title Uncertain Schema Matching
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2011.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 85 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Data Management,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Models of Uncertainty -- Modeling Uncertain Schema Matching -- Schema Matcher Ensembles -- Top-K Schema Matchings -- Applications -- Conclusions and Future Work.
520 ## - SUMMARY, ETC.
Summary, etc 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. Although schema matching research has been ongoing for over 25 years, more recently 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. 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. Table of Contents: Introduction / Models of Uncertainty / Modeling Uncertain Schema Matching / Schema Matcher Ensembles / Top-K Schema Matchings / Applications / Conclusions and Future Work.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01845-9
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2011.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer networks .
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Information theory.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data Structures and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2153-5426
912 ## -
-- ZDB-2-SXSC

No items available.