Normal Form Decomposition
Normal Form Decomposition is a database design method that systematically breaks down a relational schema into smaller, normalized relations to eliminate data redundancy and anomalous dependencies by adhering to successively higher normal forms.
108
Publications
5.6K
Citations
194
Authors
127
Institutions
Publications per year
2017–2026
9
Parents
108
Decomposable negation normal form
Adnan Darwiche · Journal of the ACM · 2001 · 333 citations
Normal forms and relational database operators
Ronald Fagin · 1979 · 154 citations
1–5 of 108
194
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 194
127
IBM (United States)
Armonk, United States
4 h-index
4 publications
908 citations
Sandia National Laboratories
Albuquerque, United States
3 h-index
21 publications
2.4K citations

University of Waterloo
Waterloo, Canada
3 h-index
5 publications
251 citations
University of New Mexico
Albuquerque, United States
3 h-index
21 publications
2.4K citations
University of Oxford
Oxford, United Kingdom
3 h-index
5 publications
316 citations
University of Colorado Boulder
Boulder, United States
2 h-index
2 publications
70 citations
University of California, Irvine
Irvine, United States
2 h-index
2 publications
62 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
45 citations
1–8 of 127
4 publications · 165 citations
4
h-index
4 publications · 195 citations
4
h-index
3 publications · 53 citations
3
h-index
TODS · 3 publications · 933 citations
3
h-index
3 publications · 78 citations
3
h-index
1–5