Dynamic space efficient hashing

DOI10.4230/LIPICS.ESA.2017.58zbMATH Open1442.68039OpenAlexW2951346356MaRDI QIDQ5111747FDOQ5111747

Authors: Tobias Maier, Peter Sanders 

Publication date: 27 May 2020

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

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

zbMATH Keywords

dynamic data structurescuckoo hashingspace efficiencyopen addressingclosed hashing

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

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

Cited In (4)

• Dynamic space efficient hashing
• Single access hashing with overflow separators for dynamic files
• Engineering practical Lempel-Ziv tries
• Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch 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)