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 [2016/12/05 14:10] svsummer [COURSE TRAJECTORY] |
teaching:infoh417 [2016/12/08 09:17] svsummer |
||
|---|---|---|---|
| Line 110: | Line 110: | ||
| * 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 9**. | * 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 9**. | ||
| + | |||
| + | ==== 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 (section 18.7 is excluded). | ||
| + | |||
| + | * You are expected to solve exercises 18.2.4(b,c,e), 18.8.1(b,d), 18.8.2 (a,c), and 18.9.1 (c,f) by the response lecture of **Friday, December 16**. | ||
| + | |||
| + | |||
| + | ==== Revision session ==== | ||
| + | |||
| + | Durig the lecture & exercise session of **Friday, december 16** 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**. | ||
| + | |||
| + | This last lecture also features a demo that illustrates how the theory on query optimization that we have studied is applied in practical database management systems. | ||
| + | |||
| + | |||