Alternatives and similar repositories for 2i_bench

Users that are interested in 2i_bench 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
  ☆23Updated last year
• 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
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆54Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆34Updated 3 months ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆81Updated 7 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆20Updated last week
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 7 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 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
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated 2 weeks ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• learnedsystems / LearnedSecondaryIndex
  A read-optimized learned index for unsorted data
  ☆31Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 2 months ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago