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

Authors

194

  1. RF
    Ronald Fagin

    IBM Research - Almaden, United States

    4 publications · 947 citations

    4

    h-index

  2. JA
    John A. Shelnutt

    Sandia National Laboratories, United States

    3 publications · 556 citations

    3

    h-index

  3. NB
    Nicole Bidoít

    Université Paris-Sud, France

    2 publications · 165 citations

    2

    h-index

  4. GL
    George Labahn

    University of Waterloo, Canada

    2 publications · 89 citations

    2

    h-index

  5. JD
    Jean Della Dora

    Université de Lille, France

    2 publications · 49 citations

    2

    h-index

1–5 of 194

Venues

  1. Journal of Symbolic Computation

    4 publications · 165 citations

    4

    h-index

  2. Journal of Differential Equations

    4 publications · 195 citations

    4

    h-index

  3. ACM SIGMOD Record

    3 publications · 53 citations

    3

    h-index

  4. ACM Transactions on Database Systems

    TODS · 3 publications · 933 citations

    3

    h-index

  5. Linear Algebra and its Applications

    3 publications · 78 citations

    3

    h-index

1–5