Differences

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

--- teaching:infoh417 [2016/10/05 17:53]
svsummer [COURSE TRAJECTORY]
+++ teaching:infoh417 [2016/12/16 14:52]
svsummer [COURSE TRAJECTORY]
@@ Line 1: / Line 1: @@
 ====== INFO-H-417 : Database Systems Architecture ======
-<note important>If you are following this course, please fill out [[https://docs.google.com/forms/d/e/1FAIpQLSeNNsjBE-zrhNulpldr3-z-PB8W5hHPDMcVFdho-0PGqgmvPw/viewform|this form]] by sept 30 at the latest. This allows the course responsibles to contact you directly through email when needed (since not all students are formally registered for the course in the ULB system yet). It also gives the course responsibles an overview of you background.
-</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 55: / Line 58: @@
   * You are expected to solve exercise 1 of the {{:teaching:infoh417:01-sql2alg-ex.pdf|translation exercises (pdf)}} by the exercise session  of friday 30 september. Exercise 2 gives extra exercise possibilities, but will not be corrected in class.
+  * The {{:teaching:infoh417:01_-_sql2alg-sol-slides.pdf|solutions}} of the translation exercises are available.
 ==== Lecture 2: Optimization of Logical Query Plans  ====
@@ Line 63: / Line 68: @@
   * A summary of [[:teaching:infoh417:logicalopt-additional|common questions and answers, mistakes and questions regarding the optimization of logical query plans]] is also available.
+  * The {{:teaching:infoh417:02_-_logicalopt-sol-slides.pdf|solutions}} of the optimization exercises are online.
 ==== Reading Assignment 1: Physical data organisation  ====
    * We take an intermezzo in the compilation of SQL to logical query plans, and consider how a DBMS physically organizes its data on disk.  ({{:teaching:infoh417:slides-ra1.pdf|slides}}). The details may be found in chapter 13 of the book and constitute the first reading assignment.
+==== Lecture 3: Index Structures  ====
+  * During Lecture 3 ({{:teaching:infoh417:slides-lect3-part1.pdf|slides part I}},  {{:teaching:infoh417:slides-lect3-part2.pdf|slides part II}}) we study sparse and dense index structures, and BTrees. The details are found in chapter 14, sections 14.1 and 14.2 in the book.
+==== Lecture 4: More Index Structures  ====
+  * During Lecture 4 ({{:teaching:infoh417:slides-lect4-part1.pdf|slides part I}}, {{:teaching:infoh417:slides-lect4-part2.pdf|slides part II}}, {{:teaching:infoh417:slides-ch13-indexstruc.odp|slides part II in OpenOffice Impress format}}) we have studied index structures based on hashing, and discussed the typical architecture of a DBMS. The details are found in section 14.3 and 15.7 in the book.
+==== Project Assignment: External Memory Algorithms ====
+  * 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 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**.
+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.