Name
Abstract | ||
|---|---|---|
A quadratic search method for hash tables whose size is a power of 2 is presented. It allows full table searching, and yet eliminates secondary clustering, which occurs when different keys hashed initially to the same location proceed to trace through the same sequence of locations. Comparisons with other methods are made experimentally. |
Year | DOI | Venue |
|---|---|---|
1974 | 10.1007/BF00976638 | International Journal of Parallel Programming |
Keywords | Field | DocType |
hash table | Primary clustering,Double hashing,Computer science,Rolling hash,Algorithm,Theoretical computer science,Hash function,Cluster analysis,Quadratic probing,Hash table,Linear hashing | Journal |
Volume | Issue | ISSN |
3 | 2 | 1573-7640 |
Citations | PageRank | References |
1 | 0.38 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Seiichi Nishihara | 1 | 71 | 14.35 |
| Hiroshi Hagiwara | 2 | 35 | 16.57 |