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 [2019/09/10 12:10] svsummer |
teaching:infoh417 [2019/10/03 08:58] svsummer |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== INFO-H-417 : Database Systems Architecture ====== | ====== INFO-H-417 : Database Systems Architecture ====== | ||
| + | <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 52: | 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 28 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. |
| - | + | ||
| + | ==== Lecture 2: Optimization of Logical Query Plans ==== | ||
| + | |||
| + | * 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. | ||
| + | |||
| + | * A summary of [[:teaching:infoh417:logicalopt-additional|common questions and answers, mistakes and questions regarding the optimization of logical query plans]] is also available. | ||