rizkg / BBHashLinks
Bloom-filter based minimal perfect hash function library
☆266Updated last month
Alternatives and similar repositories for BBHash
Users that are interested in BBHash are comparing it to the libraries listed below
Sorting:
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Succinct Data Structure Library 3.0☆96Updated 3 weeks ago
- BitMagic Library☆428Updated 2 weeks ago
- Dynamic succinct/compressed data structures☆112Updated last year
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- Fast Approximate Membership Filters (C++)☆281Updated 2 weeks ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Fast integer compression in C using the StreamVByte codec☆407Updated 7 months ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Rolling Hash C++ Library☆187Updated last year
- Compact Data Structures Library☆128Updated 11 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- A collection of succinct data structures☆209Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- A lightweight suffix-sorting library☆390Updated 5 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆438Updated 2 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Header-only binary fuse and xor filter library☆409Updated 2 weeks ago
- A benchmark for sorting algorithms☆61Updated 4 years ago