Database Systems - lecture schedule (Academic year 2007/2008)
All lectures are in room A3 of via Ariosto 25, Roma
Week | Tuesday (15:45 - 17:15) | Thursday (15:45 - 17:15) | Friday (15:45 - 17:15) |
1 (Jan 14) | Lectures 1,2 - Course overview - Introduction to normalization |
Lectures 3,4 - Functional dependencies (FD) - Armstrong's axioms |
Lectures 5,6 - Closure of FDs - Computing the closure |
2 (Jan 21) | Lectures 7,8 - Boyce-Codd normal form - Algorithm for checking BCNF |
Lectures 9,10 - Lossless-join decomposition |
|
3 (Jan 28) | Lectures 11,12 - Dependency-preserving decomposition |
Lectures 13,14 - Algorithm for BCNF |
Lectures 15,16
Decomposition algorithm |
4 (Feb 4) | Lectures 17,18 Exercises on normalization |
Lectures 19,20 Concurrency control: the notion of serializability |
Lectures 21,22
The notion of conflict-serializability |
5 (Feb 11) | Lectures 23,34 Graphs and topological orders |
Lectures 25,26 Mid-term exam on normalization Conflict-serializability theorem |
|
6 (Feb 18) | Lectures 27,28 Properties of conflict-serializability |
Lectures 29,30 Concurrency based on locks |
Lectures 31,32 Two-phase locking (2PL) |
7 (Feb 25) | Lectures 33,34
Properties of 2PL |
Lectures 35,36 Shared locks and 2PL |
|
8 (Mar 3) | Lectures 37,38 Buffer manager |
Lectures 39,40 Recovery manager |
Lectures 41,42 Representing relations through files |
9 (Mar 10) | |
Lectures 43,44 File organizations |
|