Premium
Selecting a hashing algorithm
Author(s) -
McKenzie B. J.,
Harries R.,
Bell T.
Publication year - 1990
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380200207
Subject(s) - hash function , dynamic perfect hashing , computer science , consistent hashing , universal hashing , k independent hashing , algorithm , linear hashing , hash table , function (biology) , theoretical computer science , double hashing , computer security , evolutionary biology , biology
Abstract Hashing is so commonly used in computing that one might expect hash functions to be well understood, and that choosing a suitable function should not be difficult. The results of investigations into the performance of some widely used hashing algorithms are presented and it is shown that some of these algorithms are far from optimal. Recommendations are made for choosing a hashing algorithm and measuring its performance.