Database Dependency Preserving closed

Question

Consider the relational schema R(A, B, C, D, E) with the following functional dependencies:

A ⟶ BC

CD ⟶ E

B ⟶ D

E ⟶ A

Is the decomposition of R into R1(A, B, C) and R2(A, D, E) dependency preserving?

I personally think the dependency B->D is not preserved but the answer states the decomposition is dependency preserving.

Correct me if I am wrong?

Comments

yes, you are right !

from R1 :- BC --> A

from R2 :-  A --> D

So, we have BC --> D but we can't get B ---> D

---

Thanks a lot.. I kept wondering what I was doing wrong

---

Anilava Kundu close the question, if doubt is cleared