The quadratic hash method when the table size is a power of 2

F. R. A. Hopgood · The Computer Journal · 1972

A number of recent papers have considered the quadratic hash method when the table size is a prime number. This paper shows that, contrary to what is normally assumed, the method can be used for tables whose size is a power of 2 without the usual drawback that the period of search is significantly less than the table size.

Read the paper · More papers on PaperTik