multiplication method

(algorithm)

Definition: A hash function that uses the first p bits of the key times an irrational number.

Formal Definition: h(k) = ⌊ m(k A (mod 1))⌋, where m is usually an integer 2^p and A is an irrational number (or an approximation thereto) 0 < A < 1. The modulo 1 operation removes the integer part of k × A.

Author: PEB

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 24 August 2009.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "multiplication method", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 24 August 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/multiplicationMethod.html