thomasahle / tinyknnLinks
A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF
☆18Updated 2 years ago
Alternatives and similar repositories for tinyknn
Users that are interested in tinyknn are comparing it to the libraries listed below
Sorting:
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 10 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…☆181Updated last month
- Quick ADC☆27Updated 6 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 5 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆59Updated 5 years ago
- Python bindings for the fast integer compression library FastPFor.☆61Updated 2 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
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆43Updated this week
- Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.☆35Updated 3 weeks ago
- Reducing Dimensionality method for Nearest Neighbor Search☆15Updated 5 years ago
- Graph Library for Approximate Similarity Search☆140Updated 5 months ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 7 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated 2 years ago
- LSH index for approximate set containment search☆61Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆220Updated 5 years ago
- A C++ library providing fast language model queries in compressed space.☆132Updated 2 years ago
- Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…☆104Updated last week
- ☆79Updated last year
- Fast and memory-efficient ANN with a subset-search functionality☆153Updated 7 months ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆175Updated 4 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Updated 3 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated 2 years ago
- ☆207Updated this week
- Fast and vectorizable algorithms for searching in a vector of sorted floating point numbers☆153Updated last year
- Large Scale Search Index☆32Updated 2 years ago
- PQ Fast Scan☆70Updated 6 years ago
- Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.☆89Updated 3 weeks ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆422Updated last month