Issue No. 02 - April (1994 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.277774
<p>The updating of relational databases has received extensive attention in the past few years. However, the various methods proposed present two main drawbacks: either the method cannot perform some update because of nondeterminism, or the method is deterministic but leads to counterintuitive results. In this paper, we use partition semantics to study updating in universal scheme interfaces. It is shown that, contrary to other approaches, the main difficulties are due to nondeterminism of deletions. We characterize when a deletion is deterministic or not, and we show how partition semantics allow for choices in certain cases of nondeterminism.</p>
relational databases; relational algebra; database theory; partition model; universal scheme interface updating; relational database updating; nondeterminism; counterintuitive results; partition semantics; deletions; universal relation; relational model; functional dependency
N. Spyratos and D. Laurent, "A Partition Model Approach to Updating Universal Scheme Interfaces," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 316-330, 1994.