ShockHash: towards optimal-space minimal perfect hashing beyond brute-force

DOI10.1137/1.9781611977929.15MaRDI QIDQ6545400zbMATH OpenFDO

Authors Hans-Peter Lehmann, Peter Sanders, Stefan Walzer

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977929.15

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 1688373
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 1875411
• scientific article; zbMATH DE number 370478

Cited in

(6)

• SicHash -- small irregular cuckoo tables for perfect hashing
• ShockHash: near optimal-space minimal perfect hashing beyond brute-force
• Ribbon: fast succinct static retrieval and approximate membership
• 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: ShockHash: towards optimal-space minimal perfect hashing beyond brute-force

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