Qwestrum Engineering360 · IT & Software · Database Management Systems
Normalization
Normalization decomposes tables to remove redundancy and update anomalies, guided by functional dependencies; each normal form (1NF→2NF→3NF→BCNF) eliminates a specific kind of problematic dependency.
Exam tip: keep SI units consistent end-to-end, write the governing relation symbolically before substituting, and sanity-check magnitude and sign.
Key formulas & points
Skim these first — then read the full notes below.
- BCNF: every determinant must be a candidate key
- Denormalisation trades redundancy for read speed
- Functional dependencies X → Y guide decomposition
Topic details
Introduction
This topic covers designing anomaly-free schemas. You identify functional dependencies, test relations against 1NF, 2NF, 3NF and BCNF, and decompose offending relations while preserving dependencies and lossless joins.
Key relations & formulas
Formulas (Indian textbook notation)
Formulas (Indian textbook notation)
Formulas (Indian textbook notation)
Notation and sign conventions
Relation 1 —
Formulas (Indian textbook notation)
Write this relation with symbols exactly as in Database System Concepts — Korth, Silberschatz & Sudarshan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 2 —
Formulas (Indian textbook notation)
Write this relation with symbols exactly as in Database System Concepts — Korth, Silberschatz & Sudarshan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Relation 3 —
Formulas (Indian textbook notation)
Write this relation with symbols exactly as in Database System Concepts — Korth, Silberschatz & Sudarshan before substituting numbers. Examiners award partial marks for a correct setup even when arithmetic slips.
Concept in depth
Redundant data invites anomalies — the same fact stored in many rows can become inconsistent on update, or be lost on deletion. Normalization removes redundancy by decomposing based on functional dependencies. First normal form demands atomic values; second removes partial dependencies where a non-key attribute depends on only part of a composite key; third removes transitive dependencies where a non-key attribute depends on another non-key attribute. BCNF tightens 3NF by requiring every determinant to be a candidate key. Decomposition must be lossless (the original reconstructs by join) and ideally dependency-preserving, so over-normalising can hurt query performance, which is why controlled denormalisation is sometimes chosen.
Assumptions and validity limits
State assumptions explicitly before using any relation for normalization — steady state, uniform properties, linear elastic material, ideal gas, incompressible flow, etc., as applicable.
Wrong assumptions invalidate the entire solution even when the formula is correct. In Database Systems viva and GATE descriptive questions, listing valid assumptions often earns separate marks.
Step-by-step problem approach
1. Read the question and list given data with SI units (common in Database Systems papers).
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to normalization.
4. Use equation 1:
5. Use equation 2:
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.
2. Draw a neat labelled diagram where applicable — examiners in Indian universities award diagram marks even when arithmetic slips.
3. Identify which relation from this topic applies to normalization.
4. Use equation 1:
.
5. Use equation 2:
.
6. Substitute values, compute, and verify units and sign (direction).
7. State conclusion in one line — e.g. safe/unsafe, stable/unstable, feasible/infeasible.
Applications & exam relevance
Normalization appears in enterprise applications. In Indian it software curricula this topic is tested because it connects theory to relational model and SQL.
GATE and semester exams often combine normalization with earlier units — revise prerequisites before attempting mixed problems.
Industry interview panels sometimes ask: "Where did you use normalization?" — answer with a lab, mini-project, or plant visit example if possible.
Common mistakes in exams
Students jump to 3NF without checking 2NF, misidentify functional dependencies, and produce lossy decompositions. Confusing 3NF with BCNF (BCNF is stricter) and forgetting that normalization targets update anomalies, not just tidiness, are common.
Quick revision checklist
Before attempting normalization problems, confirm you can:
1. BCNF: every determinant must be a candidate key
2. Denormalisation trades redundancy for read speed
3. Functional dependencies X → Y guide decomposition
2. Denormalisation trades redundancy for read speed
3. Functional dependencies X → Y guide decomposition
Revise the solved examples in Database System Concepts — Korth, Silberschatz & Sudarshan and one previous-year GATE or university paper for this unit.
Worked examples
Try the problem first — open the solution when you are ready to check.
Transitive dependency to 3NF
Problem
R(A, B, C) has A → B and B → C, with A the key. Identify the normal-form violation and fix it.
Solution
B → C is a transitive dependency (A → B → C) violating 3NF. Decompose into R1(A, B) and R2(B, C); the join on B reconstructs R losslessly and removes the redundancy.
Conceptual check — Normalization
Problem
In a Database Systems semester or GATE paper you are asked: "State the main assumption, the governing relation, and one practical consequence of normalization." What should a complete answer include?
📖 Standard books (India)
Database System Concepts — Korth, Silberschatz & Sudarshan
Read: Syllabus unit
SQL, normalization, and transactions
Explore related topics
See real it & software careers
After exams and interviews, see how engineers actually built careers — milestones and decisions from people in the field.