Database Normalization Workbench
Compute closures, all minimal candidate keys, a minimal FD cover, normal-form violations and dependency-preserving 3NF synthesis with a key relation. Assumes atomic attributes (1NF) and exactly the supplied FDs, not inferred business dependencies. Nontrivial supplied-cover violations are diagnostics, not a full proof from all implied dependencies. Limits: 12 attributes / 50 FD lines / 100 split FDs.
Enabling local controls…
Results
Review the settings and run. Editing inputs clears old results.
Processing model and limits
Compute closures, all minimal candidate keys, a minimal FD cover, normal-form violations and dependency-preserving 3NF synthesis with a key relation. Assumes atomic attributes (1NF) and exactly the supplied FDs, not inferred business dependencies. Nontrivial supplied-cover violations are diagnostics, not a full proof from all implied dependencies. Limits: 12 attributes / 50 FD lines / 100 split FDs.
Data and model checked: Database System Concepts normalization ↗Source tool controls ↗
How to use this tool
Load the example, confirm field units and processing rules, then run locally. Editing any input clears the old result. Copy or download the complete output explicitly.
When not to use it
Compute closures, all minimal candidate keys, a minimal FD cover, normal-form violations and dependency-preserving 3NF synthesis with a key relation. Assumes atomic attributes (1NF) and exactly the supplied FDs, not inferred business dependencies. Nontrivial supplied-cover violations are diagnostics, not a full proof from all implied dependencies. Limits: 12 attributes / 50 FD lines / 100 split FDs.