question archive Let R(A,B,C,D,E) be a relation schema, and let F = {A → BC,CD → AE,ABD → CD, CE → AD} be a set of functional dependencies
Let R(A,B,C,D,E) be a relation schema, and let F = {A → BC,CD → AE,ABD → CD, CE → AD} be a set of functional dependencies
Subject:Computer SciencePrice: Bought3
Let R(A,B,C,D,E) be a relation schema, and let F = {A → BC,CD → AE,ABD → CD, CE → AD} be a set of functional dependencies. Decompose R into 3NF by using the 3NF synthesis algorithm. Show all steps and argue precisely. Is this decomposition also in BCNF? If so, why? If not, explain the reasons and decompose into BCNF.
