Approximate Nearest Neighbor Search in High Dimensions

Authors: P. Indyk, R. Motwani
Year: 1998
Summary: A seminal paper on Approximate Nearest Neighbor (ANN) search algorithms. It introduces techniques like Locality-Sensitive Hashing (LSH) that allow for sub-linear time search in high-dimensional spaces, which is the foundation for fast memory retrieval in modern vector databases.
Link: https://dl.acm.org/doi/10.1145/276698.276876