Dynamic space efficient hashing

DOI10.4230/LIPICS.ESA.2017.58MaRDI QIDQ5111747zbMATH OpenOpenAlexFDO

Authors Tobias Maier, Peter Sanders

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.ESA.2017.58

zbMATH Keywords

dynamic data structurescuckoo hashingspace efficiencyopen addressingclosed hashing

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Dynamic space efficient hashing
• Space efficient hash tables with worst case constant access time
• scientific article; zbMATH DE number 1962820
• Fast and simple compact hashing via bucketing
• Maintaining External Memory Efficient Hash Tables

Cites work

• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• An analysis of random-walk cuckoo hashing
• Balanced allocation and dictionaries with tightly packed constant size bins
• Cuckoo hashing
• Cuckoo hashing with pages
• Cuckoo hashing: Further analysis
• De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Less Hashing, Same Performance: Building a Better Bloom Filter
• On the insertion time of cuckoo hashing
• Some Open Questions Related to Cuckoo Hashing
• Space efficient hash tables with worst case constant access time
• The analysis of double hashing
• Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)

Cited in

(4)

• Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
• Single access hashing with overflow separators for dynamic files
• Dynamic space efficient hashing
• Engineering practical Lempel-Ziv tries

This page was built for publication: Dynamic space efficient hashing

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