Spiral hashing, also known as Spiral Storage, is an extensible hashing algorithm. As in all hashing schemes, spiral hashing stores records in a varying number of buckets, using a record key for addressing. In an expanding Linear hashing file, buckets are split in a predefined order. This results in adding a new bucket at the end of the file. While this allows gradual reorganization of the file, the expected number of records in the newly created bucket and the bucket from what it splits falls to half the previous number. Several attempts were made to alleviate this sudden drop in space utilization. Martin's spiral storage uses a different approach. The file consists of a number of continuously numbered buckets. The lower-numbered (left) buckets have a higher expected number of records. When the file expands, the left-most bucket is replaced by two buckets on the right. Some variants of this idea exist. Spiral hashing requires a uniform hash function of the keys of the records into the unit interval [ 0 , 1 ] {\displaystyle [0,1]} . If the hash file starts at bucket S {\displaystyle S} , the key k {\displaystyle k} is mapped into a real number x = S + h ( k ) ∈ [ S , S + 1 ] {\displaystyle x=S+h(k)\in [S,S+1]} . The final address is then computed as ⌊ d x ⌋ {\displaystyle \lfloor d^{x}\rfloor } where d {\displaystyle d} is the "extension factor". When S {\displaystyle S} is incremented, approximately d {\displaystyle d} new buckets are created on the right. Larson conducted experiments that showed that Linear hashing still had superior performance over Spiral Hashing.
See also Extendible hashing Linear hashing
References
