東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Embracing Incompleteness in Schema M...

Rodriguez-Gianolli, Patricia C.

FindBook

Google Book

Amazon

博客來

Embracing Incompleteness in Schema Mappings.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Embracing Incompleteness in Schema Mappings./
作者:	Rodriguez-Gianolli, Patricia C.
面頁冊數:	153 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.
Contained By:	Dissertation Abstracts International75-06B(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NS22077
ISBN:	9780499220776

Embracing Incompleteness in Schema Mappings.
Rodriguez-Gianolli, Patricia C.

Embracing Incompleteness in Schema Mappings. - 153 p.

Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.

Thesis (Ph.D.)--University of Toronto (Canada), 2013.

Various forms of information integration have become ubiquitous in current Business Intelligence (BI) technologies. In many cases, the semantic relationship between heterogeneous data sources is specified using high-level declarative rules, called schema mappings. For decades, Skolem functions have been regarded as an important tool in schema mappings as they permit a precise representation of incomplete information. The powerful mapping language of second-order tuple generating dependencies (SO tgds) permits arbitrary Skolem functions and has been proven to be the right class for modeling many integration problems, such as composition and correlation of mappings. This language is strictly more powerful than the languages used in many integration systems, including source-to-target and nested tgds which are both first-order (FO) languages (commonly known as GLAV and nested GLAV mappings). An important class of GLAV mappings are Local-As-View (LAV) tgds, which has found important application in data integration. These FO mapping languages are known to have more desirable programmatic and computational properties. In this thesis, we present a number of techniques for translating some SO tgds into equivalent, more manageable FO schema mappings. Our results rely on understanding and controlling the presence of incompleteness in mappings. We show that the composition of LAV mappings is not only FO, but can always be expressed as a LAV mapping. As a byproduct, we show that the problem of recovery checking for LAV mappings becomes tractable, in contrast to the case of GLAV mappings for which it is known to be undecidable. We introduce two approaches for transforming SO tgds into equivalent nested GLAV mappings. Our approach considers the presence of source constraints, and provides sufficient conditions for when the rich Skolem functions in SO tgds are well-behaved and have an FO semantics. We experimentally show that these conditions are able to handle a very large number of real schema mappings. Last, we propose a first step for embracing incompleteness in the context of BI applications. Specifically, we present elements of a formal framework for vivifying data with respect to a business model. We view the task of discovering data-to-business interpretations as one of removing incompleteness from these mappings.

ISBN: 9780499220776Subjects--Topical Terms:

626642
Computer Science.

Embracing Incompleteness in Schema Mappings.
LDR:03194nam a2200277 4500 001 1960654
005 20140623111243.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9780499220776
035 $a (MiAaPQ)AAINS22077
035 $a AAINS22077
040 $a MiAaPQ $c MiAaPQ
100 1 $a Rodriguez-Gianolli, Patricia C. $3 2096351
245 1 0 $a Embracing Incompleteness in Schema Mappings.
300 $a 153 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-06(E), Section: B.
500 $a Adviser: Renee Miller.
502 $a Thesis (Ph.D.)--University of Toronto (Canada), 2013.
520 $a Various forms of information integration have become ubiquitous in current Business Intelligence (BI) technologies. In many cases, the semantic relationship between heterogeneous data sources is specified using high-level declarative rules, called schema mappings. For decades, Skolem functions have been regarded as an important tool in schema mappings as they permit a precise representation of incomplete information. The powerful mapping language of second-order tuple generating dependencies (SO tgds) permits arbitrary Skolem functions and has been proven to be the right class for modeling many integration problems, such as composition and correlation of mappings. This language is strictly more powerful than the languages used in many integration systems, including source-to-target and nested tgds which are both first-order (FO) languages (commonly known as GLAV and nested GLAV mappings). An important class of GLAV mappings are Local-As-View (LAV) tgds, which has found important application in data integration. These FO mapping languages are known to have more desirable programmatic and computational properties. In this thesis, we present a number of techniques for translating some SO tgds into equivalent, more manageable FO schema mappings. Our results rely on understanding and controlling the presence of incompleteness in mappings. We show that the composition of LAV mappings is not only FO, but can always be expressed as a LAV mapping. As a byproduct, we show that the problem of recovery checking for LAV mappings becomes tractable, in contrast to the case of GLAV mappings for which it is known to be undecidable. We introduce two approaches for transforming SO tgds into equivalent nested GLAV mappings. Our approach considers the presence of source constraints, and provides sufficient conditions for when the rich Skolem functions in SO tgds are well-behaved and have an FO semantics. We experimentally show that these conditions are able to handle a very large number of real schema mappings. Last, we propose a first step for embracing incompleteness in the context of BI applications. Specifically, we present elements of a formal framework for vivifying data with respect to a business model. We view the task of discovering data-to-business interpretations as one of removing incompleteness from these mappings.
590 $a School code: 0779.
650 4 $a Computer Science. $3 626642
650 4 $a Information Technology. $3 1030799
690 $a 0984
690 $a 0489
710 2 $a University of Toronto (Canada). $3 1017674
773 0 $t Dissertation Abstracts International $g 75-06B(E).
790 $a 0779
791 $a Ph.D.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=NS22077