Testing a dependency-preserving decomposition for losslessness

摘要

It is shown that when a decomposition of a relation scheme preserves the associated set of functional dependencies, the problem of testing the decomposition for the lossless join property reduces to the problem of computing the closures of the relation schemes in the decomposition. As a consequence of this result an efficient algorithm for losslessness is proposed.