Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
teaching:infoh417 [2019/11/15 09:01]
svsummer
teaching:infoh417 [2019/11/21 09:12]
svsummer [COURSE TRAJECTORY]
Line 90: Line 90:
   * In lecture 5 ({{:​teaching:​infoh417:​slides-lect6.pdf|slides}}),​ we study the basic algorithms for physical operators, together with their cost analysis. The details (including some algorithms not discussed during the lecture) can be found in chapter 15 sections 15.1 until 15.6, pages 701-746 (in the international edition) or pages 689-734 (in the new international edition). The interested reader is also advised to read Section 15.7 (although this will not be interrogated during the exam).   * In lecture 5 ({{:​teaching:​infoh417:​slides-lect6.pdf|slides}}),​ we study the basic algorithms for physical operators, together with their cost analysis. The details (including some algorithms not discussed during the lecture) can be found in chapter 15 sections 15.1 until 15.6, pages 701-746 (in the international edition) or pages 689-734 (in the new international edition). The interested reader is also advised to read Section 15.7 (although this will not be interrogated during the exam).
  
-  * You are expected to solve exercise 1 of the {{:​teaching:​infoh417:​03-physicalop-ex.pdf|physical operators exercises}} by the exercise session of November 8.  ​+  * You are expected to solve exercise 1 of the {{:​teaching:​infoh417:​03-physicalop-ex.pdf|physical operators exercises}} by the exercise session of November 8.  ​The {{:​teaching:​infoh417:​03-physicalop-sol-slides.pdf|solutions}} are online.
  
 ==== Lecture 6: Cost-Based Plan Selection ==== ==== Lecture 6: Cost-Based Plan Selection ====
    * During lecture 6 ({{:​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).    * During lecture 6 ({{:​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 15**.  +  * 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 ​{{:​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 ​{{:​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**.
 +
 +==== 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}}.
 +
 +==== 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**. ​
 + 
 
teaching/infoh417.txt · Last modified: 2020/09/10 08:46 by svsummer