This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:infoh417 [2017/12/08 09:06] svsummer |
teaching:infoh417 [2017/12/08 09:10] svsummer |
||
|---|---|---|---|
| Line 108: | Line 108: | ||
| * You are expected to solve exercises 17.2.2, 17.2.4, 17.2.5, 17.2.7, 17.3.2, 17.3.3, 17.3.4, 17.3.5, 17.4.2, 17.4.3, 17.4.4, and 17.4.5 in the book by exercise session of **Friday, December 15**. | * You are expected to solve exercises 17.2.2, 17.2.4, 17.2.5, 17.2.7, 17.3.2, 17.3.3, 17.3.4, 17.3.5, 17.4.2, 17.4.3, 17.4.4, and 17.4.5 in the book by exercise session of **Friday, December 15**. | ||
| + | |||
| + | ==== Lecture 9: Concurrency control ==== | ||
| + | |||
| + | * During lecture 9 ({{:teaching:infoh417:slides-lect9.pdf|slides}}), we studied the problems that can occur when a database runs many transactions concurrently and the different kinds of scheduling algorithms that can prevent these problems. The details can be found Chapter 18 (sections 18.5, 18.6. 18.7 is excluded as is section 18.9 on validation-based schedulers). | ||
| + | |||
| + | * You are expected to solve exercises 18.2.4(b,c,e), 18.8.1(b,d), 18.8.2 (a,c) by the response lecture of **Friday, December 15**. Given that we have not studied validation based schedulers, you do not need to prepare exercise 18.9.1 (c,f). | ||
| + | |||
| + | ==== Revision session ==== | ||
| + | |||
| + | During the lecture & exercise session of **Friday, december 15** you have the opportunity to ask questions on the theory and exercises. In particular, if you would like to have a certain part of a lecture re-explained, or an exercise re-corrected, then this is possible **provided that you let prof. Vansummeren know your question by monday, december 12 at the latest**. | ||
| + | |||