technicolor-research / quick-adc
Quick ADC
☆25Updated 5 years ago
Alternatives and similar repositories for quick-adc:
Users that are interested in quick-adc are comparing it to the libraries listed below
- PQ Fast Scan☆60Updated 5 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆60Updated 6 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…☆34Updated 4 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"☆51Updated 4 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆205Updated 4 years ago
- ☆146Updated this week
- 为HSNW源码加上了详细的注释☆19Updated 2 years ago
- [SIGMOD 2025] Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Ne…☆25Updated last month
- ☆56Updated 6 months ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆87Updated 2 months ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆27Updated 5 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆67Updated 2 years ago
- A data structure and algorithm library built for TerarkDB☆62Updated 2 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆153Updated last month
- Implementation of HNSW that supports online updates☆64Updated 7 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 2 weeks ago
- Benchmarking In-Memory Index Structures☆26Updated 6 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…☆137Updated last week
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆15Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- TSDG: An efficient index graph for graph-based nearest neighbor search☆9Updated 2 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆16Updated last year
- Block-based Approximate Nearest Neighbor☆34Updated 3 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year