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/14 07:27] svsummer |
teaching:infoh417 [2019/10/17 09:21] svsummer |
||
|---|---|---|---|
| Line 71: | Line 71: | ||
| * 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. | * 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. | ||
| + | |||