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.☆242Updated last week
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Updated 3 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 3 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 9 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 9 months ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆223Updated last month
- Fast in-place radix sort with STL-like API☆48Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 4 months ago
- Dynamic succinct/compressed data structures☆111Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- Additional C++11 Random Distributions☆19Updated last year
- PtrHash minimal perfect hash function☆77Updated last month
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- ☆11Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Bit packed vector of integral values☆27Updated 8 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- A Rust implementation of the Quad Wavelet Tree☆43Updated last month
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago