LANNS: a web-scale approximate nearest neighbor lookup system

BANG is a billion-scale approximate nearest neighbor search system optimized for single GPU execution, enabling high-performance vector search in vector database environments at massive scale.

A unified system designed for efficient multi-index vector search, directly addressing large-scale vector database performance and scalability challenges.

This paper introduces the HNSW algorithm, which is widely adopted in vector databases and search engines for its efficient and robust performance on high-dimensional data. HNSW is foundational in powering modern vector search systems.

An influential paper analyzing and improving approximate nearest neighbor search methods for high-dimensional data, highly relevant for developing and understanding vector databases.

A curated GitHub repository of research papers and technical blogs focused on vector search, approximate nearest neighbor search (ANN Search), and vector databases. This resource serves as a comprehensive directory for foundational and cutting-edge research, making it highly relevant for anyone building or exploring vector database technologies.

Distributed disk-based approximate nearest neighbor system achieving near-linear throughput scaling. Delivers 6.21-6.49x throughput improvement over scatter-gather baseline with sub-6ms latency on 10 servers.