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 [2018/12/14 09:39] svsummer |
teaching:infoh417 [2019/09/10 12:14] svsummer |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ====== INFO-H-417 : Database Systems Architecture ====== | ====== INFO-H-417 : Database Systems Architecture ====== | ||
| - | <note tip> To help you in preparing for the exam, two prior exams and their solution are now available: {{:teaching:infoh417:ex-2016-s1-sol.pdf|prior exam 1}} {{:teaching:infoh417:ex-2014-s1-it4bi-sol.pdf|prior exam 2}}</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> |
| - | + | ||
| - | <note tip> The teaching slides are available {{:teaching:infoh417:slides_eng.pdf|as one big file}} (this excludes the slides on one-dimensional index structures as well as dealing with errors). </note> | + | |
| - | + | ||
| ===== GENERAL INFORMATION ===== | ===== GENERAL INFORMATION ===== | ||
| Line 38: | 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 58: | 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. |
| - | * The {{:teaching:infoh417:01_-_sql2alg-sol-slides.pdf|solutions}} of the translation exercises are available. | ||
| - | |||
| - | ==== 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 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. | ||
| - | |||
| - | ==== 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 I 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. | ||
| - | |||
| - | ==== Lecture 5: Multidimensional Index Structures ==== | ||
| - | |||
| - | * During lecture 5 ({{:teaching:infoh417:slides-lect5.pdf|slides}}) we study various index structures that deal gracefully with multidimensional search keys. The details may be found in sections 14.4-14.6, pages 661-688 (in the international edition) or pages 649-676 (in the new international edition) of the book. | ||
| - | |||
| - | ==== Lecture 6: Physical Operators ==== | ||
| - | |||
| - | * In lecture 6 ({{:teaching:infoh417:slides-lect6.pdf|slides}}), we study the basic algorithms for physical operators, together with their cost analysis. The details (including some algorithms not discussed during the lecture) can be found in chapter 15 sections 15.1 until 15.6, pages 701-746 (in the international edition) or pages 689-734 (in the new international edition). The interested reader is also advised to read Section 15.7 (although this will not be interrogated during the exam). | ||
| - | |||
| - | * You are expected to solve exercise 1 of the {{:teaching:infoh417:03-physicalop-ex.pdf|physical operators exercises}} by the exercise session of November 16. The {{:teaching:infoh417:03-physicalop-sol-slides.pdf|solutions}} are online. | ||
| - | |||
| - | ==== Lecture 7: Cost-Based Plan Selection ==== | ||
| - | * During lecture 7 ({{:teaching:infoh417:slides-lect7.pdf|slides}}), we study the problems that occur when translating a logical query plan into an (optimal) physical query plan (i.e., estimating the sizes of subresults and join ordering). The details can be found in Chapter 16 (Sections 16.4 until 16.8, pages 792-839 in the international edition or pages 780-827 in the new international edition). | ||
| - | |||
| - | * You are expected to solve exercise 2 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercises session of **November 23**. The solutions {{:teaching:infoh417:04-costbasedsel-sol-slides.pdf|are online}}. | ||
| - | |||
| - | ==== Lecture 8: Coping with System Failures ==== | ||
| - | |||
| - | * During lecture 8 {{:teaching:infoh417:slides-lect8-part1.pdf|slides part 1}} {{:teaching:infoh417:slides-lect8-part2.pdf|slides part 2}} we gave a short introduction to transaction processing in general, and dove into coping with systems failures in particular. The details may be found in chapter 17 of the book. | ||
| - | |||
| - | * You are expected to solve the integrated exercise 8.2 of the {{:teaching:infoh417:02-logicalopt-ex.pdf|optimization exercises}}, and 3.5 of the {{:teaching:infoh417:04-costbasedsel-ex.pdf|cost-based plan selection exercises}} by the exercise session of **Friday, December 7**. **It is strongly suggested that you try doing these exercises, as they are typical exam questions.** {{:teaching:infoh417:07-integrated-slides.pdf|The solutions are online.}} | ||
| - | | ||
| - | |||
| - | * You are expected to solve exercises 17.2.2, 17.2.4, 17.2.5, 17.2.7, 17.3.2, 17.3.3, 17.3.4, 17.3.5, 17.4.2, 17.4.3, 17.4.4, and 17.4.5 in the book by exercise session of **Friday, December 14**. {{:teaching:infoh417:05_-_logging-sol-slides.pdf|The solutions are online.}} | ||
| - | |||
| - | ==== Lecture 9: Concurrency control ==== | ||
| - | |||
| - | * During lecture 9 ({{:teaching:infoh417:slides-lect9.pdf|slides}}), we studied the problems that can occur when a database runs many transactions concurrently and the different kinds of scheduling algorithms that can prevent these problems. The details can be found Chapter 18 (sections 18.5, 18.6. 18.7 is excluded as is section 18.9 on validation-based schedulers). | ||
| - | * You are expected to solve exercises 18.2.4(b,d,e) by the response lecture of **Friday, December 14**. {{:teaching:infoh417:06_-_concurrency.pdf|The solutions are online.}} | ||