lossless decomposition in dbms code example
Example: lossless join decomposition
In database design, a lossless join decomposition is a decomposition
of a relation R into relations R1 ,R2 such that a natural join of the
two smaller relations yields back the original relation.
This is central in removing redundancy safely from databases while
preserving the original data.