Explain with example why BCNF is stricter than 3NF?
Answers
Answered by
7
3NF is the Third normal form used in relational database normalization. According to the Codd’s definition, a table is said to be in 3NF, if and only if, that table is in the second normal form (2NF), and every attribute in the table that do not belong to a candidate key should directly depend on every candidate key of that table.
BCNF (also known as 3.5NF) is another normal form used in relational database normalization. It was introduced to capture some the anomalies that are not addressed by the 3NF. A table is said to be in BCNF, if and only if, for each of the dependencies of the form A → B that are non-trivial, A is a super-key.

BCNF (also known as 3.5NF) is another normal form used in relational database normalization. It was introduced to capture some the anomalies that are not addressed by the 3NF. A table is said to be in BCNF, if and only if, for each of the dependencies of the form A → B that are non-trivial, A is a super-key.

Answered by
13
"1. BCNF is a normal form used in database normalization.
2. 3NF is the third normal form used in database normalization.
3. BCNF is stricter than 3NF because each and every BCNF is relation to 3NF but every 3NF is not relation to BCNF.
4. BCNF non-transitionally depends on individual candidate key but there is no such requirement in 3NF.
5. Hence BCNF is stricter than 3NF.
"
Similar questions