ComputingComputer ScienceData ManagementDatabasesSet TheoryDatabase DesignDatabase ManagementDatabase NormalizationRelational AlgebraRelational Data ModelRelational DatabasesNormal Form DecompositionNormal Form TheoryNormal FormsNormalizationNormalization TheoryRelational Database SystemsRelational Schema DecompositionUnion
We discuss the relationship between normal forms in a relational database and an allowed set of relational operators. We define "projection-join normal form" (PJ/NF), which is the ultimate normal form when only projection and join are allowed. Aho, Beeri and Ullman made the counterintuitive discovery that there is a relation schema with a valid decomposition into three of its projections without the decomposition being equivalent to a cascade of decompositions, each into two projections. Because of this possibility, there exist bizarre relation schemata that are in fourth normal form but not in PJ/NF. We also discuss issues associated with allowing the union operator.
12
M. M. Astrahan, Michael W. Blasgen, Donald D. Chamberlin et al. · ACM Transactions on Database Systems · 1976 · 1K citations · Full text
Equivalences among Relational Expressions
A. V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman · SIAM Journal on Computing · 1979 · 364 citations
Computing, Computer Science, Algebra +15
Recent Investigations in Relational Data Base Systems.
E. F. Codd · IFIP Congress · 1974 · 247 citations