Vector search: HNSW in twenty minutes
How approximate nearest-neighbour search gets sub-linear without a space-partitioning tree.
Algorithms
Bloom filters, and when a probabilistic set is the right call
Trade a little certainty for a lot of memory — the math is friendlier than it looks.