Alternatives and similar repositories for nanopq:

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

• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last year
• ZJULearning / nsg
  Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
  ☆659Updated last year
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆203Updated 4 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆364Updated this week
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆63Updated 7 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆383Updated 9 months ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆64Updated 5 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆117Updated last year
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆206Updated 3 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆52Updated 6 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 3 years ago
• matsui528 / faiss_tips
  Some useful tips for faiss
  ☆616Updated last year
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆60Updated 5 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆152Updated last week
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆68Updated 2 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆154Updated 3 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆288Updated 7 years ago
• technicolor-research / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆60Updated 6 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆93Updated 5 years ago
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆34Updated 4 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆93Updated 5 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆49Updated 4 years ago
• yahoojapan / NGT
  Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
  ☆1,285Updated 3 weeks ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆104Updated 9 months ago
• YannDubs / Hash-Embeddings
  PyTorch implementation of Hash Embeddings (NIPS 2017). Submission to the NIPS Implementation Challenge.
  ☆193Updated 6 years ago
• kayzhu / LSHash
  A fast Python implementation of locality sensitive hashing.
  ☆662Updated 4 years ago
• hudengjunai / DeepEmbeding
  图像检索和向量搜索，similarity learning,compare deep metric and deep-hashing applying in image retrieval
  ☆127Updated 4 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆82Updated 11 years ago