A series of normal form tests can be carried out on individual relation schemas so that the relational database can be normalized to any desired degree.

This means that the values of the Y component of a tuple in r depend on, or are determined by, the values of the X component

The database normalization process is divided into

First Normal Form [1NF] Every column of a table should contain only atomic values. An atomic value is a value that cannot be divided further.

database is said to be in first normal form if it satisfies the following conditions:

1NF should not contain repeating columns.

Second Normal Form (2NF) is based on the concept of

Second Normal Form applies to relations with Only Single keys

Second Normal Form applies to relations with composite keys, that is, relations with a primary key composed of two or more attributes.

A relation with a single-attribute primary key is automatically in at least 2NF.

If the proper subset of candidate key determines non-prime attribute, it is called Full dependency.

A relation that is in First Normal Form and every non-primary-key attribute is fully functionally dependent on the primary key, then the relation is in

AB -> C (جايه في الامتحان بكره ان شاء الله)

If the following functional dependencies in relation R (A, B, C, D ) , AB -> C , BC -> D

Third Normal Form [3NF] A relation that is in First and Second Normal Form and in which no non-primary-key attribute is transitively dependent on the primary key,

If A->B and B->C are two FDs then A->C is called transitive dependency.

The normalization of 2NF relations to 3NF involves the

If a transitive dependency exists, we remove the transitively dependent attribute(s) from the relation by placing the attribute(s) in a new relation along with a copy of the determinant.

2NF is considered adequate for normal relational