Alternatives and similar repositories for nanopq

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

• ZJULearning / nsg
  Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
  ☆674Updated last year
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated 3 weeks ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆209Updated 5 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆120Updated last year
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆66Updated 6 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆320Updated 3 years ago
• matsui528 / annbench
  A lightweight benchmark for approximate nearest neighbor search
  ☆102Updated 2 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆157Updated 3 months ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆207Updated 3 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆379Updated 2 weeks ago
• matsui528 / faiss_tips
  Some useful tips for faiss
  ☆622Updated last year
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆94Updated 5 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆158Updated 4 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆69Updated last month
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆260Updated last year
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆289Updated 7 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆386Updated last year
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆60Updated 6 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆118Updated 2 weeks ago
• FALCONN-LIB / FALCONN
  FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
  ☆1,151Updated last year
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• YannDubs / Hash-Embeddings
  PyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.
  ☆197Updated 6 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• xinyandai / product-quantization
  Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…
  ☆59Updated 4 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 10 months ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 years ago