Interactive Relational Normalization & Synthesis Studio Codd 1970 • Bernstein 1976
Derive candidate keys under Armstrong's Axioms, inspect minimal covers, synthesize dependency-preserving lossless-join 3NF relations, decompose BCNF trees, and verify join dependency implication via the deterministic Tableau Chase with spurious tuple counterexamples.
1. Relational Schema Input Pure discrete evaluator
Comma-separated list of attribute names.
One dependency per line: X -> Y.
Leave blank to chase Bernstein's 3NF synthesis, or enter subschemas to test for lossiness.
Candidate Keys
—
Prime Attributes
—
Chase Join Status
—
Normal Form Decision Invariants
Bernstein (1976) 3NF Synthesis (Lossless & Dependency-Preserving)
Run synthesis to generate decomposed relational tables.
Relational Tableau Chase Execution Trace
| Step | FD Applied | Rows Equated | Attribute | Symbol Mutation |
|---|---|---|---|---|
| Awaiting execution... | ||||
View Final Tableau Matrix
Generated Relational DDL
-- SQL DDL will appear here after synthesis