499 views
0 votes
0 votes
Consider a relation R(ABCD) with FD’s {A → D, B → D, D → BC}. What is the minimum number of decomposition required to make above relation BCNF?

my doubt is what is "minimum no. of decompostion" ? is it the no. of tables in decomposed form or the no. of splits we have to do to obtain bcnf?

1 Answer

3 votes
3 votes

minimum no of tables in the decomposed form.

R={A->D,B->D,D->BC}

KEY IS {A}

decomposed into two relations R1(AD) and R2(DBC)

R1(AD)  =A->D      A ISTHE KEY.

R2(DBC) =D->BC,B->D.  (B,D ARE KEYS.)

SO THE ABOVE RELATION SATISFIES BCNF DECOMPOSITION

MINIMUM NO OF RELATIONS ARE 2

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2
1 votes
1 votes
2 answers
3
aditi19 asked Apr 14, 2019
1,839 views
Decompose into BCNFR(A, B, C, D, E)FD: AB->C, C->D, D>B, D->E
0 votes
0 votes
1 answer
4