Open AccessAn Analysis of Spiral Hashing
Author(s) -
J.-H. Chu
Publication year - 1994
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/37.8.715
Subject(s) - computer science , spiral (railway) , mathematics , mathematical analysis
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom