Join dependencies generalize functional and multivalued dependencies to cases where a relation can be reconstructed from multiple projections without information loss. Fifth Normal Form (5NF, or Project-Join Normal Form) requires that only join dependencies implied by keys exist. While 5NF is the ultimate decomposition goal, most practical databases operate at BCNF; going beyond is rarely justified by the complexity it introduces.
You already understand that normalization decomposes tables to eliminate redundancy, and that fourth normal form handles multivalued dependencies — cases where two independent multi-valued facts about a key create spurious combinations. Join dependencies are the next generalization: they describe situations where a table can be losslessly decomposed into three or more projections, even when no functional or multivalued dependency explains why.
Consider a concrete example. Suppose a table records which suppliers can supply which parts to which projects: `(supplier, part, project)`. There is no functional dependency here — knowing two columns does not determine the third. There may not even be a multivalued dependency in the 4NF sense. But suppose the business rule is: if supplier S can supply part P (to any project), and supplier S works on project J (with any part), and part P is needed by project J (from any supplier), then supplier S can supply part P to project J. This is a join dependency: the original table equals the natural join of its three pairwise projections `(supplier, part)`, `(supplier, project)`, and `(part, project)`. The single three-column table contains redundancy because any fact derivable from the three pairwise relationships is forced to appear as an explicit row.
Fifth Normal Form (5NF), also called Project-Join Normal Form (PJNF), requires that every join dependency in the table is implied by its candidate keys. If a join dependency exists that is not implied by keys, the table can be decomposed into the corresponding projections without losing information. After decomposition, each projection stores an independent fact, and the original table is recoverable by joining them back together. This eliminates the redundancy that the join dependency caused.
In practice, 5NF is rarely pursued explicitly. The scenarios that violate 5NF but satisfy 4NF involve subtle multi-way relationships that are uncommon in typical business data. Detecting join dependencies requires understanding the semantic rules of the domain — they cannot be mechanically derived from the data the way functional dependencies can. Most real-world schemas stop at BCNF or 4NF, where the redundancy problems are concrete and the decompositions are straightforward. Fifth normal form is best understood as the theoretical endpoint of lossless decomposition: the guarantee that no further decomposition can eliminate redundancy. Knowing it exists helps you recognize the rare cases where a three-way (or n-way) relationship is creating anomalies that lower normal forms do not explain.
No topics depend on this one yet.