related topics
{math, number, function}
{system, computer, user}
{law, state, case}
{ship, engine, design}

Denormalization is the process of attempting to optimize the read performance of a database by adding redundant data or by grouping data.[1][2] In some cases, denormalization helps cover up the inefficiencies inherent in relational database software. A relational normalized database imposes a heavy access load over physical storage of data even if it is well tuned for high performance.

A normalized design will often store different but related pieces of information in separate logical tables (called relations). If these relations are stored physically as separate disk files, completing a database query that draws information from several relations (a join operation) can be slow. If many relations are joined, it may be prohibitively slow. There are two strategies for dealing with this. The preferred method is to keep the logical design normalized, but allow the database management system (DBMS) to store additional redundant information on disk to optimize query response. In this case it is the DBMS software's responsibility to ensure that any redundant copies are kept consistent. This method is often implemented in SQL as indexed views (Microsoft SQL Server) or materialized views (Oracle). A view represents information in a format convenient for querying, and the index ensures that queries against the view are optimized.

The more usual approach is to denormalize the logical data design. With care this can achieve a similar improvement in query response, but at a cost—it is now the database designer's responsibility to ensure that the denormalized database does not become inconsistent. This is done by creating rules in the database called constraints, that specify how the redundant copies of information must be kept synchronized. It is the increase in logical complexity of the database design and the added complexity of the additional constraints that make this approach hazardous. Moreover, constraints introduce a trade-off, speeding up reads (SELECT in SQL) while slowing down writes (INSERT, UPDATE, and DELETE). This means a denormalized database under heavy write load may actually offer worse performance than its functionally equivalent normalized counterpart.

A denormalized data model is not the same as a data model that has not been normalized, and denormalization should only take place after a satisfactory level of normalization has taken place and that any required constraints and/or rules have been created to deal with the inherent anomalies in the design. For example, all the relations are in third normal form and any relations with join and multi-valued dependencies are handled appropriately.

Examples of denormalization techniques include:

  • Materialized views, which may implement the following:
    • Storing the count of the "many" objects in a one-to-many relationship as an attribute of the "one" relation
    • Adding attributes to a relation from another relation with which it will be joined
  • Star schemas, which are also known as fact-dimension models and have been extended to snowflake schemas
  • Prebuilt summarization or OLAP cubes

Denormalization techniques are often used to improve the scalability of Web applications.[3]


See also

Full article ▸

related documents
Initialization vector
Serial number
Client-side scripting
Code coverage
World file
Occam (programming language)
Oberon programming language
Computer algebra system
Curl (programming language)
Java Naming and Directory Interface
Bourne shell
Wikipedia:Browser notes
Java API for XML Processing
Wikipedia:Database queries
ActiveX Data Objects
Wikipedia:Free On-line Dictionary of Computing/I - K
Data structure
Server-side scripting
Rich Text Format
Literate programming
Java applet
Wikipedia:Federal Standard 1037C terms/computer programming terms
Accumulator (computing)