normLIZATION

Question

Consider the following statements:
1. The redundancy in the set of relation that have been arised after decomposing a relation R into BCNF is zero irrespective of the type of dependencies.
2. BCNF decompositions are always lossless as well as dependency preserving.
3. A prime attribute of a relation schema R is an attribute that appears in all candidate key of R.
4. A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R.
The number of statements are correct _______.

WHAT IS DIFFERENCE  BETWEEN TRANSITIVE DEOENDENCY AND FULLY FUNCTIONAL DEPENDENCY??

Comments

Transitive dependency is expressing the dependency of A on C when A depends on B and B depends on C. A functional dependency is an association between two attributes of the same relational database table. One of the attributes is called the determinant and the other attribute is called the determined. For each value of the determinant there is associated one and only one value of the determined.