Alternatives and similar repositories for hyperbitbit

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

• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆51Updated 7 months ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 10 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆33Updated 4 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 8 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆137Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆132Updated 2 years ago
• sfu-dis / tabular
  Tabular: Efficiently Building Efficient Indexes (VLDB 2025)
  ☆23Updated 9 months ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆84Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆64Updated 4 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆163Updated 6 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆132Updated last year
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆122Updated 10 months ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆166Updated last year
• cuckoo-trie / cuckoo-trie-code
  ☆57Updated last year
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 10 months ago