Database Normalization - Transformation to Boyce-Codd Normal Form (BCNF) | Database Tutorial 6k

In this lecture of the databases course we consider a BCNF synthesis algorithm for transforming a database schema into Boyce-Codd normal form (BCNF). In order to prevent unnecessary splits (table decompositions), the algorithm first computes a canonical set of functional dependencies and maximizes their right-hand sides.

This is the databases online course given at the Vrije Universiteit Amsterdam by Jörg Endrullis. The course objective is to obtain a good understanding of relational database systems from the user perspective. This includes the ability to develop conceptual database models, as well as key concepts and skills in relational database theory and practice.

Among others, we treat in this course the following subjects:
(a) entity–relationship diagrams for the design of database schemata,
(b) the relational database model and integrity constraints,
(c) SQL (structured query language) for retrieving information from relational databases,
(d) database normalisation and functiona dependencies (reasoning about good database design),
(e) transactions and concurrency control.

The slides are based on work by Peter Boncz and Torsten Grust.

[sneakymnky]

Might want to show some exceptions buddy

[panagiotiskyriakou]

BUT IN R(C, E) we voilate E->A, B, D, as C is not in E->A, B, D ....

[Oblivionistcool]

Is R0(CE), R1(CBD), R2(AE), R3(BDA) also a valid BCNF for the last exercise you do?

[Oblivionistcool]

Nice video. I have a question. If i have a Relation R = {ABCDE} and the FDs = {E -> A, AE -> C}, is E+ = {ACE}?

[Oblivionistcool]

How can i practise on the website you use? I always get the message No no nononononono nono nono no. Is there a way that I can use this website too?