ITWissen.info - Tech know how online

normalization

The term normalization is used in connection with relational database models and characterizes the step-oriented approach to designing the structure of a relational database. In this process, the relations are decomposed in such a way that anomalies cannot occur and redundancies are avoided. The relations contain the data

that logically belong together. The goal of normalization is to generate a clear and transparent data structure that avoids inconsistencies

and ambiguities and supports easy data maintenance. Up to five rules - the normalizations - can be distinguished for the normalization process. Provided that all these rules are observed when generating the data structures, this is also referred to as fully normalized data structures, which, however, result in an increased system load. Normalization supports the preservation of theintegrity of

a database - this refers to the correctness of a data structure.If you look at it figuratively, during normalization the relations - also tables - with many attributes are split from a higher degree into several tables - each of which then has a lower degree. This then avoids redundancies as well as difficulties in changing, inserting and deleting so-called anomalies. A relation is said to be unnormalized if it has attributes

with attribute values that are composed of several elements of, for example, a value list. Thus, normalization can be defined inversely as the elimination of dependencies between the attributes of a relation. Functional and transitive dependencies are differentiated

The Normalization of a Relational Schema

Several steps characterize the normalization of a relational schema. In each step, the relations must satisfy certain rules - also conditions. Thus, the so-called normal form of the relational schema is formed. This process of normalization can contain up to five steps - however, it is usually useful to satisfy only the first three conditions. Since the normalization process can result in many small relations, the administration of the database often becomes too complex with further normalization steps. The normalization process is often referred to as decomposition. The higher the degree of decomposition of a relation, the more complex a database operation becomes - the performance of

a database must also be taken into account here. Often, even controlled redundancies are allowed in this context, as in the case of multiple existence of attributes - often also key attributes. The so-called duality principle specifies that the original relation must be recoverable after normalization - the normalization process must therefore be free of losses in any case.1st normal form . The first normal form (1NF) exists when there are no attributes with attribute values that are composed of multiple elements. Relations in 1NF are characterized by being a two-dimensional structure of rows

and columns. Conversely, this means that in the 1NF all multiple entries in an attribute are to be removed and thus each attribute can only have at most one value. 2ndnormal form

. The second normal form (2NF) is formed by breaking the relation into smaller relations so that in each relation all non-key fields depend only on the primary key. Note that the attributes are each dependent on an entire key field. Thesystem checks whether a primary key consists of several attributes, where the attributes then only depend on a part of the primary key. If this is the case, this part of the primary key with its attributes is transferred to a new relation.

3. normal form . The 3NF assumes that all data fields (attributes) of a table are independent of each other and depend only on the entire key. Thus, any attribute not belonging to the key is functionally dependent only on the entire key. Transitive dependency is the condition when a non-key field is identifiable only through another non-key field. The consequences of transitive dependencies are redundancy and inconsistency of data structures. Thus, for the 3NF, all transitive dependencies must be removed

by decomposition of relations. In the resulting relations, all non-key fields are then directly dependent on the entire key fieldBoyce Coded Normal Form (BCNF)

.

Removes dependencies of individual keys or key attributes on each other. This is not taken into account in the 3NF. The BCNF satisfies a relation exactly if no attribute is functionally dependent on an attribute group without a key property. This is also referred to as minimal keys - these are non-composite keys. Relations that have several overlapping minimal keys create a functional dependency and in turn lead to redundancies.

4. normal form

. This is satisfied by relations that are in the 3NF and do not contain multi-valued dependencies of attributes. Multi-valued dependency is said to exist if several non-key attributes are directly dependent on the key, but not on each other5. normal form

. If decomposition in the 4NF is no longer possible without loss, the 5th normal form (5NF) adds more primary keys. This is continued until there are only single dependencies of the attributes on one or more primary keys. The last two normal forms are less important in practice, since both relations are added here and redundancies are generated.

With each increase in the number of relations, there are often difficulties in the performance of queries and transactions.

Informationen zum Artikel
Englisch: normalization
Updated at: 28.10.2013
#Words: 1220
Links:
Translations: DE