rizkg / BBHashLinks
Bloom-filter based minimal perfect hash function library
☆274Updated 6 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☆66Updated last year
- Dynamic succinct/compressed data structures☆115Updated last month
- Succinct Data Structure Library 3.0☆101Updated last month
- BitMagic Library☆441Updated 5 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆166Updated last year
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Updated 2 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- Rolling Hash C++ Library☆190Updated last year
- Succinct Data Structure Library☆109Updated 12 years ago
- Fast integer compression in C using the StreamVByte codec☆413Updated 11 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆250Updated 2 months ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 11 years ago
- Succinct data structures in C/C++☆93Updated last year
- A lightweight suffix-sorting library☆399Updated 5 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Diskbased (persistent) hashtable☆167Updated last year
- Compact Data Structures Library☆129Updated 11 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆158Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆443Updated 6 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- C library implementing the ridiculously fast CLHash hashing function☆281Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago