Alternatives and similar repositories for BBHash

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

• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆436Updated 3 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆287Updated 3 months ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆99Updated last week
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆164Updated 10 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆411Updated 9 months ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆130Updated 2 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆248Updated 3 weeks ago
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆440Updated 4 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆511Updated 2 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆397Updated 5 years ago
• kimwalisch / libpopcnt
  🚀 Fast C/C++ bit population count library
  ☆355Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆91Updated last year
• mklarqvist / libalgebra
  Fast C header-only library for popcnt, pospopcnt, and set algebraic operations
  ☆46Updated 5 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆232Updated 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
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆62Updated 4 years ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆350Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• FastFilter / xor_singleheader
  Header-only binary fuse and xor filter library
  ☆410Updated 3 months ago