161 views
2 votes
2 votes

suppose a relation R(ABCDE)  and some FD are there like  A->B,  C->D  

so to decompose it what i do is :  suppose left side  (A here not superkey {man lia)  ) what i do is i will find A+ = AB  

then  from AB i leave A and  I  cancel   B from R(ABCDE)  giving me two table  R1(AB) AND R2(ACDE)

but here https://gateoverflow.in/168294/bcnf-decomposition   my method is failing  if i follow same approach then i will get  table BC not ABC  

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
hitendra singh asked Nov 3, 2018
224 views
If a relation R is 3 NF and atmost one compound candidate key [remaining candidate keys are simple ]then R is :-A:-also in BCNFB:-not BCNFC:-may not BCNFD:-none
0 votes
0 votes
2 answers
2
mehul vaidya asked Jul 2, 2018
374 views
Does BCNF completely eliminate redundancy?
1 votes
1 votes
0 answers
4
Palash Moon asked Jul 25, 2017
254 views
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?