Relational Database Schema using Bernstein's Algorithm for CS4221 Project Group P01
"Explore the implementation of relational database schema using Bernstein's Algorithm by CS4221 Project Group P01. Learn about the process of 3NF conversion, shortcomings, closure computation, normal form testing, strengths, weaknesses, and more."
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
CS4221 Project Relational Database Schema using Bernstein s Algorithm Group P01: Tan Wei Liang Jeremy (A0097876A) Melvin Lee Zhong Wei (A0097719L) Shiwani Agarwal (A0105301E) Sherlyn Goh Shi Hui (A0100848J)
Content 1. Introduction of features 2. Implementations 3. Strength and weakness of our application 4. Demo 5. Conclusion
3NF Conversion using Bernsteins Algorithm 1. Eliminate extraneous attribute 2. Covering 3. Partition 4. Merge equivalent keys 5. Eliminate transitive dependencies 6. Construct relations
Shortcomings of Bernsteins Algorithm removed 1. Bernstein s Algorithm does not guarantee reconstructibility (or losslessness) 1. Bernstein s Algorithm does not find all the keys
Compute Closure Using Armstrong axioms 1. Reflexivity 2. Augmentation 3. Transitivity
Normal Form Tester 1. 1st Normal Form 2. 2nd Normal Form 3. 3rd Normal Form 4. Boyce-Codd Normal Form
Strength & Weakness Strength: Good interface for input and editing FDs Clear explanation Weakness: Not all of the Bernstein s Algorithm s shortcomings are removed
