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 year
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆259Updated last year
• matsui528 / nanopq
  Pure python implementation of product quantization for nearest neighbor search
  ☆340Updated last year
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆208Updated 4 years 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
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆66Updated 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) .
  ☆39Updated 4 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆155Updated 4 years ago
• shiroyagicorp / sitq
  Learning to Hash for Maximum Inner Product Search
  ☆13Updated 3 years ago
• 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
  ☆154Updated 2 months ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…
  ☆60Updated this week
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 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
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆113Updated 11 months ago
• facebookresearch / spreadingvectors
  Open source implementation of "Spreading Vectors for Similarity Search"
  ☆319Updated 3 years ago
• yahoojapan / yskip
  Incremental Skip-gram Model with Negative Sampling
  ☆69Updated 5 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…
  ☆140Updated this week
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆65Updated 7 years ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• nyanp / streamdf
  lightweight, fast and robust columnar dataframe for data analytics with online update
  ☆23Updated 3 years ago
• daac-tools / python-daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
  ☆16Updated last month
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆373Updated this week
• yagays / embedrank
  Python Implementation of EmbedRank
  ☆49Updated 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
• kampersanda / sif-embedding
  Rust implementation of SIF and uSIF: Simple and fast sentence embedding
  ☆19Updated 2 months ago
• WorksApplications / uzushio
  ☆20Updated 2 months 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
• phalanx-hk / kaggle_practice
  ☆33Updated 4 years ago
• ishikei14k / atma11_1st_solution
  ☆17Updated 3 years ago