Lossless_join_decomposition
In database design, a lossless join decomposition is a decomposition of a relation into relations 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.[1] Lossless join can also be called nonadditive.[2]
This article may need to be rewritten to comply with Wikipedia's quality standards. (July 2014) |