Relations

Question

Consider the following relational schema $R(ABCDEFG)$ with $FD$ set $\{AB → C, BC → A, AC → B, B → D, D → E\}$. The minimum relations required to decompose $R$ into $BCNF$ which satisfy lossless join and dependency preserving decomposition is ________.

Comments

I did a mistake, the answer should be 4 only, and their explanation is correct.

In my previous comment relation R1(ABCFG) isn't in BCNF. because the keys are {ABFG, BCFG, ACFG} and FDs doesn't satisfy the BCNF condition.

So as per the FDs a new relation is required that could be either (ABFG) or (BCFG) or (ACFG).

So, the relations are ABC, ABFG, BD, DE.

---

Ohh yes got it

---

Can you please post the solution explaining in a detailed manner? I am not getting it