Join algorithms: nested loop, hash join, sort-merge
How block nested loop, hash, Grace hash and sort-merge joins differ in page I/Os, and why memory M decides which one wins: once, 3 trips, or up to M² pages.
Part of Query optimization.
Read first
- External merge sort: sorting data bigger than memory
How a database sorts data far bigger than memory with two-phase multiway merge sort (TPMMS): two passes over the data handle about M² pages.
Read next
- Undo and redo logging: write-ahead logging (WAL)
How write-ahead logging (WAL) makes transactions atomic and durable: undo, redo and undo/redo logs, their write rules, crash recovery, steal and force.