Modules 3, 3B, 3C: Storage, Indexing, Query Optimization

This PSET covers nanoDB: external sort and the join algorithms (block-nested-loop, sort-merge, hash-partition), B+tree and LSM indexing, and reading query plans. It has four scenario problems (join I/O cost at medium and challenge, and reading a query plan into its I/O cost at medium and challenge), plus concept checks. Before starting, you should have read the Module 3 content, attended the lectures, and completed the matching Colab walkthrough in your CA section.