Alternatives and similar repositories for 2i_bench

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

• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆55Updated last year
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 4 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆150Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆23Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 10 months ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆72Updated 4 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆62Updated 4 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 2 months ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• olivierjeunen / dynamicindex
  C++ source code for the Dynamic Index algorithm proposed in "Efficient Similarity Computation for Collaborative Filtering in Dynamic Envi…
  ☆16Updated 5 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 4 months ago
• simongog / sigir16-topkcomplete
  Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016
  ☆25Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years 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
• graindb / graindb
  ☆19Updated 3 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆32Updated 6 years ago
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆14Updated 2 years ago