Differences

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

--- teaching:infoh417 [2017/10/13 12:46]
svsummer
+++ teaching:infoh417 [2018/10/05 13:41]
alesuiss [COURSE TRAJECTORY]
@@ Line 1: / Line 1: @@
 ====== INFO-H-417 : Database Systems Architecture ======
-<note warning>There will be **no** exercise session on wednesday 18/10 and 25/10, in contrast to what is indicated on gehol.</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]] by october 5 at the latest. It allows the course responsibles to contact you as well as get an idea of your background. </note>
 ===== GENERAL INFORMATION =====
@@ Line 54: / Line 54: @@
   * 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 29 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 28 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 62: / Line 62: @@
   * 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 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.
+  * 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 5. 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.
+ * 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 5. 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.
-==== Reading Assignment 1: Physical data organisation  ====
+  * 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.
-   * 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.
+==== Reading Assignment 1: Physical data organisation  ====
-==== Lecture 3: Index Structures  ====
+   * 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
-  * 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.
-==== 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.