minimal-perfect-hash

✈️ PTHash is a fast and compact minimal perfect hash function.

Sux4J is an effort to bring succinct data structures to Java.

Rust libraries and programs focused on succinct data structures

📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.

PtrHash minimal perfect hash function

Succinct data structures in C/C++

Fast and compact locality-preserving minimal perfect hashing for k-mer sets.

Fast Scalable Minimal Perfect Hash for Large Keysets

Rust implementation of the PTHash perfect hash function for static compile-time generated hash tables

An efficient minimal perfect hash function generator for small sets

Succinct data structures and more for Zig. Perfect Hash, Elias-Fano compression, Rank/Select and SymSpell

KV-storage engine based on Minimal perfect hash functions with hybrid indexing (+PGM Index) for Rust. Zero collisions. Pure O(1) performance.

A function for encoding unique ordered sets of natural numbers into a single unique natural number.

Minimal Perfect Hashing

C# implementation of Compress, Hash and Displace Algorithm for constructing a Minimal Perfect Hash Function (MPHF) given a set of keys.

BBHash implemented in C23

Create reversible minimal perfect hash functions from a data model spec. Achieve the information-theoretic lower bound for compression to create hashes that can be converted to and from instances of the given data model.