Nov 2: hashing (slides of lecture 12 (cont.) and lecture 13):
separate overflow; overflow with chaining; differential files.
Nov 4: hashing (slides of lecture 14): hash file reorganization.
Tutorial: examples of separate overflow with chaining;
comments on assignment 2; bloom filters.
Nov 9: index files (slides of lecture 15):
introduction; flat and multi-level indexes.
Nov 11: dynamic indexed files (slides of lecture 16):
binary and multi-way trees; B-trees (insertions).
Tutorial: comments on assignment 2; indexed files example.
Nov 16: B-trees (slides of lecture 17):
sequential retrievals, deletions.
Nov 18: B+ trees (slides of lecture 18):
introduction, insertions, and deletions; assignment 3 handed out.
Tutorial: comments on assignment 3; B-trees example.
Nov 23: comments on assignment 3.
Nov 25: multikey files (slides of lecture 19): secondary keys,
inverted lists; query processing (slides of lecture 20).
Tutorial: comments on assignment 3; B+ trees example.