Differences

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

--- teaching:infoh417 [2017/12/08 09:06]
svsummer
+++ teaching:infoh417 [2018/07/29 15:25]
svsummer
@@ Line 1: / Line 1: @@
 ====== INFO-H-417 : Database Systems Architecture ======
-<note tip> The written exam of INFOH417 is planned on monday, 15 january 2018 from 14h30-18h00 in room S.UD2.120. The exam is closed book.
+<note tip> The 2nd session exam of INFOH417 is planned on thurday, 16 august 2018 from 8h00-11h30 in room S.UB2.147. The exam is closed book.
-To help you in preparing for the exam, a prior exam and its solution is now available: {{:teaching:infoh417:ex-2016-s1-sol.pdf|prior exam}}</note>
+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>
 ===== GENERAL INFORMATION =====
@@ Line 105: / Line 105: @@
   * 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 8**. **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 8**. **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 15**. {{: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 15**.  {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}}
+==== Revision session ====
+During the lecture & exercise session  of **Friday, december 15** 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 11 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 15**.