PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding

DOI10.4230/LIPICS.ESA.2024.69MaRDI QIDQ7253134zbMATH OpenFDO

Authors Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri, Peter Sanders, Stefan Walzer

Publication date 26 May 2026

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

compressed data structuresGPUminimal perfect hashing

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Alphabet-independent compressed text indexing
• Fast and scalable minimal perfect hashing for massive key sets
• Fast prefix search in little space, with applications
• Fingerprinting-based minimal perfect hashing revisited
• Hash, Displace, and Compress
• High performance construction of recsplit based minimal perfect hash functions
• Network Applications of Bloom Filters: A Survey
• RecSplit: Minimal Perfect Hashing via Recursive Splitting
• Run-length encodings (Corresp.)
• ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
• SicHash -- small irregular cuckoo tables for perfect hashing
• Simple and Space-Efficient Minimal Perfect Hash Functions

Cited in

(3)

• MorphisHash: improving space efficiency of ShockHash for minimal perfect hashing
• Engineering minimal \(k\)-perfect hash functions
• Combined search and encoding for seeds, with an application to minimal perfect hashing

This page was built for publication: PHOBIC: Perfect hashing with optimized bucket sizes and interleaved coding

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