Everything about Second normal form
Level of database normalization
Second normal form (2NF) is a level of database normalization defined by English computer scientist Edgar F. Codd. A relation is in 2NF if it is in first normal form (1NF) and contains no partial dependencies. A partial dependency occurs when a non-prime attribute is functionally dependent on only a proper subset of the attributes making up a candidate key. To be in 2NF, a relation must have every non-prime attribute depend on the whole set of attributes of every candidate key. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Second normal formA 5-minute orientation
- Skim a recent paper: The Smith normal form of Hadamard matrices from Paley's second constructionInfluential work since 2022
- Pick up a classic book: Practical mysticismThe most-reprinted book on the subject
- Read the landmark paper: High-speed distributed-arithmetic realization of a second-order normal-form digital filterCited 8 times
- Go sideways: Third normal formA closely related topic
- Go sideways: Database normalizationA closely related topic
📖 Definitions
Noun A stage in the normalization of a relational database in which it is in first normal form and every non-key attribute is dependent upon the entire primary key.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
High-speed distributed-arithmetic realization of a second-order normal-form digital filter
Normal form for Ritt's Second Theorem
A second multivariable normal form for model reduction of discrete-time systems
Stability domains for second-order recursive digital filters in normal form with 'matrix power' feedback
Normal Form for Second Order Differential Equations
Higher order accuracy analysis of the second-order normal form method
A NORMAL FORM THEOREM FOR SECOND-ORDER CLASSICAL LOGIC WITH AN AXIOM OF CHOICE
Real Normal Form of a Binary Polynomial at a Second-Order Critical Point
🆕 Influential since 2022
📚 Books worth reading
Practical mysticismEvelyn Underhill · 1914
Argonauts of the western PacificBronisław Malinowski · 1922
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
The personal MBAJosh Kaufman · 2010
Hollow CityRansom Riggs · 2013
Differential Equations and Dynamical SystemsLawrence Perko · 1991
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Third normal form Third normal form (3NF) is a level of database normalization defined by English computer scientist Edgar F. Codd. A relation (or table, in SQL) is in third…
- Database normalization Database normalization is the process of structuring a relational database in accordance with a series of normal forms to reduce data redundancy and improve…
- Boyce–Codd normal form Boyce–Codd normal form (BCNF or 3.5NF) is a normal form used in database normalization. It is a slightly stricter version of the third normal form (3NF)…
- First normal form First normal form (1NF) is the most basic level of database normalization defined by English computer scientist Edgar F. Codd, the inventor of the relational…
- Sixth normal form Sixth normal form (6NF) is a normal form used in relational database normalization which extends the relational algebra and generalizes relational operators…
- Fourth normal form Fourth normal form (4NF) is a normal form used in database normalization. Introduced by Ronald Fagin in 1977, 4NF is the next level of normalization after…
- Fifth normal form Fifth normal form (5NF), also known as projection–join normal form (PJ/NF), is a level of database normalization designed to remove redundancy in relational…
- Transitive dependency A transitive dependency is an indirect dependency relationship between software components. This kind of dependency is held by virtue of a transitive relation…