technicolor-research / quick-adcLinks
Quick ADC
☆25Updated 6 years ago
Alternatives and similar repositories for quick-adc
Users that are interested in quick-adc are comparing it to the libraries listed below
Sorting:
- PQ Fast Scan☆62Updated 6 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆61Updated 6 years ago
- Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…☆35Updated 5 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆54Updated 4 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆209Updated 5 years ago
- 为HSNW源码加上了详细的注释☆20Updated 2 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 3 months ago
- Implementation of HNSW that supports online updates☆66Updated 7 years ago
- LSH-GPU ANN package☆94Updated 6 years ago
- ☆167Updated this week
- Real time vector search engine☆138Updated 2 years ago
- ☆65Updated 9 months ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆17Updated 2 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆69Updated last month
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- ☆12Updated 6 years ago
- ☆16Updated 5 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆115Updated 2 weeks ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- ☆160Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆39Updated 3 weeks ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago