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)

1. Introduction of features
2. Implementations
3. Strength and weakness of our application
4. Demo
5. Conclusion

Introduction of features

Implementations

3 NF Conversion using Bernstein’s Algorithm
1. Eliminate extraneous attribute
2. Covering
3. Partition
4. Merge equivalent keys
5. Eliminate transitive dependencies
6. Construct relations

Shortcomings of Bernstein’s 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:
● Good interface for input and editing FDs
● Clear explanation
Weakness:
● Not all of the Bernstein’s Algorithm’s shortcomings are removed