Alternatives and similar repositories for SRS

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

• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 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…
  ☆35Updated 5 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆210Updated 4 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆67Updated 8 years ago
• ZJULearning / efanna
  fast library for ANN search and KNN graph construction
  ☆295Updated 7 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆122Updated 2 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 7 years ago
• aaalgo / kgraph
  A library for k-nearest neighbor search
  ☆385Updated last year
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆34Updated 8 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
• cuMF / cumf_sgd
  CUDA Matrix Factorization Library with Stochastic Gradient Descent (SGD)
  ☆71Updated 7 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆219Updated 5 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆103Updated 3 months ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆19Updated 8 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆68Updated 6 years ago
• gamboviol / lsh
  locality sensitive hashing
  ☆75Updated 13 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• cmdevries / LMW-tree
  Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering
  ☆78Updated 3 years ago
• lijinf2 / losha
  Distributed similarity search
  ☆10Updated 5 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
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• rjagerman / glintlda
  Scalable Distributed LDA implementation for Spark & Glint
  ☆29Updated 9 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆31Updated 6 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• arbabenko / GNOIMI
  ☆160Updated 9 years ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆83Updated 12 years ago