Formally Stating..

• Let C be a set of constraints.

• A decomposition {R1, R2, .. Rn} of a relation scheme R is a lossless join for if all relations r on schema R that are legal under C,

r = ?R1 ( r) join ?R2 ( r ) … join ?Rn ( r )

Previous slide

Next slide

Back to first slide

View graphic version