6.15 External Sorting
Sort datasets that exceed main memory by organizing the algorithm around sequential disk access, merge passes, and minimizing I/O operations.
5 notes
Sort datasets that exceed main memory by organizing the algorithm around sequential disk access, merge passes, and minimizing I/O operations.
Examine hash-based structures in complete systems: streaming pipelines, graph algorithms, caches, and distributed workflows.
Choose and implement hash tables that perform reliably under mixed key types, uneven access patterns, and adversarial input.
Design hash table layouts that minimize cache misses and align memory access patterns with hardware behavior.
Understand how memory hierarchy effects cause hash table performance to deviate from asymptotic expectations.