Engineering Minimal k-Perfect Hash Functions

Stefan Hermann, Sebastian Kirmayer, Hans-Peter Lehmann +2

Given a set S of n keys, a k-perfect hash function (kPHF) is a data structure that maps the keys to the first m integers, where each output integer can be hit by at most k input ke…