Knuth, The Art Of Computer Programming V3, Sorting & Searching covered both multiply & shift and modulo prime integer hashing in some detail in its first edition written in the 1960s, published in 1973. While not "modern", Knuth has always been a bona fide classic, especially as regards hashing, and should really be cited by this survey paper, IMO. (EDIT: people now call this "Fibonacci Hashing" even though, in the source material itself, Knuth mentions many irrational numbers will do, not just his motivating choice of the golden ratio from Fibonacci numbers fame. There are blog posts about it being "the optimization that time forgot", etc.)
For not entirely clear reasons (maybe multiplier selection?), only Knuth's modulo prime suggestion "propagated" well in the 70s and 80s. This suggestion reception bias also aged poorly over ensuing decades with the CPU cost of modulo vs. multiply evolving from a 2x performance delta to more like 10x.
For not entirely clear reasons (maybe multiplier selection?), only Knuth's modulo prime suggestion "propagated" well in the 70s and 80s. This suggestion reception bias also aged poorly over ensuing decades with the CPU cost of modulo vs. multiply evolving from a 2x performance delta to more like 10x.