Differences

This shows you the differences between two versions of the page.

--- teaching:infoh417 [2018/11/19 12:47]
svsummer
+++ teaching:infoh417 [2018/12/14 09:39]
svsummer
@@ Line 2: / Line 2: @@
 <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 tip> The teaching slides are available {{:teaching:infoh417:slides_eng.pdf|as one big file}} (this excludes the slides on one-dimensional index structures as well as dealing with errors). </note>
@@ Line 98: / Line 101: @@
    * During lecture 7 ({{:teaching:infoh417:slides-lect7.pdf|slides}}), we 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 23**.
+  * 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 23**. The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}.
+==== 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 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, December 7**. **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 14**.  {{: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 (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,d,e) by the response lecture of **Friday, December 14**.   {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}}