Vector search

Given a query vector, find the nearest stored vectors — the k-nearest-neighbor problem. Exact search compares against everything (correct but O(N)); approximate nearest neighbor (ANN) structures give up a sliver of recall to answer in milliseconds at millions of vectors. This lesson sets up why hashmaps and B-trees are useless here and indexes are their replacement.