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 [2016/12/09 13:25] svsummer [COURSE TRAJECTORY] |
teaching:infoh417 [2017/01/12 09:26] svsummer |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== INFO-H-417 : Database Systems Architecture ====== | ====== INFO-H-417 : Database Systems Architecture ====== | ||
| + | |||
| + | <note important> The written exam of INFOH417 is planned on monday, 16 january 2017 from 14h00-17h30 in room S.UB5.230. The exam is closed book. As mentioned in class; you are allowed to use a calculator, provided that this is a bare-bones calculator without programming capabilities. If this is a programmable calculator, you are only allowed to use it after resetting its memory on site. Use of smartphones or other devices with communication capabilities are not allowed.</note> | ||
| <note tip> The written exam of INFOH417 is planned on monday, 16 january 2017 from 14h00-17h30 in room S.UB5.230. The exam is closed book. | <note tip> The written exam of INFOH417 is planned on monday, 16 january 2017 from 14h00-17h30 in room S.UB5.230. The exam is closed book. | ||
| Line 107: | Line 109: | ||
| * During lecture 8 {{:teaching:infoh417:slides-lect8-part1.pdf|slides part 1}} {{:teaching:infoh417:slides-lect8-part2.pdf|slides part 1}} we gave a short introduction to transaction processing in general, and dove into coping with systems failures in particular. The details may be found in chapter 17 of the book. | * During lecture 8 {{:teaching:infoh417:slides-lect8-part1.pdf|slides part 1}} {{:teaching:infoh417:slides-lect8-part2.pdf|slides part 1}} we gave a short introduction to transaction processing in general, and dove into coping with systems failures in particular. The details may be found in chapter 17 of the book. | ||
| - | * 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, December 9**. **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, December 9**. **It is strongly suggested that you try doing these exercises, as they are typical exam questions.** {{:teaching:infoh417:07-integrated-slides.pdf|The solutions are online.}} |
| - | * 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**. {{:teaching:infoh417:05_-_logging-sol-slides.pdf|The solutions are online.}} |
| ==== Lecture 9: Concurrency control ==== | ==== Lecture 9: Concurrency control ==== | ||
| Line 115: | Line 117: | ||
| * 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). | * 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), and 18.9.1 (c,f) by the response lecture of **Friday, December 16**. | + | * 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 16**. Given that we have not studied validation based schedulers, you do not need to prepare exercise 18.9.1 (c,f). {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}} |