This article or section is not written in a generally understandable way. The shortcomings are described in Discussion:Normalization (database). If you remove this module, please justify it on the article discussion page and add {{Completed|1=~~~~}} to the automatically created project page section Wikipedia:Incomprehensible articles #Normalization (database).

Normalization of a relational data schema (table structure) means the division of attributes (table columns) into several relations (tables) according to the normalization rules (see below), so that a form is created which no longer contains redundancies.

A conceptual schema that contains data redundancies can lead to the fact that when changes are made to the database implemented with it, the data contained multiple times are not changed consistently, but only partially and incompletely, which can make them obsolete or contradictory. This is referred to as occurring anomalies. In addition, multiple storage of the same data unnecessarily occupies storage space. To prevent redundancy, such tables are normalized.

There are various degrees to which a database schema can be immune to anomalies. Depending on the degree of anomaly, a database schema is said to be in first, second, third, and so on. normal form. These normal forms are defined by certain formal requirements for the schema.

A relational data schema is brought into a normal form by progressively decomposing its relations into simpler ones on the basis of functional dependencies that apply to them, until no further decomposition is possible. However, data must not be lost in the process. Delobel's theorem can be used to formally prove that a decomposition step does not involve any loss of data.

Normalization is mainly used in the design phase of a relational database. There are algorithms for normalization (synthesis algorithm (3NF), decomposition algorithm (BCNF), etc.) that can be automated.

The decomposition methodology follows relational design theory.