Fast and simple compact hashing via bucketing

DOI10.4230/LIPICS.SEA.2020.7MaRDI QIDQ6487602zbMATH OpenFDO

Authors Dominik Köppl, Simon J. Puglisi, Rajeev Raman

Publication date 7 February 2023

zbMATH Keywords

hash tableseparate chainingcompact hashing

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Compact Hash Tables Using Bidirectional Linear Probing
• scientific article; zbMATH DE number 1688373
• Simple fast parallel hashing
• Fast and scalable minimal perfect hashing for massive key sets
• scientific article; zbMATH DE number 1875411

Cited in

(10)

• Compact Hash Tables Using Bidirectional Linear Probing
• Dynamic space efficient hashing
• Simple fast parallel hashing
• Dynamic Path-decomposed Tries
• A unified approach to linear probing hashing with buckets
• An approximate analysis of the performance of extendible hashing with elastic buckets
• c-trie++: a dynamic trie tailored for fast prefix searches
• Fast and simple compact hashing via bucketing
• Multidimensional quantile hashing is very efficient for nonuniform distributions
• PaCHash: packed and compressed hash tables

This page was built for publication: Fast and simple compact hashing via bucketing

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