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/24 09:36] svsummer |
teaching:infoh417 [2019/10/29 08:05] svsummer |
||
|---|---|---|---|
| Line 78: | Line 78: | ||
| ==== Lecture 4: More Index Structures ==== | ==== 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. Hash-based indexes are discussed in depth in section 14.3 and 15.7 in the book. | + | * 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. | * 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. | ||
| + | ==== 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 5: Physical Operators ==== | ||
| + | |||
| + | * In lecture 5 ({{: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 8. | ||