Alternatives and similar repositories for nanopq

Users that are interested in nanopq are comparing it to the libraries listed below

• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆219Updated 5 years ago
• ZJULearning / nsg
  Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
  ☆716Updated 3 months ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆153Updated 6 months ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆210Updated 4 years ago
• matsui528 / faiss_tips
  Some useful tips for faiss
  ☆628Updated 4 months ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆67Updated 8 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆123Updated 2 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆386Updated last year
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆264Updated 2 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆69Updated 6 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆295Updated 7 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆169Updated 10 months ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 4 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆61Updated 7 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆54Updated 7 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆172Updated 4 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆104Updated 4 months ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆417Updated 3 weeks ago
• arbabenko / GNOIMI
  ☆160Updated 9 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆35Updated 5 years ago
• matsui528 / annbench
  A lightweight benchmark for approximate nearest neighbor search
  ☆103Updated 2 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• kayzhu / LSHash
  A fast Python implementation of locality sensitive hashing.
  ☆674Updated 5 years ago
• ZJULearning / hashingSearch
  Search with a hash index
  ☆33Updated 6 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆72Updated 6 years ago
• facebookresearch / distributed-faiss
  A library for building and serving multi-node distributed faiss indices.
  ☆275Updated 2 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆59Updated 5 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆61Updated last year
• yahoo / lopq
  Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Pyth…
  ☆568Updated 6 years ago