Normalization

Question

consider a relation R(ABCDE) with FD's={A->BC, CD->E, B->D,E->A}.

How many minimum relations require to decompose into BCNF with dependency preservation and lossless join decomposition?

Comments

i think it can't be minimized further

---

Sorry, actually $E\to A, A\to E$.So, both $E$ and $A$ are candidate keys in $ABCE$. So, 3 should be the answer as you told first.

---

yes! that's where i was confused :p Thanks anyway!

Answer 1

B-->D violeting the bcnf so make

R1= {B,D}

R2={A,B,C,E}

but here CD-->E is lost..

R2={A,B,C,E}

R3={C,D,E}

So I think 3 relations are needed...

Comments

R(ABCE)

A->BC,E->A

here key is{E} but BCNF DECOMPOSITION IS NOT POSSIBLE .

Answer 2

Dependency preservation can not possible although we can decompose in BCNF & lossless join but when we try to preserve dependency relation will not be BCNF