This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:infoh417 [2019/10/24 09:37] svsummer [COURSE TRAJECTORY] |
teaching:infoh417 [2019/10/24 15:04] svsummer |
||
|---|---|---|---|
| Line 82: | Line 82: | ||
| * 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. | ||