made easy cbt2

Question

consider the following relational schema R(A,B,C,D,E,F,G)

AB->C,BC->A,AC->B,B->D,D->E

how many minimum relations required to decompose R into BCNF which satisfy lossless and FDP decomposition?

 

initially i got 4 relation as

R1(A,B,C)

R2(D,E)

R3(B,D)

R4(A,B,F,G)

but in R1 and R2 there is no common attribute, hence it will not be lossless??am i correct

Comments

ok ,

actually we say that to be lossless,if R is decomposed into R1 and R2; then there must be a common attribute in them.

so i thought there should be a common attribute in all relations.

---

" so shouldn’t the answer be 3?  "

what it means ?

---

i was confused at that time.

hiding it, sorry