A note on lossless database decompositions (Q1060867): Difference between revisions

It is known that under a wide variety of assumptions a database decomposition is lossless if and only if the database scheme has a lossless join. \textit{J. Biskup, U. Dayal} and \textit{P. A. Bernstein} [Proc. ACM Int. Conf. Management of Data, Boston 1979, 143-151 (1979)] have shown that when the given dependencies are functional, the database scheme has a lossless join if and only if one of the relation schemes is a key for the universal scheme. In this note we supply an alternative proof of that characterization. The proof uses tools from the theory of embedded join dependencies and the theory of tuple and equality generating dependencies, but is, nevertheless, much simpler than the previously published proof.