arxiv.org/abs/2405.13795 A Memory-Efficient Distributed Algorithm for Approximate Nearest Neighbour Search with Arbitrary Distances
PDASC is a distributed approximate nearest neighbour search algorithm built on a hierarchical index that supports arbitrary, non-metric dissimilarity functions while keeping per-node memory low. Benchmarks across datasets and distance functions show competitive accuracy-efficiency trade-offs with consistently lower per-node memory than state-of-the-art ANN methods.
— via arXiv Databases, Elena Garcia-Morato, Maria Jesus Algar, Cesar Alfaro, Felipe Ortega, Javier Gomez, Javier M. Moguerza
