Slides from University about Normal Forms. The Pdf provides a structured overview of the first three normal forms (1NF, 2NF, 3NF) in database management, including definitions, criteria, and visual examples of violations. This material is useful for Computer Science students at the University level.
See more12 Pages


Unlock the full PDF for free
Sign up to get full access to the document and start transforming it with AI.
A relationship is in its first normal form if it does not contain repetitive groups, that is, when it is structured as a collection of tuples and attributes A relationship is in the first normal form (1FN) when it meets the fundamental requirements of the relational model which are:
A relationship is in the second normal form (2FN) if it is in the first normal form, and all of its attributes that are not part of any key in the relationship are fully dependent on each key.
A relationship is in the third normal form (3FN) if it is in the second normal form and if each of its attributes that are not part of any key depends directly and nontransitively on each key in the relationship.
EMPLOYEE CATEGORY SALARY NERI 3 30.000 VERDI 3 30.000 ROSSI 4 50.000 MORI 4 50.000 BIANCHI 5 72.000 EMPLOYEE > CATEGORY CATEGORY ->SALARY VIOLATE THE 3NF BECAUSE CATEGORY IS NOT KEY AND SALARY IS NOT FIRST ATTRIBUTE IT'S IN 2NF BECAUSE SALARY DEPENDS ON THE KEY ALBEIT THROUGH CATEGORY! TRANSITIVE DEPENDENCE!
Employee Salary Project Budget Role Rossi 20 Marte 2 Technician Verdi 35 Giove 15 Designer Verdi 35 Venere 15 Designer Neri 55 Venere 15 Director Neri 55 Giove 15 Consultant Neri 55 Marte 2 Consultant Mori 48 Marte 2 Director Mori 48 Venere 15 Designer Bianchi 48 Venere 15 Designer Bianchi 48 Giove 15 Director Employee > Salary Project > Budget PARTIAL DEPENDENCE! VIOLATE 2NF!
NAME COURSE CODE PROFESSOR INFO COMPUTER SCIENCE 2121 MARIO ROSSI, PROFESSOR, CODE 12345 MATH ANALYSIS 3213 LUCA BIANCHI, RESEARCHER, CODE 78910 VIOLATE 1NF!
The meaning of normal forms is summarized below:
A relation is in normal Boyce-Codd form if for every existing functional dependency X->A, X is a superkey to the relation.
Normalizing is not mandatory, but:
Summarizing:
A normal form is a property of a relational schema that guarantees its "quality", i.e. the absence of certain defects:
An unnormalized relationship has redundancies and results in undesirable behavior during updates The definition of normal forms (3NF and BCNF) is based on the functional dependency constraint (FD) Normalizing a schema means decomposing it into subschemas Any decomposition must be lossless, i.e. it must allow the original non- decomposed relationship to be reconstructed exactly It is also desirable that decomposition preserves FDs.
A relation is in the normal Boyce-Codd form (BCNF) when it respects the fundamental characteristics of the relational model (1NF) and in it every determinant is a candidate key, i.e. any attribute on which other attributes depend can act as a key.
The BCNF can also be expressed as follows: if functional dependency A -> B holds in a relationship, then the set of attributes A must contain a key (and thus can act as a key).
It follows that a relationship that satisfies the NCB is also in its second and third normal form, since the BCNF excludes that a determinant may consist of only a part of the key, as is the case for violations of the 2FN or that it can be external to the key, as is the case with 3FN violations.
A relationship in BCNF is also in the third normal form, but the reverse is not true.