matsui528 / nanopq
Pure python implementation of product quantization for nearest neighbor search
☆339Updated last year
Alternatives and similar repositories for nanopq:
Users that are interested in nanopq are comparing it to the libraries listed below
- Navigating Spreading-out Graph For Approximate Nearest Neighbor Search☆665Updated last year
- Fast and memory-efficient ANN with a subset-search functionality☆154Updated last year
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆205Updated 4 years ago
- code for satellite system graphs☆117Updated last year
- fast library for ANN search and KNN graph construction☆288Updated 7 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆93Updated 5 years ago
- Some useful tips for faiss☆616Updated last year
- Fast and memory-efficient clustering☆256Updated last year
- Open source implementation of "Spreading Vectors for Similarity Search"☆319Updated 3 years ago
- Implementation of HNSW that supports online updates☆64Updated 7 years ago
- A library for k-nearest neighbor search☆385Updated 10 months ago
- A lightweight benchmark for approximate nearest neighbor search☆101Updated last year
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆207Updated 3 years ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆155Updated 3 years ago
- GGNN: State of the Art Graph-based GPU Nearest Neighbor Search☆153Updated last month
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Pyth…☆564Updated 5 years ago
- ☆160Updated 8 years ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆366Updated last month
- PQ Fast Scan☆60Updated 5 years ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆67Updated 2 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆60Updated 6 years ago
- hnsw implemented by python☆66Updated 5 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
- FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)☆1,149Updated 9 months ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆50Updated 4 years ago
- Graph Library for Approximate Similarity Search☆107Updated 10 months ago
- Visual Search using Apache MXNet and gluon☆236Updated 6 years ago
- Research code implementing inverted multiindex structure☆82Updated 11 years ago