Alternatives and similar repositories for flatnav:

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

• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆22Updated last year
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆22Updated 7 months ago
• CosimoRulli / emvb
  Implementation of "Efficient Multi-vector Dense Retrieval with Bit Vectors", ECIR 2024
  ☆60Updated 5 months ago
• TusKANNy / kannolo
  Official repository of kANNolo.
  ☆26Updated 4 months ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆155Updated 3 years ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…
  ☆56Updated 2 weeks ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 4 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆108Updated 10 months ago
• DeployQL / awesome-multi-vector
  A list of multi-vector retrieval resources
  ☆13Updated 9 months ago
• Shekhale / gbnns_dim_red
  Reducing Dimensionality method for Nearest Neighbor Search
  ☆14Updated 4 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…
  ☆137Updated last week
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆51Updated 4 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• cwida / PDX
  ⚡ Faster vector search with PDX: A vertical data layout for vectors
  ☆27Updated 2 weeks ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 4 years ago
• intel / ScalableVectorSearch
  ☆146Updated this week
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆30Updated this week
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆20Updated last month
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• Patrick-H-Chen / FINGER
  ☆13Updated last year
• WPJiang / HWTL_SDU-ANNS
  ☆70Updated 2 months ago
• nlescoua / faiss-quickeradc
  QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS
  ☆16Updated 5 years ago
• ThirdAIResearch / Dessert
  DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables
  ☆15Updated last year
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 4 months ago
• xinyandai / similarity-search
  A framework for index based similarity search.
  ☆19Updated 5 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• guestrin-lab / ACORN
  state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
  ☆69Updated 3 weeks 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