CS-A1153 - Databases (summer course), 04.06.2020-03.09.2020
This course space end date is set to 03.09.2020 Search Courses: CS-A1153
Question 4
Krav för slutförande
Öppnades: torsdag, 3 september 2020, 09:00
Senaste inlämningsdatum: torsdag, 3 september 2020, 12:15
Consider a relation R with schema R(A, B, C, D, E) and functional dependencies A → B, A C → D, and
E → B.
a) (1 p) Explain why this relation is not in Boyce-Codd normal form (BCNF).
b) (6 p) Decompose the relation using the BCNF decomposition algorithm taught in this course and in the
text book. Give a short justification for each new relation. Continue the decomposition until the final
relations are in BCNF. Explain why the final relations are in BCNF.