Partition semantics for relations
Journal of Computer and System Sciences
The partition model: a deductive database model
ACM Transactions on Database Systems (TODS)
Answering queries on embedded-complete database schemes
Journal of the ACM (JACM)
A new basis for the weak instance model
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Lecture notes in computer science on ICDT '88
Data manipulation languages for the universal relation view DURST
Proceedings on Mathematical Fundamentals of Database Systems on MFDBS 87
Database states and their tableaux
ACM Transactions on Database Systems (TODS)
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
A characterization of globally consistent databases and their correct access paths
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
Updating a relational database through a universal schema interface
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Efficient query answering in the representative instance approach
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of Database Systems
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
'Universal' Relation Fails to Replace Relational Model
IEEE Software
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
Efficient updates to independent schemes in the weak instance model
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Regular Article: The nested universal relation data model
Proceedings of the 30th IEEE symposium on Foundations of computer science
A Partition Model Approach to Updating Universal Scheme Interfaces
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
Database updates have recently received much more attention than in the past. In this trend, a solid foundation is provided to the problem of updating databases through interfaces based on the weak instance model. Insertions and deletions of tuples are considered.As a preliminary tool, a lattice on states is defined, based on the information content of the various states.Potential results of an insertion are states that contain at least the information in the original state and that in the new tuple. Sometimes there is no potential result, and in the other cases there may be many of them. We argue that the insertion is deterministic if the state that contains the information common to all the potential results (the greatest lower bound, in the lattice framework) is itself a potential result. Effective characterizations for the various cases exist. A symmetric approach is followed for deletions, with fewer cases, since there are always potential results; determinism is characterized consequently.