Tight Bounds for Monotone Minimal Perfect Hashing
Sepehr Assadi, Martı́n Farach-Colton, William Kuszmaul · Society for Industrial and Applied Mathematics eBooks · 2023
The monotone minimal perfect hash function (MMPHF) problem is the following indexing problem. Given a set S = {sı,…, sn} of n distinct keys from a universe U of size u, create a data structure D that answers the following query: