Finitely Specifiable Implicational Dependency Families
Journal of the ACM (JACM)
The structure of the relational database model
The structure of the relational database model
Relational database theory
Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On interpretations of relational languages and solutions to the implied constraint problem
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
Minimum Covers in Relational Database Model
Journal of the ACM (JACM)
Introductory Combinatorics
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Foundations of Canonical Update Support for Closed Database Views
ICDT '90 Proceedings of the Third International Conference on Database Theory
The impact of the constant complement approach towards view updating
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the computation of relational view complements
ACM Transactions on Database Systems (TODS)
An Order-Based Theory of Updates for Closed Database Views
Annals of Mathematics and Artificial Intelligence
Theory of Relational Databases
Theory of Relational Databases
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Relational lenses: a language for updatable views
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Independent components of databases
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Characterization of optimal complements of database views defined by projection
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Hi-index | 0.00 |
The constant-complement strategy, in which the admissible updates to a given view are those which hold a second complementary view constant, remains one of the most attractive formalisms for identifying suitable translation mechanisms for updates to views of database schemata. However, in general, it suffers from the drawback that the reflections of view updates to the main schema can depend upon the choice of complement in various ways. To overcome this drawback completely, a special kind of complement, called a universal complement, is required. In this paper, sufficient conditions for the existence of such a complement are established for a classical but nevertheless very important setting -- views defined by simple projection of a universal relational schema constrained by functional dependencies (FDs). Certain uniqueness properties of covers of these dependencies prove critical in the characterization. The results are extended to quasi-universal complements, which are unique up to exchange of equivalent attributes, thus recapturing certain situations for which unique covers do not exist.