This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:infoh417 [2019/11/28 20:02] svsummer |
teaching:infoh417 [2019/12/06 19:42] svsummer [COURSE TRAJECTORY] |
||
|---|---|---|---|
| Line 106: | Line 106: | ||
| * You are expected to solve the integrated exercise 8.2 of the {{:teaching:infoh417:02-logicalopt-ex.pdf|optimization exercises}}, and 3.5 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercise session of **Friday, November 22**. **It is strongly suggested that you try doing these exercises, as they are typical exam questions.** | * You are expected to solve the integrated exercise 8.2 of the {{:teaching:infoh417:02-logicalopt-ex.pdf|optimization exercises}}, and 3.5 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercise session of **Friday, November 22**. **It is strongly suggested that you try doing these exercises, as they are typical exam questions.** | ||
| - | * 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, November 29**. | + | * 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, November 29**. {{:teaching:infoh417:05_-_logging-sol-slides.pdf|The solutions are online.}} |
| ==== Lecture 8: Integrated exercises ==== | ==== Lecture 8: Integrated exercises ==== | ||
| Line 119: | Line 119: | ||
| * 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). | * 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). | ||
| - | * You are expected to solve exercises 18.2.4(b,d,e), 18.8.1(b,d), 18.8.2 (a,c), and 18.9.1 (c,f) by the response lecture of **Friday, December 6**. | + | * You are expected to solve exercises 18.2.4(b,d,e), 18.8.1(b,d), 18.8.2 (a,c), and 18.9.1 (c,f) by the response lecture of **Friday, December 6**. {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}} |
| + | |||
| + | |||
| + | |||
| ==== Revision session ==== | ==== Revision session ==== | ||