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/10/20 09:09]
svsummer [INFO-H-417 : Database Systems Architecture]
@@ 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 important>The project assignment has been posted (see course program below)</note>
 ===== GENERAL INFORMATION =====
@@ Line 55: / Line 54: @@
   * 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 64: @@
   * 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: 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 we will study various index structures that deal gracefully with multidimensional search keys ({{:teaching:infoh417:slides-lect5.pdf|slides}}).