Compact Hash Tables Using Bidirectional Linear Probing

Authors:
J. G. Clerry
Affiliations:
Man-Machine Systems Group, Department of Computer Science, The University of Calgary
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 4
Cited 12

Hash Table Methods

ACM Computing Surveys (CSUR)
General performance analysis of key-to-address transformation methods using an abstract file concept

Communications of the ACM
Comment on Brent's scatter storage algorithm

Communications of the ACM
Key-to-address transform techniques: a fundamental performance study on large existing formatted files

Communications of the ACM

Space Efficient Hash Tables with Worst Case Constant Access Time

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets

ACM Transactions on Algorithms (TALG)
Compact dictionaries for variable-length keys and data with applications

ACM Transactions on Algorithms (TALG)
Fast, All-Purpose State Storage

Proceedings of the 16th International SPIN Workshop on Model Checking Software
Cache-, hash-, and space-efficient bloom filters

Journal of Experimental Algorithmics (JEA)
A Simple, Fast, and Compact Static Dictionary

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Succinct dynamic dictionaries and trees

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Cache-, hash- and space-efficient bloom filters

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Don't thrash: how to cache your hash on flash

HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
Parallel recursive state compression for free

Proceedings of the 18th international SPIN conference on Model checking software
A parallel compact hash table

MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Don't thrash: how to cache your hash on flash

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	14.98

Visualization

Abstract

An algorithm is developed which reduces the memory requirements of hash tables. This is achieved by storing only a part of each key along with a few extra bits needed to ensure that all keys are stored unambiguously. The fraction of each key stored decreases as the size of the hash table increases. Significant reductions in total memory usage can be achieved especially when the key size is not much larger than the size of a memory index and when only a small amount of data is stored with each key. The algorithm is based on bidirectional linear probing. Search and insertion times are shown by simulation to be similar to those for ordinary bidirectional linear probing.