---

Lectures are scheduled from October 2013 to December 2013, in via Ariosto 25.

---

Week	Wednesday (08:30 - 10:00)	Thursday (08:30 - 10:00)	Thursday (10:15 - 11:45)
01 (Sep 30)	-------------	Lectures 1,2 - Course overview - Relational data and queries	-------------
02 (Oct 07)	Lectures 3,4 - Architecture of a DBMS - Buffer management	Lectures 5,6 - Records, pages and files - Introduction to file organizations	Lectures 7,8 - Simple file organizations - Heap, sorted, and hashed file
03 (Oct 14)	Lectures 9,10 - Cost analysis of heap, sorted, and hashed file	Lectures 11,12 - External sorting - Analysis of external sorting	-------------
04 (Oct 21)	Lectures 13,14 - Optimizations in external sorting - Introduction to indexes	Lectures 15,16 - Clustering sorted index - Insertions and deletions in sorted index	Lectures 17,18 - Non clustering sorted index - Multi-level sorted index
05 (Oct 28)	Lectures 19,20 - Clustered file - Tree index: ISAM	Lectures 21,22 - Tree index: B+tree - Insertions and deletions in B+trees	Lectures 23,24 - Performance of B+trees - Hash index
06 (Nov 04)	Lectures 25,26 - Dynamic hashing - Exercises on file organizations (part 1)	Lectures 27,28 - Exercises on file organizations (part 2)	-------------
07 (Nov 11)	Lectures 29,30 - Exercises on file organizations (part 3)	Lectures 31,32 - Introduction on query processing - Algorithms for the algebraic operators	Lectures 33,34 - One pass algorithms - Nested loop algorithms
08 (Nov 18)	Lectures 35,36 - Two pass algorithms	-------------	-------------
09 (Nov 25)	Lectures 37,38 - Index-based algorithms - Multipass algorithms	Lectures 39,40 - Introduction to transaction management - The notion of serializability	Lectures 41,42 - View serializability - Complexity of view serializability
11 (Dec 02)	Lectures 43,44 - Conflict serializability - Algorithms for conflict serializability	-------------	-------------
12 (Dec 09)	Lectures 45,46 - Locks - Two phase locking	Lectures 47,48 - Properties of two phase locking - Two phase locking and serializability	Lectures 49,50 - Recoverability - Strictness
12 (Dec 16)	Lectures 51,52 - Exercises on concurrency control	Lectures 53,54 - Timestamp-based concurrency control - Exercises on timestamp-based concurrency control	Lectures 55,56 - Recovery