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 [2017/10/11 18:14] svsummer |
teaching:infoh417 [2017/10/27 06:39] svsummer [COURSE TRAJECTORY] |
||
|---|---|---|---|
| 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 out [[https://docs.google.com/forms/d/e/1FAIpQLSeNNsjBE-zrhNulpldr3-z-PB8W5hHPDMcVFdho-0PGqgmvPw/viewform|this form]] by friday, | + | <note warning>There will be **no** exercise session on wednesday 18/10 and 25/10, in contrast to what is indicated on gehol.</note> |
| - | october 6 at the latest. This allows the course titulars to contact you if necessary, | + | |
| - | as well as gives them an overview of your background.</note> | + | |
| ===== GENERAL INFORMATION ===== | ===== GENERAL INFORMATION ===== | ||
| Line 77: | Line 75: | ||
| * 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. | * 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 II 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. | ||
| + | |||