Abstract
Introduced is a hash coding method based on fixed-point division rather than multiplication or logical operations. This new method allows the hash table to have almost any length. Also a new method of handling collisions is discussed. Known as quadratic search, this method is faster than random search and free from the “clusters” that build up with a linear search.
Keywords
Hash functionComputer scienceHash tableDouble hashingAlgorithmMultiplication (music)Coding (social sciences)Dynamic perfect hashingTheoretical computer scienceParallel computingArithmeticMathematicsProgramming languageStatisticsCombinatorics
Affiliated Institutions
Related Publications
Fast and accurate long-read alignment with Burrows–Wheeler transform
Abstract Motivation: Many programs for aligning short sequencing reads to a reference genome have been developed in the last 2 years. Most of them are very efficient for short r...
Space/time trade-offs in hash coding with allowable errors
In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for ...
The Arithmetic Optimization Algorithm
This work proposes a new meta-heuristic method called Arithmetic Optimization Algorithm (AOA) that utilizes the distribution behavior of the main arithmetic operators in mathema...
Fast and accurate short read alignment with Burrows–Wheeler transform
Abstract Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A...
Search and clustering orders of magnitude faster than BLAST
Abstract Motivation: Biological sequence data is accumulating rapidly, motivating the development of improved high-throughput methods for sequence classification. Results: UBLAS...
Publication Info
- Year
- 1983
- Type
- article
- Volume
- 26
- Issue
- 1
- Pages
- 36-38
- Citations
- 52
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
52
OpenAlex
Cite This
Ward Douglas Maurer
(1983).
An improved hash code for scatter storage.
Communications of the ACM
, 26
(1)
, 36-38.
https://doi.org/10.1145/357980.357995
Identifiers
- DOI
- 10.1145/357980.357995