Alternatives and similar repositories for fast-lopq

Users that are interested in fast-lopq are comparing it to the libraries listed below

• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• matsui528 / pqtable
  Fast search algorithm for product-quantized codes via hash-tables
  ☆53Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 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
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• RUSH-LAB / Flash
  LSH-GPU ANN package
  ☆94Updated 6 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 6 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago
• wlzhao22 / tsdg
  TSDG: An efficient index graph for graph-based nearest neighbor search
  ☆9Updated 2 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆209Updated 5 years ago
• cgtuebingen / Product-Quantization-Tree
  GPU-based large scale Approx. Nearest Neighbor Search, accepted at CVPR 2016
  ☆92Updated 6 years ago
• ZJULearning / RPLSH
  Kmeans Quantization + Random Projection based Locality Sensitive Hashing
  ☆28Updated 6 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• ZJULearning / efanna_graph
  an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework
  ☆95Updated 5 years ago
• arbabenko / Quantizations
  Source code for learning and evaluation different quantzation methods
  ☆26Updated 10 years ago
• fmaglia / BoI
  Multi-index hashing for the resolution of ANN search problem on large datasets
  ☆15Updated 6 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 11 months ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆207Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• arbabenko / MultiIndex
  Research code implementing inverted multiindex structure
  ☆83Updated 11 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
• arbabenko / GNOIMI
  ☆160Updated 8 years ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 6 years ago
• hellozting / CompositeQuantization
  ☆31Updated 7 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆161Updated 4 months ago
• una-dinosauria / local-search-quantization
  State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.
  ☆75Updated 7 years ago
• se4u / cylsh
  Cython/Python bindings of E2LSH by Andoni and Symmetric LSH for MIPS by Neyshabur
  ☆15Updated 9 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