• edited by
3,413 views
1 1 vote
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

1 Answer

0 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
Position:
Show:

Related questions

0 0 votes
2 2 answers
348
348 views
Syntax-error asked Dec 5, 2025
348 views
2nf decomposition remove all partial dependencies.3Nf decomposition remove all transitive dependencies. are these statements correct?
1 1 vote
1 1 answer
691
691 views
Akash_Banik asked Oct 28, 2024
691 views
why is prime->prime dependency doesn't violates 2nf . say table(a,b,c,d,e) and {(a,b),(d,e)} are candidates key and there is a relation from a->d. does it follow function...
1 1 vote
1 1 answer
668
668 views
Milli asked Oct 21, 2024
668 views
For R(ABCDE), given candidate keys are ABC, ACD.Now if given FD is ABD->E then what is the highest normal form?ABD is not a super key/ candidate key or E is prime so it's...