| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Chiu,Jui-Shang;Chen,Arbee L.P. | en_US |
| dc.date (日期) | 1995-12 | en_US |
| dc.date.accessioned | 28-八月-2014 10:15:18 (UTC+8) | - |
| dc.date.available | 28-八月-2014 10:15:18 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-八月-2014 10:15:18 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69384 | - |
| dc.description.abstract (摘要) | We elaborate on how to interpret the query answer on exclusive disjunctive databases and how to reduce the query answer into a more concise form. Exclusive disjunctive data are represented as a pair of value set and variable set in Pv-table which is an extension of the relational model. A value set corresponds to a finite set of possible values in which exactly one value is the true value. 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, or 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 | en_US |
| dc.format.extent | 1392069 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | IEEE Transactions on Knowledge and Data Engineering (EI,SCI),928-940 | en_US |
| dc.subject (關鍵詞) | Incomplete information; disjunctive information;partial values;query language semantics;tuple relationships;relational databases | en_US |
| dc.title (題名) | An exploration of relationships among exclusive disjunctive data | en_US |
| dc.type (資料類型) | article | en |
