nlescoua / faiss-quickeradcLinks
QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
☆16Updated 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
Sorting:
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆54Updated 4 years ago
- ☆167Updated this week
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆26Updated last week
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆27Updated last month
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆69Updated last month
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Lightning In-Memory Object Store☆46Updated 3 years ago
- Distributed similarity search☆9Updated 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…☆148Updated this week
- PQ Fast Scan☆62Updated 6 years ago
- ☆12Updated 7 years ago
- Artifacts for VBASE: Unifying Online Vector Similarity Search and Relational Queries via Relaxed Monotonicity☆46Updated last year
- Extended tests for PMDK libraries and utilities☆11Updated this week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆115Updated 2 weeks ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆22Updated 7 months ago
- Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.☆80Updated 5 months ago
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆55Updated 5 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated 2 months ago
- AirIndex: Versatile Index Tuning Through Data and Storage☆10Updated 6 months ago
- ☆19Updated 3 years ago
- MSVBASE is a system that efficiently supports complex queries of both approximate similarity search and relational operators. It integrat…☆94Updated 7 months ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Block-based Approximate Nearest Neighbor☆35Updated 3 years ago
- Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"☆15Updated 4 months ago