Normalization , Functional Dependency


Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is

A. Zero
B. More than zero but less than that of an equivalent 3NF decomposition
C. Proportional to the size of F+
D. Indeterminate

Please explain with a suitable.


If a relational schema is in BCNF then all redundancy based on functional dependency has been removed, although other types of redundancy may still exist.

A relational schema R is in Boyce–Codd normal form if and only if for every one of its
dependencies X → Y, at least one of the following conditions hold:

X → Y is a trivial functional dependency (Y ⊆ X)
X is a super key for schema R


Also look at the link below:


Please provide exact and brief answer .


Please refer to this link, and look at the example you will understand