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
  ☆216Updated 5 years ago
• ZJULearning / nsg
  Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
  ☆708Updated 2 months ago
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated 4 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 2 months ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆68Updated 7 years ago
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆262Updated 2 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆167Updated 9 months ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 4 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆66Updated 6 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆122Updated 2 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆100Updated 2 months ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆297Updated 7 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆61Updated 6 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆170Updated 4 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆411Updated last week
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 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
• facebookresearch / distributed-faiss
  A library for building and serving multi-node distributed faiss indices.
  ☆271Updated 2 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆59Updated last year
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆71Updated 6 years ago
• arbabenko / GNOIMI
  ☆160Updated 9 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆72Updated 7 months ago
• yahoojapan / NGT
  Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
  ☆1,337Updated last month
• YannDubs / Hash-Embeddings
  PyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.
  ☆204Updated 7 years ago
• 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