A simplied universal relation assumption and its properties
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
Testing satisfaction of functional dependencies
Journal of the ACM (JACM)
A relational model of data for large shared data banks
Communications of the ACM
Can we use the universal instance assumption without using nulls?
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Notions of dependency satisfaction
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Notions of dependency satisfaction
Journal of the ACM (JACM) - The MIT Press scientific computation series
Formal limits on the automatic generation and maintenance of integrity constraints
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Properties and update semantics of consistent views
ACM Transactions on Database Systems (TODS)
Functional dependencies on cyclic database schemes
SIGMOD '83 Proceedings of the 1983 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
| Hi-index | 0.01 |
We propose and investigate the notion of separability to capture the design goal of independently updatable decompositions. As evidence in favor of separability as a natural concept of independence, we show that it is equivalent to a specialization of the abstract independent mappings defined by Bancilhon and SpyraLos. We then enaracterize separable schemes in the important case when the only constraints given are a set of functional dependencies and the join dependency for the database scheme. This characterization is also applicable to dependency preserving database schemes when a set of functional dependencies is given as constraint. Our characterization yields a polynomial-time algorithm for testing separability in these cases.