1,896 views
2 2 votes
Consider a relation R(A,B,C,D,E,F,H) with A as the only key. Assume that the dependencies E->F and C-> DEH hold.on R.

1. Is R in 2NF? If not, decompose to 2NF.

2. is R in 3NF? if not, decompose to 3NF.

//What does " with A as the only key" mean ?

2 Answers

1 1 vote
R is in 2NF. It is NOT in 3NF. 3NF decomposition : ABC, CDEH, EF

A is the only candidate means that there are no other candidate keys.
0 0 votes
R(ABCDEFH) { E → F, C → DEH}

here, Candidate key will be {ABC}.   So, C –> DEH is a partial functional dependency. So, its not in 2NF.

2NF decomposition will be: R1(CDEHF), R2(ABC)

 

Also, since its not in 2NF. so its also not in 3NF.

For 3NF decomposition will be: R1(EF), R2(CDEH), R3(ABC)
Position:
Show:

Related questions

3 3 votes
2 2 answers
5.0k
5.0k views
Parshu gate asked Nov 19, 2017
4,974 views
How is it option D??
5 5 votes
3 answers 3 answers
1.6k
1.6k views
skyby asked Jul 30, 2017
1,615 views
The Second Normal Form states that it should meet all the rules for 1NF and there must be no partial dependences of any of the columns on the primary key , so i have doub...
2 2 votes
3 3 answers
2.1k
2.1k views
admin asked Mar 31, 2020
2,052 views
Which one of the following statements about normal forms is FALSE?BCNF is stricter than $3$NF.Lossless, dependency-preserving decomposition into BCNF is always possible.L...
2 2 votes
2 2 answers
4.7k
4.7k views
aditi19 asked Apr 14, 2019
4,735 views
Decompose into BCNFR(A, B, C, D, E)FD: AB->C, C->D, D>B, D->E