Issue No. 06 - December (1995 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.476498
<p><it>Abstract</it>—In this paper, 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 <it>Pv-table</it> which is an extension of the relational model. A value set corresponds to a finite set of <it>possible</it> values in which exactly one value is the <it>true</it> value. By variable sets, tuples may be related with certain relationships, namely <it>disjunctive relationship</it> and <it>join relationship</it>. Three kinds of tuple sets are classified according to these relationships, each possesses an important property, namely <it>co-exist, co-nonempty</it>, or <it>co-instance</it>. 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.</p>
Incomplete information, disjunctive information, partial values, query language semantics, tuple relationships, relational databases.
Jui-Shang Chiu, Arbee L.P. Chen, "An Exploration of Relationships Among Exclusive Disjunctive Data", IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 928-940, December 1995, doi:10.1109/69.476498