This project was to implement 2 algorithms for breaking up a table so would be in Boyce Codd Normal Form or 3 Normal Form. When you put all your attributes in a single table, you get
- redundancies
- deletion anomalies
- update anomalies
- insertion anomalies
To avoid this, we decompose our table. This has to be done properly so the original information is retrieved, meaning there is no loss or extraneous information.
Input
- Number of attributes in your table (<=10)
- Functional Dependencies
Output
- Decomposed Tables
More indepth tutorial is on my Readme. The site walks you through the algorithm and intermediate steps. Source code is public so you can study its implementation here.