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/18 15:30] svsummer |
teaching:infoh417 [2019/11/29 13:16] svsummer [COURSE TRAJECTORY] |
||
---|---|---|---|
Line 1: | Line 1: | ||
====== INFO-H-417 : Database Systems Architecture ====== | ====== INFO-H-417 : Database Systems Architecture ====== | ||
+ | <note tip>To help you in preparing for the exam, two prior exams and their solution are now available: {{:teaching:infoh417:ex-2016-s1-sol.pdf|prior exam 1}} {{:teaching:infoh417:ex-2014-s1-it4bi-sol.pdf|prior exam 2}}</note> | ||
+ | |||
+ | |||
<note>The list of approved project groups {{:teaching:infoh417:students_groups.pdf|has been updated}}</note> | <note>The list of approved project groups {{:teaching:infoh417:students_groups.pdf|has been updated}}</note> | ||
Line 97: | Line 100: | ||
* You are expected to solve exercise 2 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercises session of **November 15**. The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}. | * You are expected to solve exercise 2 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercises session of **November 15**. The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}. | ||
- | ==== Lecture 8: Coping with System Failures ==== | + | ==== Lecture 7: Coping with System Failures ==== |
- | * During lecture 8 {{:teaching:infoh417:slides-lect8-part1.pdf|slides part 1}} {{:teaching:infoh417:slides-lect8-part2.pdf|slides part 2}} 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 7 {{:teaching:infoh417:slides-lect8-part1.pdf|slides part 1}} {{:teaching:infoh417:slides-lect8-part2.pdf|slides part 2}} 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, 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 ==== | ||
+ | |||
+ | * During lecture 8 we focused on solving integrated exercises 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}}. | ||
+ | |||
+ | * {{:teaching:infoh417:07-integrated-slides.pdf|The solutions are online.}} | ||
+ | |||
+ | |||
+ | ==== 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). | ||
+ | |||
+ | * 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**. | ||
+ | |||
+ | ==== Revision session ==== | ||
+ | |||
+ | Durig the lecture & exercise session of **Friday, december 6** 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 2 at the latest**. | ||
+ |