Relational Database Schema Designer with Bernstein Algorithm for CS2102 Students
"Explore a web-based interface for relational database schema design, attribute management, and normalization using the Bernstein Algorithm. Learn to compute closure, remove extraneous attributes, and achieve 3NF. Demo available at http://comp.nus.edu.sg/~irving/visuDB."
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 Database Design Group P05 Name Matriculation Number Jonathan Irvin Gunawan A0113012J Mun Hui Yi A0101331H Rey Neo A0111823U Tan Young Sing A0111824R
Introduction Web-based Relational Database Schema Designer Interface to Add/Remove Attributes & FDs Compute Closure Normal Form Tester Normalization using Bernstein Algorithm Potential Learning Tool for CS2102 students
Implementation Javascript/ HTML JSON Objects Git
Bernstein Algorithm 1.Find the key 2.Check if the relation is in 3NF. 3.1 If the relation is in 3NF, the program ends. 3.2 Otherwise, proceed to execute Bernstein algorithm 3.2.1 Make every functional dependencies singleton 3.2.2 Remove extraneous attributes 3.2.3 Remove redundant functional dependencies
Bernstein Algorithm 3.2.5 Merge equivalent key 3.2.6 Remove transitive dependencies 3.2.7 Create relations 3.2.8 Program ends
Bernstein Algorithm Reconstructability Create a new relation consisting of all the attributes in any candidate key if any of the attributes are missing in the constructed relations
Bernstein Algorithm Finding all keys All superkeys are found first. Superkeys that has another superkey as a proper subset are eliminated Only the candidate keys.
DEMO http://comp.nus.edu.sg/~irving/visuDB/
