Fast hashing of variable-length text strings
Communications of the ACM
Practical minimal perfect hash functions for large databases
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Comparative Study of Very Large Data Bases
Comparative Study of Very Large Data Bases
| Hi-index | 0.00 |
Existing hashing functions have various limitations. In this paper a new hashing function is proposed, which divides the range of the key-values into some equal segments, and maps the key-values in each segment linearly into the whole range of the address. The paper analyzes the statistical behavior of the function, and points out that, theoretically, by increasing the number of segments, the distribution of the resulting hash values can always approach uniform, if the key-values can be regarded as continuous. Two methods for obtaining the number of segments, the deterministic and the probabilistic, along with the algorithm, are also proposed.