Differences

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

--- teaching:infoh417 [2016/10/20 09:03]
svsummer
+++ teaching:infoh417 [2019/10/24 09:37]
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 important>If you are following this course, please fill in   [[https://docs.google.com/forms/d/e/1FAIpQLSeNNsjBE-zrhNulpldr3-z-PB8W5hHPDMcVFdho-0PGqgmvPw/viewform|this form]] **before october 1**. This allows the course responsibles to contact you if needed, and get a better overview of the participant's background.</note>
 ===== GENERAL INFORMATION =====
@@ Line 34: / Line 34: @@
     * The course is taught during the first semester
-    * The course schedule is available [[infoh417:horaire|on-line]]
     * The list of competences that will be taught during the course and interrogated during the exam is available in the {{:teaching:infoh417:course plan.pdf|course plan.}}
@@ Line 54: / Line 53: @@
   * During lecture 1 ({{:teaching:infoh417:slides-lect1.pdf|slides}}), we present an overview of the architecture of a query compiler (see chapter 16, sections 16.1, 16.3.1 and  16.3.2 in the book) and study the translation of SQL into the extended relational algebra (see {{:teaching:infoh417:sql2alg_eng.pdf|course notes}} for the full translation algorithm).
-  * 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.
+  * You are expected to solve exercise 1 of the {{:teaching:infoh417:01-sql2alg-ex.pdf|translation exercises (pdf)}} by the exercise session  of friday 27 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.
@@ Line 60: / Line 59: @@
 ==== Lecture 2: Optimization of Logical Query Plans  ====
-  * During lecture 2 ({{:teaching:infoh417:slides-lect2-handout.pdf|slides}}), we study optimization of the select-project-join expressions (see {{:teaching:infoh417:conjunctive_eng.pdf|course notes}} for the full optimization algorithm and its correctness). In addition, we discuss popular heuristics for improving general logical query plans: see chapter 16, section 16.3.3 in the book which discusses the simple (but very important) logical optimizations of “pushing” selections and projections; and recognizing joins, based on the algebraic equalities from section 16.2.
+  * During lecture 2 ({{:teaching:infoh417:slides-lect2.pdf|slides}}), we study optimization of the select-project-join expressions (see {{:teaching:infoh417:conjunctive_eng.pdf|course notes}} for the full optimization algorithm and its correctness). In addition, we discuss popular heuristics for improving general logical query plans: see chapter 16, section 16.3.3 in the book which discusses the simple (but very important) logical optimizations of “pushing” selections and projections; and recognizing joins, based on the algebraic equalities from section 16.2.
-  * You are expected to solve exercises 1.1, 3.1, 4.1, 5, 6, and 8.1 of the {{:teaching:infoh417:02-logicalopt-ex.pdf|optimization exercises}}  by the exercise session of friday, october 2. You are strongly advised to also try exercises 2, 3, and 4, although these exercises will not be corrected during that session. The remaining exercises give extra exercise possibilities.
+  * You are expected to solve exercises 1.1, 3.1, 4.1, 5, 6, and 8.1 of the {{:teaching:infoh417:02-logicalopt-ex.pdf|optimization exercises}}  by the exercise session of friday, october 6. You are strongly advised to also try exercises 2, 3, and 4, although these exercises will not be corrected during that session. The remaining exercises give extra exercise possibilities.
   * 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  ====
@@ Line 79: / Line 78: @@
 ==== 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.
+  * During Lecture 4 ({{:teaching:infoh417:slides-lect4-part1.pdf|slides}}, {{:teaching:infoh417:slides-ch13-indexstruc.odp|slides in OpenOffice Impress format}}) we have studied index structures based on hashing. Hash-based indexes are discussed in depth in section 14.3 and 15.7 in the book.
-==== Project Assignment: External Memory Algorithms ====
+  * In addition, we have also introduced data warehouses {{:teaching:infoh417:slides-lect5.pdf|slides}}) and motivated the need for multidimensional index structures. Subsequently, we  and have studied various index structures that deal gracefully with multidimensional search keys. See sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book.
-  * 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}}).