roberto-trani / mphf_benchmarkLinks
A Benchmark of Minimal Perfect Hash Function Algorithms.
☆38Updated 2 years ago
Alternatives and similar repositories for mphf_benchmark
Users that are interested in mphf_benchmark are comparing it to the libraries listed below
Sorting:
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆239Updated last week
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated this week
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 8 months ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Fast Approximate Membership Filters (C++)☆284Updated last month
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 8 months ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆220Updated 3 weeks ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast in-place radix sort with STL-like API☆47Updated 8 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- ☆38Updated 5 years ago
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- Dynamic succinct/compressed data structures☆110Updated last year
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- Additional C++11 Random Distributions☆19Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- PtrHash minimal perfect hash function☆72Updated last month
- Succinct Data Structure Library 3.0☆95Updated last month
- A Rust implementation of the Quad Wavelet Tree☆42Updated last month