2NF Example
2NF Example
Solution:
First find out the candidate key of the relation.
Since AC+ = A C D B E, (closure of AC contains all the attributes of R)
So AC is candidate key in above table.
Prepared By
National Institute of Electronics & Information Technology (NIELIT), Gorakhpur
राष्ट्रीय इलेक्ट्रॉनिकी एवं सूचिा प्रौद्योनगकी संस्थाि ,गोरखपुर
Solution:
First find out the candidate key of the relation.
Since ABD+ = A B C D E F G H I J, (closure of ABD contains all the attributes of R)
So ABD is candidate key in above table.
R3 ( B D E F ) -- [BD EF ]
R3 ( A I ) -- [A I]
R3 ( A B D) -- [ ABD is candidate key ]
Prepared By
National Institute of Electronics & Information Technology (NIELIT), Gorakhpur
राष्ट्रीय इलेक्ट्रॉनिकी एवं सूचिा प्रौद्योनगकी संस्थाि ,गोरखपुर
Now R1, R2, R3, R4 and R5 are following the rules of 2NF.
[Note: Although relation R1, R2, R3 and R4 covers all the FDs, but it is necessary to keep
the attributes of candidate key of original relation together to maintain the consistency and
integrity of data, that’s why attribute ABD are kept in R5.]
Prepared By