Secondly, I've looked up numerous slide shows but they don't show how to actually do a BCNF decomposition. I know it is in BCNF for. And if the slide show does show it, it is an easy example so it does not help me - Mike Dec 6 '10 at 16:50.a) BCNF is stricter than 3 NF b) Lossless, dependency -preserving decomposition into 3 NF is always possible c) Loss less, dependency – preserving decomposition into BCNF is always possible d) Any relation with two attributes is BCNF ans:c 12.

Various levels of normalization are: First Normal Form (1NF) Second Normal Form (2NF) Third Normal Form (3NF) Boyce-Codd Normal Form (BCNF) Fourth Normal Form (4NF) Fifth Normal Form (5NF) Domain Key Normal Form (DKNF) A table is considered to be in 1NF if all the fields contain only scalar values (as opposed to list of values). Note that BCNF has stricter restrictions on what FDs it allows, so any relation that is in BCNF is also in 3NF. In practice, well-designed relations are almost always in BCNF; but occasionally a non-BCNF relation is still well-designed (and is in 3NF). 7. Why decomposing into 3NF doesn't work. Decomposing a relation into 3NF leads to potential ... Boyce-Codd Normal Form (BCNF) When a table has more than one candidate key, anomalies may result even though the relation is in 3NF. Boyce-Codd normal form is a special case of 3NF. A relation is in BCNF if, and only if, every determinant is a candidate key. BCNF Example 1. Consider the following table (St_Maj_Adv).