retagged by
3,495 views
4 votes
4 votes

Which one of the following statements are not correct?

$S1$: $3$NF decomposition is always lossless join and dependency preserving.

$S2$: $3$NF decomposition is always lossless join but may or may not be dependency preserving.

$S3$: BCNF decomposition is always lossless join and dependency preserving.

$S4$: BCNF decomposition is always lossless join but may or may not be dependency preserving.

  1. Only $S1$
  2. Only $S4$
  3. Both $S1$ and $S4$
  4. Both $S2$ and $S3$
retagged by

5 Answers

2 votes
2 votes
There will always be a decomposition to 3NF which is lossless and dependency preserving, For BCNF one such decomposition will always be there which is lossless but dependency preserving isn't guaranteed.

So S2 and S3 is wrong. Hence D is correct.
1 votes
1 votes
→ Sometimes, BCNF may not be functional dependency preserving.
→ lossless join should be compulsory in any normal form.
1 votes
1 votes

$\text{3NF vs BCNF:}$
Consider the functional dependency$: A \rightarrow B$
Condition for $\text{3NF:}$
The $A$ is Super key (or) $B$ is a prime attribute.
Condition for $\text{BCNF:}$
The $A$ should be Super key whether $B$ is prime or non-prime attribute.

  • $\text{3NF}$ decomposition is always lossless join and dependency preserving.
  • $\text{BCNF}$ decomposition is always lossless join but may or may not be dependency preserving.

So, the correct answer is $(D).$ 

Answer:

Related questions

3 votes
3 votes
2 answers
1
0 votes
0 votes
4 answers
2
admin asked Mar 30, 2020
5,029 views
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
3 votes
3 votes
4 answers
3
admin asked Mar 30, 2020
3,820 views
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NFBCN...