766 views
5 votes
5 votes
Determine the highest normal for relation R(A,B,C,D)

AB →C

BC→D

1 Answer

Best answer
7 votes
7 votes

R(A,B,C,D)
{AB →C
BC→D}
candidate keys are={AB}
AB->C..no problem here
BC->D..yes problem
BC is nt a superkey...so not in BCNF
its a transitive dependency means non prime attribute deriving non prime attribute..hence not in 3NF also
for 3NF there shouldnt be any partial dependency...which is obviously nt there..hence highest normal form possible is 2NF
(please crooss verify once i have done it a bit fast)

selected by

Related questions

1 votes
1 votes
0 answers
1
iarnav asked Nov 24, 2017
738 views
consider:T1: {A11, A12, A13} - key is A11T2: {A21, A22, A11} - key is A21T3: {A21, A23} - key is {A21 A23}T1, T2, T3 all are in which normal form? a) 2nfb) 3nfc) BCNFFUNC...
2 votes
2 votes
2 answers
3
gatecrack asked Dec 10, 2018
581 views
Is minimal set of functional dependency for a functional dependency set is always unique???
0 votes
0 votes
1 answer
4
Raghav Khajuria asked Oct 5, 2018
882 views
Difference between composite and compound key??