Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1145/174263.174264 | SIGIR Forum |
Keywords | Field | DocType |
various limitation,segment linearly,whole range,key-value,statistical behavior,direct access file,hash value,statistical behaviour,equal segment,hashing function,data structure,hash function | Double hashing,Computer science,Universal hashing,Feature hashing,Algorithm,Theoretical computer science,K-independent hashing,Consistent hashing,Dynamic perfect hashing,Hash table,Linear hashing | Journal |
Volume | Issue | Citations |
27 | 1 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiyu Tian | 1 | 0 | 0.68 |
| Shibai Tong | 2 | 2 | 1.71 |
| Shiyuan Yang | 3 | 51 | 15.08 |