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
  ☆50Updated 6 months ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• fdbresearch / LMFAO
  Layered Multiple Functional Aggregate Optimization
  ☆17Updated 5 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆131Updated 2 years ago
• stanford-futuredata / index-baselines
  Simple baselines for "Learned Indexes"
  ☆159Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 2 years ago
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆64Updated 4 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 4 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 10 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆32Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 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)
  ☆83Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆121Updated 9 months ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆47Updated 7 months ago
• frankmcsherry / COST
  Single-threaded graph computation in Rust
  ☆257Updated 6 years ago
• learnedsystems / RadixSpline
  A Single-Pass Learned Index
  ☆135Updated 2 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆127Updated 5 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 9 months ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆88Updated 8 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 9 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 4 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆86Updated 2 years ago