CS4221 ProjectRelational 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)

Content1. Introduction of features2. Implementations3.Strength and weakness of our

application4.Demo5.Conclusion

Introduction of features

Implementations

3NF Conversion using Bernstein’s Algorithm

1. Eliminate extraneous attribute2. Covering3. Partition4. Merge equivalent keys5. Eliminate transitive dependencies6. Construct relations

1. Bernstein’s Algorithm does not guarantee reconstructibility (or losslessness)

2. Bernstein’s Algorithm does not find all the keys

Shortcomings of Bernstein’s Algorithm removed

Compute Closure

1. Reflexivity

2. Augmentation

3. Transitivity

Using Armstrong axioms

Normal Form Tester

1. 1st Normal Form2. 2nd Normal Form3. 3rd Normal Form4. 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

Questions and Answers