Compact Hash Tables Using Bidirectional Linear Probing

DOI10.1109/TC.1984.1676499MaRDI QIDQ3335023zbMATH OpenWikidataFDO

Authors John G. Cleary

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1984.1676499

zbMATH Keywords

address calculationalgorithmbidirectional linear probinghash tablesmemory compactionopen addressingperformance analysisscatter storagesearching

Mathematics Subject Classification ID

Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Fast and simple compact hashing via bucketing
• Space/time trade-offs in hash coding with allowable errors
• Maintaining External Memory Efficient Hash Tables
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 2185600

Cited in

(11)

• Fast and simple compact hashing via bucketing
• c-trie++: a dynamic trie tailored for fast prefix searches
• A unified approach to linear probing hashing with buckets
• Hash table reorganization
• scientific article; zbMATH DE number 4045254 (Why is no real title available?)
• Engineering practical Lempel-Ziv tries
• Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
• m-Bonsai: a practical compact dynamic trie
• Space/time trade-offs in hash coding with allowable errors
• Dynamic Path-decomposed Tries
• Fast and simple compact hashing via bucketing

This page was built for publication: Compact Hash Tables Using Bidirectional Linear Probing

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