nlescoua / faiss-quickeradc
QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
☆15Updated 5 years ago
Alternatives and similar repositories for faiss-quickeradc:
Users that are interested in faiss-quickeradc are comparing it to the libraries listed below
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆66Updated last month
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆49Updated 4 years ago
- ☆132Updated 3 weeks ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 5 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆19Updated this week
- Dictionary-based compression for inverted indexes.☆23Updated 5 years ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆129Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆67Updated 2 years ago
- Efficient and effective query auto-completion in C++.☆51Updated last year
- Artifacts for VBASE: Unifying Online Vector Similarity Search and Relational Queries via Relaxed Monotonicity☆44Updated last year
- ☆49Updated 4 months ago
- Extended tests for PMDK libraries and utilities☆11Updated 4 months ago
- PQ Fast Scan☆60Updated 5 years ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆149Updated 3 years ago
- Graph Library for Approximate Similarity Search☆101Updated 8 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- ☆21Updated 2 months ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆48Updated last year
- Block-based Approximate Nearest Neighbor☆33Updated 3 years ago
- ☆14Updated last year
- Lightning In-Memory Object Store☆44Updated 2 years ago
- Recoverable lock-free allocator based on LRMalloc☆47Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆25Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆64Updated 3 years ago
- ☆12Updated 7 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆29Updated 6 years ago
- ☆52Updated 8 months ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆145Updated 3 years ago