A Benchmark of Minimal Perfect Hash Function Algorithms.
☆38Dec 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.☆252Mar 9, 2026Updated 2 weeks ago
- Fast Approximate Pattern Matching using Search Schemes☆16Jan 14, 2026Updated 2 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆24Nov 20, 2025Updated 4 months ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- Rust libraries and programs focused on succinct data structures☆158Updated this week
- Rust implementations of succinct data structures☆69Updated this week
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 4 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 3 months ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Collection of succinct data structures in Rust☆104Mar 4, 2026Updated 2 weeks ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- FM-index for Rust☆25Apr 30, 2025Updated 10 months ago
- ☆16Apr 6, 2023Updated 2 years ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 2023Updated 2 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 5 months ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated 2 weeks ago
- Fast and scalable minimal perfect hashing for massive key sets☆149Jul 8, 2024Updated last year
- A d-ary heap in Rust☆21Sep 16, 2025Updated 6 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆49Sep 12, 2022Updated 3 years ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Jun 23, 2025Updated 9 months 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
- PtrHash minimal perfect hash function☆89Sep 2, 2025Updated 6 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆94Mar 17, 2026Updated last week
- A Rust implementation of the Quad Wavelet Tree☆51Jan 31, 2026Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆19Nov 1, 2023Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆31Apr 1, 2025Updated 11 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆29Apr 24, 2025Updated 11 months ago
- ☆38Mar 29, 2022Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago