
Approximate nearest neighbor (ANN) search relaxes the guarantee of exactness for efficiency by vector compression and by only searching a subset of \(\mathcal {D}\)  for each query. Searching a larger subset increases both accuracy and latency. We review some commonly used ANN methods, following closely the descriptions in [1]}, [2]}.
