Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7
DBMS
SUBJECT: NORMALISATION First Normal Form (1NF)
A relation will be 1NF if it contains an atomic value.
It states that an attribute of a table cannot hold multiple
values. It must hold only single-valued attribute.
First normal form disallows the multi-valued attribute,
composite attribute, and their combinations. Second Normal Form (2NF)
In the 2NF, relational must be in 1NF.
In the second normal form, all non-key attributes are
fully functional dependent on the primary key Third Normal Form (3NF)
A relation will be in 3NF if it is in 2NF and not contain any transitive
partial dependency.
3NF is used to reduce the data duplication. It is also used to achieve the data integrity.
If there is no transitive dependency for non-prime attributes, then the
relation must be in third normal form.
A relation is in third normal form if it holds atleast one of the following
conditions for every non-trivial function dependency X → Y. X is a super key. Y is a prime attribute, i.e., each element of Y is part of some candidate key. Boyce Codd normal form (BCNF)
BCNF is the advance version of 3NF. It is stricter than
3NF. A table is in BCNF if every functional dependency
X → Y, X is the super key of the table.
For BCNF, the table should be in 3NF, and for every
FD, LHS is super key. Fourth normal form (4NF)
A relation will be in 4NF if it is in Boyce Codd normal
form and has no multi-valued dependency.
For a dependency A → B, if for a single value of A,
multiple values of B exists, then the relation will be a multi-valued dependency. Fifth normal form (5NF)
A relation is in 5NF if it is in 4NF and not contains any
join dependency and joining should be lossless. 5NF is satisfied when all the tables are broken into as
many tables as possible in order to avoid redundancy.