3.8k views
Consider table R(A,B,C,D,E) with FDs as A->B, BC->E and ED-> A. The table is in which normal form? Justify your answer.
asked | 3.8k views

First step: Identify the candidate keys. Candidate keys must be able to determine all other attributes. Most of the time they can be found by just looking at the FDs. Here,

EDC is a candidate key so are ACD and BCD.

Now, just check for the conditions of each normal form.

We can see A->B.
ACD is the candidate key and A is a partial key. But B is a prime-attribute (part of a candidate key). Hence, this is not a partial functional dependency.

Similarly in BC->E and ED->A, E and A are prime-attributes and hence both are not partial functional dependencies. Hence R is in 2NF.

Now 3NF states that every non-prime attribute must be dependent on the candidate key. In the given functional dependencies, all dependent attributes are prime-attributes and hence it is trivially in 3NF.

Now BCNF requires that for every FD $\alpha -> \beta$, $\alpha$ must be a super key (candidate key or its superset). This condition is violated by all the 3 FDs given and hence R is not in BCNF.

So, 3NF is the highest normal form table can be in.
answered by Boss (18.3k points)
selected
0
Sir, apart from EDC and ACD, BCD is also a candidate key.

But in the book answer it is written that
R is in 3NF because B, E and A are all parts of keys.
R is not in BCNF because none of A, BC and ED contain a key.

I didn't understand the concept of this answer. Can u plz explain.
0
Sorry. I missed that. That takes R to 3NF. I have modified my answer. You can check it.
0
which book is this from?
+1 vote
3NF.....
answered by Active (2.6k points)

1
2