Maintaining External Memory Efficient Hash Tables

DOI10.1007/11830924_46MaRDI QIDQ3595377zbMATH OpenOpenAlexFDO

Authors Philipp Woelfel

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_46

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Randomized algorithms (68W20)

Recommendations

• Optimality in external memory hashing
• Optimal hashing in external memory
• Space efficient hash tables with worst case constant access time
• Using hashing to solve the dictionary problem
• Cache-oblivious hashing

Cited in

(9)

• Optimality in external memory hashing
• Dynamic space efficient hashing
• Compact Hash Tables Using Bidirectional Linear Probing
• Cache-oblivious hashing
• Optimal hashing in external memory
• Round-hashing for data storage: distributed servers and external-memory tables
• Dynamic space efficient hashing
• Practical batch-updatable external hashing with sorting
• PaCHash: packed and compressed hash tables

This page was built for publication: Maintaining External Memory Efficient Hash Tables

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