High performance construction of recsplit based minimal perfect hash functions

DOI10.4230/LIPICS.ESA.2023.19MaRDI QIDQ6656959zbMATH OpenFDO

Authors Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.19

zbMATH Keywords

bit parallelismcompressed data structureGPUparallel computingparallel perfect hashingSIMDvector instructions

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• ShockHash: near optimal-space minimal perfect hashing beyond brute-force
• PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding
• MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing
• Combined search and encoding for seeds, with an application to minimal perfect hashing

This page was built for publication: High performance construction of recsplit based minimal perfect hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656959)