Journal ArticleDOI
Reducing the retrieval time of scatter storage techniques
TLDR
A new method for entering and retrieving information in a hash table is described, intended to be efficient if most entries are looked up several times.Abstract:
A new method for entering and retrieving information in a hash table is described. The method is intended to be efficient if most entries are looked up several times. The expected number of probes to look up an entry, predicted theoretically and verified by Monte Carlo experiments, is considerably less than for other comparable methods if the table is nearly full. An example of a possible Fortran implementation is given.read more
Citations
More filters
Journal ArticleDOI
Cuckoo hashing
TL;DR: In this paper, a simple dictionary with worst case constant lookup time was presented, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al.
Journal ArticleDOI
Large-scale linearly constrained optimization
TL;DR: An algorithm for solving large-scale nonlinear programs with linear constraints is presented, which combines efficient sparse-matrix techniques as in the revised simplex method with stable quasi-Newton methods for handling the nonlinearities.
Journal ArticleDOI
Expected Length of the Longest Probe Sequence in Hash Code Searching
TL;DR: An investigation ts made of the expected value of the maximum number of accesses needed to locate any element m a hashing file under various colhston resoluuon schemes, showing that the actual behawor of the worst case in hash tables is quite good on the average.
A Bibliography of Publications about the Fortran Programming Language: Part 1: 1956{1980
TL;DR: In this paper, the authors proposed a method to solve the problem: see [Cas89a] and http://www.s/0098-3500/116814.html
Journal ArticleDOI
Space Efficient Hash Tables With Worst Case Constant Access Time
TL;DR: This is the first dictionary that has worst case constant access time and expected constant update time, works with (1 + ε)n space, and supports satellite information.
References
More filters
Journal ArticleDOI
Scatter storage techniques
TL;DR: L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
Journal ArticleDOI
An improved hash code for scatter storage
TL;DR: Known as quadratic search, this method is faster than random search and free from the “clusters” that build up with a linear search.
Journal ArticleDOI
Programming Technique: An improved hash code for scatter storage
TL;DR: A new hash coding method is presented that, besides being very simple and as fast as the best known methods, allows the table size to be almost any prime number.
Journal ArticleDOI
The quadratic quotient method: a hash code eliminating secondary clustering
TL;DR: Secondary clustering as a cause of hash code inefficiency is discussed, and a new hashing method based on its elimination is presented, both analytically and empirically.
Journal ArticleDOI
An indirect chaining method for addressing on secondary keys
TL;DR: An efficient generalization of the chaining method which permits recovery on additional keys is presented, which is based on a pseudo-random key transformation.