Alternatives and similar repositories for faiss-quickeradc:

Users that are interested in faiss-quickeradc are comparing it to the libraries listed below

• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆50Updated 4 years ago
• intel / ScalableVectorSearch
  ☆146Updated this week
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 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…
  ☆135Updated this week
• jermp / psds
  Efficient Prefix-Sum data structures in C++.
  ☆25Updated last year
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆53Updated last year
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆67Updated 2 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆60Updated 5 years ago
• gaoj0017 / RaBitQ
  [SIGMOD 2024] RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
  ☆87Updated 2 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆32Updated 6 months ago
• sillycross / mlpds
  MlpIndex - Extremely fast ordered index via memory level parallelism
  ☆12Updated 6 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆21Updated last year
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆50Updated 2 months ago
• jermp / tongrams_estimation
  A C++ library implementing fast language models estimation using the 1-Sort algorithm.
  ☆17Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆155Updated 3 years ago
• zilliztech / starling
  ☆56Updated 6 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆107Updated 10 months ago
• thomasahle / tinyknn
  A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF
  ☆16Updated last year
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆15Updated last week
• zilliztech / BBAnn
  Block-based Approximate Nearest Neighbor
  ☆34Updated 3 years ago
• Shekhale / gbnns_dim_red
  Reducing Dimensionality method for Nearest Neighbor Search
  ☆14Updated 4 years ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 4 months ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆20Updated last month
• whenever5225 / GraphANNS
  Graph-based Approximate Nearest Neighbor Search Working off CGraph
  ☆34Updated 8 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆19Updated 9 years ago