Efficient hashing with lookups in two memory accesses

MaRDI QIDQ2921748zbMATH OpenFDO

Authors Rina Panigrahy

Publication date 13 October 2014

Mathematics Subject Classification ID

Data structures (68P05) Combinatorics in computer science (68R05)

Recommendations

• 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
• The power of two choices with simple tabulation
• Two-way chaining for non-uniform distributions
• Balanced allocation and dictionaries with tightly packed constant size bins
• Automata, Languages and Programming

Cited in

(7)

• Optimality in external memory hashing
• Balanced allocation and dictionaries with tightly packed constant size bins
• 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Two-way chaining for non-uniform distributions
• Dynamic dictionaries for multisets and counting filters with constant time operations
• Dynamic dictionaries for multisets and counting filters with constant time operations

This page was built for publication: Efficient hashing with lookups in two memory accesses

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