rizkg / BBHashLinks
Bloom-filter based minimal perfect hash function library
☆270Updated 5 months ago
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☆65Updated last year
- BitMagic Library☆438Updated 4 months ago
- Succinct Data Structure Library 3.0☆100Updated 3 weeks ago
- Dynamic succinct/compressed data structures☆112Updated 2 weeks ago
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆131Updated 2 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 11 months ago
- Compact Data Structures Library☆101Updated 3 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆249Updated last month
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A collection of succinct data structures☆211Updated 2 years ago
- Fast integer compression in C using the StreamVByte codec☆412Updated 10 months ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆441Updated 5 months ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- Succinct Data Structure Library☆109Updated 12 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago
- A fast alternative to the modulo reduction☆315Updated 4 years ago
- Succinct data structures in C/C++☆92Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆156Updated last year
- Rolling Hash C++ Library☆190Updated last year
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- ☆11Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 10 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A lightweight suffix-sorting library☆398Updated 5 years ago
- A simple C library for compressing lists of integers using binary packing☆514Updated 2 years ago