Differences

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

--- teaching:infoh417 [2016/12/02 09:01]
svsummer
+++ teaching:infoh417 [2016/12/08 09:17]
svsummer
@@ Line 101: / Line 101: @@
    * 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 **December 2**.
+  * 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 **December 2**.  The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}.
 ==== Lecture 8: Coping with System Failures  ====
@@ Line 109: / Line 109: @@
   * 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 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**.
+==== 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 16**.
+==== Revision session ====
+Durig the lecture & exercise session  of **Friday, december 16** 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 12 at the latest**.
+This last lecture also features a demo that illustrates how the theory on query optimization that we have studied is applied in practical database management systems.