Third normal form¶
A relational-database normal form in which every nontrivial functional dependency has a superkey determinant or a prime dependent attribute, eliminating problematic transitive non-key dependencies.
Core Idea¶
3NF is weaker than Boyce–Codd normal form but guarantees dependency-preserving, lossless synthesis under standard algorithms; correct assessment depends on the full dependency set and candidate keys, not a slogan alone. Functional dependencies determine candidate keys and prime attributes; a relation is decomposed when a non-key determinant controls a non-prime attribute, with joins and dependency projection checked to preserve information and constraints. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.
Scope of Application¶
Third normal form belongs to relational database design and is useful where the analyst can specify the typed relational database design carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the relation schema and attribute domains, functional dependencies and closure, candidate keys and superkeys, prime and non-prime attributes, nontrivial dependency, formal 3NF test, transitive-dependency interpretation, decomposition schemas, lossless join, dependency preservation and comparison with 2NF and BCNF are explicit.
Clarity¶
The abstraction clarifies a crowded vocabulary by making the relation schema and attribute domains, functional dependencies and closure, candidate keys and superkeys, prime and non-prime attributes, nontrivial dependency, formal 3NF test, transitive-dependency interpretation, decomposition schemas, lossless join, dependency preservation and comparison with 2NF and BCNF are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.
Manages Complexity¶
Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Third normal form. Third normal form compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.
Abstract Reasoning¶
- Identify the carrier. State what the elements, states, objects, or observations are: the typed relational database design carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.
Knowledge Transfer¶
Knowledge transfers strongly among subfields of relational database design because they reuse the typed relational database design carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Functional dependencies determine candidate keys and prime attributes; a relation is decomposed when a non-key determinant controls a non-prime attribute, with joins and dependency projection checked to preserve information and constraints., and type the carrier, state every parameter and convention in the definition, test that the relation schema and attribute domains, functional dependencies and closure, candidate keys and superkeys, prime and non-prime attributes, nontrivial dependency, formal 3NF test, transitive-dependency interpretation, decomposition schemas, lossless join, dependency preservation and comparison with 2NF and BCNF are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.
Relationships to Other Abstractions¶
Current abstraction Third normal form Domain-specific
Parents (1) — outgoing typed relations
-
Third normal form is a kind of Decomposition Prime
It remains its own entry because its identity is fixed by the relation schema and attribute domains, functional dependencies and closure, candidate keys and superkeys, prime and non-prime attributes, nontrivial dependency, formal 3NF test, transitive-dependency interpretation, decomposition schemas, lossless join, dependency preservation and comparison with 2NF and BCNF.
Hierarchy path (1) — routes to 1 parentless root
- Third normal form → is a kind of Decomposition
Neighborhood in Abstraction Space¶
Third normal form sits in a crowded region of the domain-specific corpus (18th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Relational Database Theory (13 abstractions)
Nearest neighbors
- Relational database — 0.93
- Relational transducer — 0.91
- Structured entity relationship model — 0.90
- Codd's theorem — 0.90
- Query rewriting — 0.90
Computed from structural-signature embeddings · 2026-10-25