Data Management (academic year 2009/2010) - lecture schedule
Lectures are scheduled from Sep. 29 to Dec. 18, in via Ariosto 25, Roma: the Tuesday lectures are in room B2, and the Wednesday lectures are in room A3.
Week | Tuesday (14:00 - 15:30) | Wednesday (14:00 - 15:30) | Wednesday (15:45 - 17:15) |
01 (Sep 28) | Lectures 1,2 - Course overview - Architecture of a DBMS - The notion of transaction |
| |
02 (Oct 5) | Lectures 3,4 - The notion of schedule - Serializability |
Lectures 5,6 - Different notions of serializability - View serializability |
Lectures 7,8 - Algorithms for view serializability - Complexity of view serializability |
03 (Oct 12) | Lectures 9,10 - Conflict serializability - Properties of conflict serializability |
Lectures 11,12 - Complexity of conflict serializability - Comparison between view and conflict serializability |
Lectures 13,14 - Schedulers based on exclusive locks |
04 (Oct 19) | Lectures 15,16 - Comparison between locking and serializability - Schedulers based on shared and exclusive locks |
Lectures 17,18 - Recoverability and strictness - Strict 2PL schedules - Exercises on concurrency control |
|
05 (Oct 26) | Lectures 19,20 - Exercises on concurrency control - Methods based on timestamp |
Lectures 21,22 - Multiversion timestamp |
Lectures 23,24 - Exercises on timestamp-based concurrency control |
06 (Nov 2) | Lectures 25,26 - Final exercises on concurrency control - Self evaluation |
Lectures 27,28 - Buffer management |
Lectures 29,30 - Introduction to recovery |
07 (Nov 9) | Lectures 31,32 - Warm restart - Cold restart |
Lectures 33,34 - Exercises on Concurrency Control |
Lectures 35,36 - Physical organizations of relations |
08 (Nov 16) | Lectures 37,38 - Page and record organization - Heap file |
Lectures 39,40 - Sorted file - Hashed file |
Lectures 41,42 - Analysis of file organizations - Properties of indexes |
09 (Nov 23) | Lectures 43,44 - Tree-based indexes - ISAM - B+ trees |
||
10 (Nov 30) | Lectures 45,46 - Clustered B+ trees - Unclustered B+ trees |
Lectures 47,48 - Hashed-based index - Extendible hashing |
Lecture 49,50 - Linear hashing |
11 (Dec 7) | Lecture 51,52 - Evaluation of relational operators - Selection |
|
|
12 (Dec 14) | Lecture 53,54 - Projection - Join - Exercises on evaluation of relational algebra expressions |
Lecture 55,56 (Dec. 17, room A7) - Exercises on evaluation of relational algebra expressions |
Lecture 57,58 (Dec. 17, room A7) - Exercises on evaluation of relational algebra expressions |