Data Management (academic year 2012/2013) - lecture schedule
Lectures are scheduled from October 2012 to December 2012, in via Ariosto 25.
Week | Wednesday (12:00 - 1:15) | Thursday (08:30 - 10:00) | Thursday (10:15 - 11:45) |
01 (Oct 01) | Lectures 1,2 - Course overview - Architecture of a DBMS - The notion of transaction |
Lectures 3,4 - The notion of schedules - Serializability - Anomalies |
Lectures 5,6 - View serializability |
02 (Oct 08) |
|
Lectures 7,8 - Properties of view and conflict serializability |
Lectures 9,10 - Properties of view and conflict serializability |
03 (Oct 15) |
Lectures 11,12 - Concurrency control based on locks |
Lectures 13,14 - Comparison between locking and conflict serializability |
Lectures 15,16 - Management of deadlocks |
04 (Oct 22) |
Lectures 17,18 - Recoverability |
Lectures 19,20 - Exercises on concurrency control |
Lectures 21,22 - Exercises on concurrency control |
05 (Oct 29) |
Lectures 23,24 - Strictness and rigorousness |
|
|
06 (Nov 05) |
Lectures 25,26 - Timestamp-based concurrency control |
Lectures 27,28 - Multiversion timestamp-based concurrency control |
Lectures 29,30 - Exercises on concurrency control |
07 (Nov 12) |
Lectures 29,30 - The buffer manager - Introduction to recovery |
|
|
08 (Nov 19) |
Lectures 31,32 - The log file - Warm and cold restart |
Lectures 33,34 - Records, pages and files - Introduction to file organizations |
Lectures 35,36 - The heap file - Sorted file - Hash file |
09 (Nov 26) |
Lectures 37,38 - Introduction to indexes |
Lectures 39,40 - Tree-based indexes: ISAM |
Lectures 41,42 - Tree-based indexes: B+-trees - Exercises on file organizations |
11 (Dec 03) |
Lectures 43,44 - Extensible hash-based indexing |
Lectures 45,46 - Linear hash-based indexing - Exercises on file organizations |
|
12 (Dec 10) |
Lectures 47,48 - Evaluation of relational operators |
|
|
12 (Dec 17) |
Lectures 49,50 - Exercises on file organizations |
Lectures 51,52 - Exercises on file organizations |
Lectures 53,54 - Exercises on file organizations |