Pv-table -- A Representation System for Exclusive Disjunctive Data

博士 === 國立清華大學 === 資訊科學學系 === 83 === In this dissertation, we propose an extended relational model, named Pv-table, for representing exclusive disjunctive data by associating partial values and variables with attributes. While a partial value denote...

Full description

Bibliographic Details
Main Authors: Chiu, Jui-Shang, 邱瑞山
Other Authors: Arbee L.P. Chen
Format: Others
Language:zh-TW
Published: 1995
Online Access:http://ndltd.ncl.edu.tw/handle/b5e3yy
id ndltd-TW-083NTHU0394010
record_format oai_dc
spelling ndltd-TW-083NTHU03940102019-10-12T03:34:48Z http://ndltd.ncl.edu.tw/handle/b5e3yy Pv-table -- A Representation System for Exclusive Disjunctive Data Pv-table--一種互斥型離接式資料的表示系統 Chiu, Jui-Shang 邱瑞山 博士 國立清華大學 資訊科學學系 83 In this dissertation, we propose an extended relational model, named Pv-table, for representing exclusive disjunctive data by associating partial values and variables with attributes. While a partial value denotes the set of possible values, a variable serves as an identifier for the true value of the data item. In addition, variables can be used to preserve distinctness of values, the equi- relationship of values, and dependency information in the operations. The relational operators are extended to manipulate Pv-tables. We show that the set-based query evaluation on Pv-tables is sound and complete for queries consisting of extended selection, union, intersection, Cartesian product and join. We also show that useful algebraic properties in conventional relational models are preserved in our model. These properties are not preserved for many other extended models. Pv-table is further generalized for the ability to correctly support the difference operator which is mandatory in database updates and dependency enforcement. A set of generalized relational operators is defined, so that a unified solution to queries, updates and constraint enforcement can be obtained. The semantic correctness is established. By variable sets, tuples may be related with certain relationships, namely disjunctive relationship and join relationship. Three kinds of tuple sets are classified according to these relationships; each possesses an important property, namely co-exist, co- nonempty and co-instance. Based on these properties, the interpretation of Pv-tables can be formalized in a semantically meaningful way. Also, the redundant and mergeable tuples can be identified. After removing and merging tuples accordingly, a more concise Pv-table can thus provide a better understanding of the query result. Arbee L.P. Chen 陳良弼 1995 學位論文 ; thesis 108 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 博士 === 國立清華大學 === 資訊科學學系 === 83 === In this dissertation, we propose an extended relational model, named Pv-table, for representing exclusive disjunctive data by associating partial values and variables with attributes. While a partial value denotes the set of possible values, a variable serves as an identifier for the true value of the data item. In addition, variables can be used to preserve distinctness of values, the equi- relationship of values, and dependency information in the operations. The relational operators are extended to manipulate Pv-tables. We show that the set-based query evaluation on Pv-tables is sound and complete for queries consisting of extended selection, union, intersection, Cartesian product and join. We also show that useful algebraic properties in conventional relational models are preserved in our model. These properties are not preserved for many other extended models. Pv-table is further generalized for the ability to correctly support the difference operator which is mandatory in database updates and dependency enforcement. A set of generalized relational operators is defined, so that a unified solution to queries, updates and constraint enforcement can be obtained. The semantic correctness is established. By variable sets, tuples may be related with certain relationships, namely disjunctive relationship and join relationship. Three kinds of tuple sets are classified according to these relationships; each possesses an important property, namely co-exist, co- nonempty and co-instance. Based on these properties, the interpretation of Pv-tables can be formalized in a semantically meaningful way. Also, the redundant and mergeable tuples can be identified. After removing and merging tuples accordingly, a more concise Pv-table can thus provide a better understanding of the query result.
author2 Arbee L.P. Chen
author_facet Arbee L.P. Chen
Chiu, Jui-Shang
邱瑞山
author Chiu, Jui-Shang
邱瑞山
spellingShingle Chiu, Jui-Shang
邱瑞山
Pv-table -- A Representation System for Exclusive Disjunctive Data
author_sort Chiu, Jui-Shang
title Pv-table -- A Representation System for Exclusive Disjunctive Data
title_short Pv-table -- A Representation System for Exclusive Disjunctive Data
title_full Pv-table -- A Representation System for Exclusive Disjunctive Data
title_fullStr Pv-table -- A Representation System for Exclusive Disjunctive Data
title_full_unstemmed Pv-table -- A Representation System for Exclusive Disjunctive Data
title_sort pv-table -- a representation system for exclusive disjunctive data
publishDate 1995
url http://ndltd.ncl.edu.tw/handle/b5e3yy
work_keys_str_mv AT chiujuishang pvtablearepresentationsystemforexclusivedisjunctivedata
AT qiūruìshān pvtablearepresentationsystemforexclusivedisjunctivedata
AT chiujuishang pvtableyīzhǒnghùchìxínglíjiēshìzīliàodebiǎoshìxìtǒng
AT qiūruìshān pvtableyīzhǒnghùchìxínglíjiēshìzīliàodebiǎoshìxìtǒng
_version_ 1719263778378350592