edited by
2,128 views
1 votes
1 votes
The Highest Normal Form of the Following Relation?

R(ABCDE)

FD={AB$\rightarrow$C,DE$\rightarrow$C,B$\rightarrow$D}

 

EDIT :- Decompose it into BCNF if possible
edited by

1 Answer

0 votes
0 votes
Given Relation is ABCDE ..now we have some of given FD as

FD={AB→C,DE→C,B→D} ..now we can see that on LHS only 2 attributes are there , which are  C and D , so there is no way that we can have A,B,E on LHS .

So every key must have ABE as part of it , so that we can have all attributes in the RHS

So basic minimal set is

ABE ...taking closure of it

(ABE)+=ABCDE

Now prime attributes are A,B,E but as B->D FD is there , a part of key is determining the nonkey , which is voilation of 2NF

so given relation is in 1NF only
edited by

No related questions found