Compact Hash Tables Using Bidirectional Linear Probing

  title={Compact Hash Tables Using Bidirectional Linear Probing},
  journal={IEEE Transactions on Computers},
  • Clerry
  • Published 1 September 1984
  • Computer Science
  • IEEE Transactions on Computers
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… 
m-Bonsai: a Practical Compact Dynamic Trie
The problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance, is considered, and an implementation of m-Bonsai is given which uses considerably less memory and is slightly faster than the original Bonsai.
Adaptive approximate state storage
This dissertation analyzes the approximate state storage problem in unprecedented detail, improves upon standard solutions, and demonstrates a novel approach that solves a configuration dilemma facing users of the standard solutions.
Compact Dynamic Rewritable (CDRW) Arrays
This paper considers the problem of compactly representing a rewritable array of bit-strings and aims to approach the minimum possible space bound.
Cache-, hash-, and space-efficient bloom filters
This work proposes several new variants of Bloom filters and replacements with similar functionality that have a better cache-efficiency and need less hash bits than regular Bloom filters, and some use SIMD functionality, while the others provide an even better space efficiency.
Dynamic Path-decomposed Tries
The main idea is to embrace the path decomposition technique, which was proposed for constructing cache-friendly tries, and design data structures based on recent compact hash trie representations to store the path-decomposed trie in small memory.
A Parallel Compact Hash Table
We present the first parallel compact hash table algorithm. It delivers high performance and scalability due to its dynamic region-based locking scheme with only a fraction of the memory requirements
A Simple, Fast, and Compact Static Dictionary
A new static dictionary that is very fast and compact, while also extremely easy to implement is presented, and a space bound is proved with a novel application of the Kolmogorov-Smirnov distribution.
Fast, All-Purpose State Storage
A scheme that adapts at run time to the number of states visited, within a fixed memory space and with remarkable speed and accuracy, wellsuited for a future in which random accesses to memory are more of a limiting factor than the size of memory.
Compact dictionaries for variable-length keys and data with applications
Several applications are presented, including representations for semidynamic graphs, order queries on integers sets, cardinal trees with varying cardinality, and simplicial meshes of <i>d</i> dimensions.
Recursive Variable-Length State Compression for Multi-Core Software Model Checking
dtree is introduced, a concurrent compression tree data structure that compactly stores variable-length states while allowing partial state reconstruction and incremental updates without concretising states and supports describing a state as a tree, allowing direct modeling of the heap.


Universal Classes of Hash Functions
An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions.
Key-To-Address Transformation Techniques
AbstractA number of key-to-address transformations are surveyed with particular emphasis given to distribution-dependent hashing methods. The open addressing, separate chaining, coalesced chaining,
Hash Table Methods
It is shown that under certain conditmns the authors can guarantee that no two items belonging to a certain class will have the same hash code, thus providing an improvement over the usual notion of a hash code as a randomizing technique.
Ordered Hash Tables
Abstract : Some variants of the traditional hash method, making use of the numerical or alphabetical order of the keys, lead to faster searching at the expense of a little extra work when items are
Comment on Brent's scatter storage algorithm
R.P. Brent in his presentation of a modification to the linear quotient algorithm [1] shares the common misconception that dynamic chaining requires larger table entries because of the space required
General performance analysis of key-to-address transformation methods using an abstract file concept
  • V. Lum
  • Computer Science
  • 1973
This paper presents a new approach to the analysis of performance of the various key-to-address transformation methods. In this approach the keys in a file are assumed to have been selected from the
Key-to-address transform techniques: a fundamental performance study on large existing formatted files
The intricacy of the generalized radix transformation method has motivated us to conduct further studies of the technique and it is more appropriate to change the label of that transformation in [1] from "Lin's method" to "generalized radix Transformation method" and use this term here.