Given
a relation R and a set of FDs F, dependency preservation states that the
closure of the union of the projection
of F on each decomposed relation Ri is equal to the closure of F. i.e.,
((PR1(F)) U … U (PRn(F)))+
= F+
if
decomposition is not dependency preserving, then some dependency is lost in the
decomposition.
No comments:
Post a Comment