The partition model: a deductive database model
ACM Transactions on Database Systems (TODS)
Partition semantics for incomplete information in relational databases
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Updating databases in the weak instance model
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approaches to updates over weak instances
MFDBS 89 Proceedings of the second symposium on Mathematical fundamentals of database systems
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Partition semantics for relations
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
Introducing Negative Information in Relational Databases
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Implementing Queries and Updates on Universal Scheme Interfaces
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Theory of Relational Databases
Theory of Relational Databases
Hi-index | 0.00 |
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.