A Benchmark of Minimal Perfect Hash Function Algorithms.
☆39Dec 20, 2022Updated 3 years ago
Alternatives and similar repositories for mphf_benchmark
Users that are interested in mphf_benchmark are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆267Jul 27, 2026Updated last month
- Fast Approximate Pattern Matching using Search Schemes☆20Jul 11, 2026Updated 2 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆20Sep 30, 2025Updated 11 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last week
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Rust libraries and programs focused on succinct data structures☆173Updated this week
- String map implementation through Fast Succinct Trie☆24Jul 9, 2021Updated 5 years ago
- Rust implementations of succinct data structures☆79Sep 15, 2026Updated last week
- Static Huffman coding☆10Apr 3, 2017Updated 9 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 9 months ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 5 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Collection of succinct data structures in Rust☆109Aug 31, 2026Updated 3 weeks ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆25Nov 20, 2025Updated 10 months ago
- Learned Monotone Minimal Perfect Hashing☆32Sep 13, 2026Updated last week
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- FM-index for Rust☆25Jun 29, 2026Updated 2 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆109Sep 3, 2026Updated 2 weeks ago
- Efficient Prefix-Sum data structures in C++.☆28Oct 1, 2023Updated 2 years ago
- kmer-counter based on kache-hash☆19Sep 15, 2026Updated last week
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- ⚙️🛠️ Essential C++ utilities.☆15Aug 22, 2026Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- ☆17Apr 6, 2023Updated 3 years ago
- Fast and scalable minimal perfect hashing for massive key sets☆154Jul 8, 2024Updated 2 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 5 months ago
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 3 years ago
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- A Rust implementation of the Quad Wavelet Tree☆57Jul 8, 2026Updated 2 months ago
- PtrHash minimal perfect hash function☆103Aug 28, 2026Updated 3 weeks ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆40Aug 22, 2024Updated 2 years ago
- ☆38Mar 29, 2022Updated 4 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆20Nov 1, 2023Updated 2 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Jul 12, 2026Updated 2 months ago