<s>
As	O
in	O
all	O
hashing	O
schemes	O
,	O
spiral	B-Algorithm
hashing	I-Algorithm
stores	O
records	O
in	O
a	O
varying	O
number	O
of	O
buckets	O
,	O
using	O
a	O
record	O
key	O
for	O
addressing	O
.	O
</s>
<s>
In	O
an	O
expanding	O
Linear	B-Algorithm
hashing	I-Algorithm
file	O
,	O
buckets	O
are	O
split	O
in	O
a	O
predefined	O
order	O
.	O
</s>
<s>
Spiral	B-Algorithm
hashing	I-Algorithm
requires	O
a	O
uniform	O
hash	O
function	O
of	O
the	O
keys	O
of	O
the	O
records	O
into	O
the	O
unit	O
interval	O
.	O
</s>
<s>
Larson	O
conducted	O
experiments	O
that	O
showed	O
that	O
Linear	B-Algorithm
hashing	I-Algorithm
still	O
had	O
superior	O
performance	O
over	O
Spiral	B-Algorithm
Hashing	I-Algorithm
.	O
</s>
