An Analysis of Spiral Hashing
J.-H. Chu · The Computer Journal · 1994
Spiral hashing is an interesting extendible hashing method. Only one approximate analysis of its performance was given, which was based on a heuristic approach and did not specify the error. In this paper, we present a discrete analysis of the expected search cost and the expected amortized rehashing cost in spiral hashing for which a big-O term can be given to describe the error