Alternatives and similar repositories for annbench:

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

• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆256Updated last year
• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last year
• matsui528 / nanopq
  Pure python implementation of product quantization for nearest neighbor search
  ☆338Updated last year
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆49Updated 4 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
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆52Updated 6 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆149Updated this week
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆63Updated 7 years ago
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆64Updated 5 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆153Updated 3 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆67Updated 2 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• yahoojapan / yskip
  Incremental Skip-gram Model with Negative Sampling
  ☆69Updated 5 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) .
  ☆38Updated 4 years ago
• wantedly / recsys2020-challenge
  ☆32Updated last year
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆363Updated this week
• nyanp / streamdf
  lightweight, fast and robust columnar dataframe for data analytics with online update
  ☆23Updated 3 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆60Updated 5 years ago
• shiroyagicorp / sitq
  Learning to Hash for Maximum Inner Product Search
  ☆13Updated 3 years ago
• yahoojapan / vespa-tutorial
  Japanese tutorial for Vespa
  ☆20Updated 6 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆203Updated 4 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆104Updated 9 months 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…
  ☆132Updated last week
• yagays / embedrank
  Python Implementation of EmbedRank
  ☆49Updated 5 years ago
• yagays / swem
  Python implementation of SWEM (Simple Word-Embedding-based Methods)
  ☆29Updated 2 years ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…
  ☆52Updated 2 months ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 7 years ago
• yagays / nayose-wikipedia-ja
  Wikipediaから作成した日本語名寄せデータセット
  ☆34Updated 4 years ago
• phalanx-hk / kaggle_practice
  ☆33Updated 3 years ago
• sbintuitions / JMTEB
  The evaluation scripts of JMTEB (Japanese Massive Text Embedding Benchmark)
  ☆47Updated 2 months ago