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/10/03 08:58] svsummer |
teaching:infoh417 [2019/10/24 09:37] svsummer [COURSE TRAJECTORY] |
||
|---|---|---|---|
| Line 54: | Line 54: | ||
| * 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. | * 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 ==== | ==== Lecture 2: Optimization of Logical Query Plans ==== | ||
| Line 62: | 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. | ||
| + | |||
| + | ==== Lecture 4: More Index Structures ==== | ||
| + | |||
| + | * 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. | ||
| + | | ||
| + | * 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. | ||
| + | |||