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)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies
ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases
ACM Transactions on Database Systems (TODS)
Independent components of relations
ACM Transactions on Database Systems (TODS)
A relational model of data for large shared data banks
Communications of the ACM
Synthesizing independent database schemas
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Equivalence of relational database schemes
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In proving that a set of relation schemes is a lossless decomposition of a set of attributes, it is sometimes possible to derive a sequence of extension joins whlich, upon execution, computes the join of the corresponding relations. Unlike natural join, any sequence of extension joins, which are really projections followed by joins, can be computed in polynomial time. The technique is effective in the important cases of decomposition into independent components and database schemes produced by Codd's third normal form algorithm.