Alternatives and similar repositories for annbench

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

• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last month
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆260Updated last year
• matsui528 / nanopq
  Pure python implementation of product quantization for nearest neighbor search
  ☆345Updated 2 weeks ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆209Updated 5 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆159Updated 4 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆66Updated 6 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
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆161Updated 4 months ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆379Updated last month
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 years ago
• yahoojapan / ngtd
  Serving NGT over HTTP or gRPC ※This project is not maintained. We have moved to a new product, [Vald](https://vald.vdaas.org) .
  ☆39Updated 5 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆69Updated last month
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆320Updated 3 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆121Updated 2 weeks ago
• yahoojapan / yskip
  Incremental Skip-gram Model with Negative Sampling
  ☆69Updated 5 years ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini. "Efficient Inverted Indexes for Approximate Retrieva…
  ☆70Updated last week
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆207Updated 3 years ago
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆148Updated this week
• zilliztech / BBAnn
  Block-based Approximate Nearest Neighbor
  ☆35Updated 3 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
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• ZJULearning / SSG
  code for satellite system graphs
  ☆120Updated last year
• wantedly / recsys2020-challenge
  ☆32Updated last year
• terrier-org / ecir2021tutorial
  ☆160Updated 4 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 11 months ago
• mti-lab / rnn-descent
  ☆22Updated last year