Bloom filters: probabilistic membership at scale
How to use a Bloom filter to check membership across 100 million URLs without blowing up RAM — and why a hash set wouldn’t cut it.
Data-Structures
External merge sort: sorting datasets that don't fit in RAM
How external merge sort handles datasets larger than RAM, using sorted runs and k-way merging.