search
Log In
24 votes
4.7k views

Which one of the following statements about normal forms is $\text{FALSE}?$

  1. $\text{BCNF}$ is stricter than $3NF$

  2. Lossless, dependency-preserving decomposition into $3NF$ is always possible

  3. Lossless, dependency-preserving decomposition into $\text{BCNF}$ is always possible

  4. Any relation with two attributes is in $\text{BCNF}$

in Databases
edited by
4.7k views

5 Answers

30 votes
 
Best answer
option $C$

edited by
7

why dependency preserving decomposition into 3NF is always possible?

I found that indeed it is true that a dependency preserving, lossless join decomposition into 3NF is always possible. here is link. (2nd point)

1
but, option (c) is about BCNF, which is not true always in case of BCNF
0
How option D is true?
6 votes
option (d)

It is true . If there are only 2 attributes then relation is always in bcnf.

let R(A B) possible cases are:

(1) {A->B } here A is cand key so BCNF

(2) {B->A}  here B is cand key so BCNF

(3) { A->B  B->A} here A and B both are cand key so BCNF

​​​​​​​(4) no non-trivial FD's here AB is cand key so BCNF
2 votes

As the FALSE statement is asked, therefore, Option C

It is not always possible  to have a dependency preserving BCNF decomposition. 

For example. this 3NF relation cant be transformed into BCNF

AB –> C, C –> B

Regarding other options, it is always possible to have a 3NF or lesser normalization to be lossless and dependency preserving.

2 votes

If relation is in 3NF then both lossless and dependency preserving are Guaranteed

and If relation is in BCNF lossless is Guaranteed but dependency preserving is Not Guaranteed.

So, clearly option (C) is false. 

0 votes
If relation is in 3NF then both lossless and dependency preserving are guaranteed

and If relation is in BCNF lossless is guaranteed but dependency preserving is not guaranteed.

Hence option C is false
Answer:

Related questions

17 votes
2 answers
1
3k views
Consider a relation scheme $R = (A, B, C, D, E, H)$ on which the following functional dependencies hold: {$A \rightarrow B$, $BC \rightarrow D$, $E \rightarrow C$, $D \rightarrow A$}. What are the candidate keys R? $AE, BE$ $AE, BE, DE$ $AEH, BEH, BCH$ $AEH, BEH, DEH$
asked Sep 22, 2014 in Databases Kathleen 3k views
3 votes
1 answer
2
1.2k views
The relation schemas $R_1$ and $R_2$ form a Lossless join decomposition of $R$ if and only if $R_1 \cap R_2 \twoheadrightarrow (R_1-R_2)$ $R_1 \rightarrow R_2$ $R_1 \cap R_2 \twoheadrightarrow (R_2-R_1)$ $R_2 \rightarrow R_1 \cap R_2$ a and b happen a and d happen a and c happen b and c happen
asked Jul 31, 2016 in Databases jothee 1.2k views
4 votes
2 answers
3
1.3k views
The Relation Vendor Order (V_no, V_ord_no, V_name, Qty_sup, unit_price) is in 2NF because Non_key attribute V_name is dependent on V_no which is part of composite key Non_key attribute V_name is dependent on Qty_sup Key attribute Qty_sup is dependent on primary key unit_price Key attribute V_ord_no is dependent on primary key unit_price
asked Jul 31, 2016 in Databases jothee 1.3k views
48 votes
6 answers
4
11.3k views
The relation book (title,price) contains the titles and prices of different books. Assuming that no two books have the same price, what does the following SQL query list? select title from book as B where (select count(*) from book as T where T.price ... four most expensive books Title of the fifth most inexpensive book Title of the fifth most expensive book Titles of the five most expensive books
asked Sep 22, 2014 in Databases Kathleen 11.3k views
...