First page Back Continue Last page Graphics
Third Normal Form
Decomposition into 3NF
3NF Decomposition Algorithm
- Decomposition into 3NF
- Claim
- If a relation Ri is in the decomposition generated by the synthesis algorithm, then Ri is in 3NF
- Idea
- To test for 3NF, it is sufficient to consider the functional dependencies whose right-hand side is a single attribute
- Therefore to see that Ri is in 3NF, we must show that any functional dependency that holds in Ri, satisfies the definition of 3NF
Notes: