thomasahle / tinyknn
A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF
☆16Updated last year
Alternatives and similar repositories for tinyknn:
Users that are interested in tinyknn are comparing it to the libraries listed below
- Parameterless and Universal FInding of Nearest Neighbors☆58Updated 2 weeks ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 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
- [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search☆73Updated 3 weeks ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆49Updated 4 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- Graph Library for Approximate Similarity Search☆104Updated 9 months ago
- A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…☆132Updated 2 weeks ago
- PQ Fast Scan☆60Updated 5 years ago
- Quick ADC☆25Updated 5 years ago
- ☆53Updated 5 months ago
- ☆142Updated this week
- Python bindings for the fast integer compression library FastPFor.☆58Updated last year
- Common Index File Format to to support interoperability between open-source IR engines☆31Updated 5 months ago
- Implementation of HNSW that supports online updates☆63Updated 7 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Reducing Dimensionality method for Nearest Neighbor Search☆14Updated 4 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆15Updated 5 years ago
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search☆66Updated 3 years ago
- ☆69Updated last month
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆50Updated 3 weeks ago
- Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024☆59Updated 4 months ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆27Updated 5 years ago
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆15Updated last year
- Knowhere is an open-source vector search engine, integrating FAISS, HNSW, etc.☆210Updated last year
- An implementation of learned index structures for bloom filters.☆23Updated 6 years ago
- Distributed similarity search☆9Updated 4 years ago
- Efficient and effective query auto-completion in C++.☆53Updated last year
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆154Updated 3 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆68Updated 2 years ago