High-performance ANN vector search engine in modern C++ implementing HNSW, IVF, PQ, SQ8, IVF-SQ, and IVF-PQ with SIFT1M benchmarking.
-
Updated
Jun 12, 2026 - C++
High-performance ANN vector search engine in modern C++ implementing HNSW, IVF, PQ, SQ8, IVF-SQ, and IVF-PQ with SIFT1M benchmarking.
A comprehensive, multiprocessing-isolated benchmark for evaluating vector database performance and quality. Measures insertion speed, search latency (diverse, sequential, filtered, and bulk), recall accuracy, and memory usage across standard (ChromaDB, LanceDB, Qdrant, FAISS, USearch) and custom engine implementations.
Comparison of Hierarchical K-Means and HNSW for approximate nearest neighbor search on SIFT1M
Add a description, image, and links to the sift1m topic page so that developers can more easily learn about it.
To associate your repository with the sift1m topic, visit your repo's landing page and select "manage topics."