2 citations · 4 across the 8 of their papers we have counts for
3 papers · 1 filter
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann +1
A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit…
SicHash -- Small Irregular Cuckoo Tables for Perfect Hashing
Hans-Peter Lehmann, Peter Sanders, Stefan Walzer
A Perfect Hash Function (PHF) is a hash function that has no collisions on a given input set. PHFs can be used for space efficient storage of data in an array, or for determining a…
PaCHash: Packed and Compressed Hash Tables
Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
We introduce PaCHash, a hash table that stores its objects contiguously in an array without intervening space, even if the objects have variable size. In particular, each object ca…