Journal of the ACM (JACM)
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
Update and retrieval in a relational database through a universal schema interface
ACM Transactions on Database Systems (TODS)
Properties and update semantics of consistent views
ACM Transactions on Database Systems (TODS)
View updates in relational databases with an independent scheme
ACM Transactions on Database Systems (TODS)
A new interpretation for Null values in the weak instance model
Journal of Computer and System Sciences
Approaches to updates over weak instances
MFDBS 89 Proceedings of the second symposium on Mathematical fundamentals of database systems
Efficient updates to independent schemes in the weak instance model
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Updating intensional predicates in Datalog
Data & Knowledge Engineering
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)
On the correct translation of update operations on 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)
Computational problems related to the design of normal form relational schemas
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions
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)
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
On the semantics of updates in databases
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On complementary and independent mappings on databases
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Optimal computation of total projections with unions of simple chase join expressions
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
'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
View updates in a semantic data modelling paradigm
ADC '01 Proceedings of the 12th Australasian database conference
View Updatability Based on the Models of a Formal Specification
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Fibrations and universal view updatability
Theoretical Computer Science
Hi-index | 0.00 |
The problem of updating databases through interfaces based on the weak instance model is studied, thus extending previous proposals that considered them only from the query point of view. 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 a potential result itself. 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 as a consequence.