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 [2015/11/13 13:40] svsummer |
teaching:infoh417 [2015/12/04 16:01] svsummer |
||
|---|---|---|---|
| Line 2: | Line 2: | ||
| - | <note important>If you are following this course, it is mandatory that you fill out [[https://docs.google.com/forms/d/1R5gEJiYDUpCyZBzfIvneVmEwJkr3UxCfbn3-j1hl43E/viewform|this form]] by **friday, 25 september at the latest**. This enables the course instructors to contact you in the future, as well as form an idea on your background.</note> | + | |
| + | <note tip> The written exam of INFOH417 is planned on monday, 11 january 2015 from 14h00-17h30 in room S.DC2.223. The exam is closed book. | ||
| + | |||
| + | To help you in preparing for the exam, two prior exams are now available: {{:teaching:infoh417:ex-2011-s2.pdf|prior exam 1}} and {{:teaching:infoh417:ex-2012-s1.pdf|prior exam 2}}</note> | ||
| Line 108: | Line 111: | ||
| * During lecture 7 ({{:teaching:infoh417:slides-lect7.pdf|slides}}), we will study the problems that occur when translating a logical query plan into an (optimal) physical query plan (i.e., estimating the sizes of subresults and join ordering). The details can be found in Chapter 16 (Sections 16.4 until 16.8, pages 792-839 in the international edition or pages 780-827 in the new international edition). | * During lecture 7 ({{:teaching:infoh417:slides-lect7.pdf|slides}}), we will study the problems that occur when translating a logical query plan into an (optimal) physical query plan (i.e., estimating the sizes of subresults and join ordering). The details can be found in Chapter 16 (Sections 16.4 until 16.8, pages 792-839 in the international edition or pages 780-827 in the new international edition). | ||
| - | * 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 27**. | + | * 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 27**. The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}. |
| ==== Lecture 8: Coping with System Failures ==== | ==== Lecture 8: Coping with System Failures ==== | ||
| * 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 4**. **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 4**. **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 4**. {{:teaching:infoh417:05_-_logging-sol-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 (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 4**. {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}} | ||
| + | |||
| + | ==== Revision session ==== | ||
| + | |||
| + | Durig the lecture & exercise session of **Friday, december 11** 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 7 at the latest**. | ||
| - | * 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 4**. | ||