This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:infoh417 [2017/10/19 08:47] svsummer |
teaching:infoh417 [2019/10/04 15:13] svsummer |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== INFO-H-417 : Database Systems Architecture ====== | ====== 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]] **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 ===== | ===== GENERAL INFORMATION ===== | ||
| Line 34: | Line 34: | ||
| * The course is taught during the first semester | * 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.}} | * 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). | * 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 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. | * The {{:teaching:infoh417:01_-_sql2alg-sol-slides.pdf|solutions}} of the translation exercises are available. | ||
| - | |||
| ==== Lecture 2: Optimization of Logical Query Plans ==== | ==== Lecture 2: Optimization of Logical Query Plans ==== | ||
| Line 65: | 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. | * 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. | ||
| - | |||
| - | ==== 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. | ||
| - | |||
| - | ==== 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. | ||
| - | | ||