Differences

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

--- teaching:infoh417 [2016/10/20 09:09]
svsummer [INFO-H-417 : Database Systems Architecture]
+++ teaching:infoh417 [2017/01/12 09:26]
svsummer
@@ Line 1: / Line 1: @@
 ====== INFO-H-417 : Database Systems Architecture ======
-<note important>The project assignment has been posted (see course program below)</note>
+<note important> The written exam of INFOH417 is planned on monday, 16 january 2017 from 14h00-17h30 in room S.UB5.230. The exam is closed book.  As mentioned in class; you are allowed to use a calculator, provided that this is a bare-bones calculator without programming capabilities. If this is a programmable calculator, you are only allowed to use it after resetting its memory on site. Use of smartphones or other devices with communication capabilities are not allowed.</note>
+<note tip> The written exam of INFOH417 is planned on monday, 16 january 2017 from 14h00-17h30 in room S.UB5.230. 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>
+<note important>The project gropus are posted (see [[http://cs.ulb.ac.be/public/teaching/infoh417/project|project page]])</note>
 ===== GENERAL INFORMATION =====
@@ Line 84: / Line 90: @@
   * In this assignment you are asked to implement an external-memory merge-sort algorithm, and examine its performance under different parameters. Be sure to visit the [[teaching:infoh417:project|project's page]] for full details and modalities.
-==== Reading Assignment 2: Multidimensional Index Structures ====
+==== Reading Assignment 2 and lecture 5: Multidimensional Index Structures ====
+  * There is no class on friday 28 October. Instead you are asked to read sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book.  This concerns various index structures that deal gracefully with multidimensional search keys ({{:teaching:infoh417:slides-lect5.pdf|slides}}).
+==== Lecture 6: Physical Operators ====
+  * In lecture 6 ({{: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 25.  The {{:teaching:infoh417:03-physicalop-sol-slides.pdf|solutions}} are online.
+==== Lecture 7: Cost-Based Plan Selection ====
+   * 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**.  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 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 9**. **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 9**. {{: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,c,e), 18.8.1(b,d), 18.8.2 (a,c) by the response lecture of **Friday, December 16**. Given that we have not studied validation based schedulers, you do not need to prepare exercise 18.9.1 (c,f).  {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}}
+==== 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**.
-  * There is no class on friday 28 October. Instead you are asked to read sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book.  This concerns we will study various index structures that deal gracefully with multidimensional search keys ({{:teaching:infoh417:slides-lect5.pdf|slides}}).
+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.