Database Normalization: Enhancing Data Efficiency
Learn about the importance of normalization in databases to reduce redundancy and improve data access speed and accuracy. Explore various normal forms such as 2NF, 3NF, EKNF, and BCNF, and understand how to apply them. Discover a tool for normalizing universal relations and overcoming limitations in MySQL.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Schema Builder CS4221 - Group P12
Why normalization? To reduce data redundancy so that when accessing the data, it will be faster, more efficient and more accurate with the expected data produced.
Normal Forms Type of Normal Forms: Second Normal Form Third Normal Form Elementary Key Normal Form Boyce-Codd Normal Form
Second Normal Form (2NF) for every functional dependency X {A}+: X {A} is trivial or X is not a proper subset of a candidate key or A is a prime attribute
Third Normal Form (3NF) for every functional dependency X {A}+: X {A} is trivial or A is a prime attribute or X is a superkey
Elementary Key Normal Form (EKNF) for every functional dependency X {A}+: X {A} is trivial or A is an elementary prime attribute or X is a superkey
Boyce-Codd Normal Form (BCNF) for every functional dependency X {A}+: X {A} is trivial or X is a superkey
Our Application Case tool to normalize Universal Relations Can normalize to 2NF, 3NF, ENKF, BCNF Creates the schema in a DB if accepted
How does it work? Uses Armstrong s Axioms to get all FDs Goes through all FDs for violations Finds foreign keys before adding to DB
Limitations Uses NP Complete algorithms No 4NF support Constrained to MySQL limitations
