Alternatives and similar repositories for BuRR:

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

• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated 3 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• wuwuz / Vacuum-Filter
  ☆50Updated 3 months 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
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated last month
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆85Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• jandrewrogers / AquaHash
  Fast Hash Functions Using AES Intrinsics
  ☆82Updated 5 years ago
• pdillinger / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆21Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆131Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆86Updated 5 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆68Updated 7 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆273Updated 2 months ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• peterboncz / bloomfilter-repro
  ☆25Updated 5 years ago