<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
SUHA	B-Algorithm
(	O
Simple	O
Uniform	O
Hashing	O
Assumption	O
)	O
is	O
a	O
basic	O
assumption	O
that	O
facilitates	O
the	O
mathematical	O
analysis	O
of	O
hash	B-Algorithm
tables	I-Algorithm
.	O
</s>
<s>
The	O
assumption	O
states	O
that	O
a	O
hypothetical	O
hashing	B-Error_Name
function	I-Error_Name
will	O
evenly	O
distribute	O
items	O
into	O
the	O
slots	O
of	O
a	O
hash	B-Algorithm
table	I-Algorithm
.	O
</s>
<s>
This	O
assumption	O
generalizes	O
the	O
details	O
of	O
the	O
hash	B-Error_Name
function	I-Error_Name
and	O
allows	O
for	O
certain	O
assumptions	O
about	O
the	O
stochastic	O
system	O
.	O
</s>
<s>
SUHA	B-Algorithm
is	O
most	O
commonly	O
used	O
as	O
a	O
foundation	O
for	O
mathematical	O
proofs	O
describing	O
the	O
properties	O
and	O
behavior	O
of	O
hash	B-Algorithm
tables	I-Algorithm
in	O
theoretical	O
computer	B-General_Concept
science	I-General_Concept
.	O
</s>
<s>
Minimizing	O
hashing	B-Algorithm
collisions	I-Algorithm
can	O
be	O
achieved	O
with	O
a	O
uniform	O
hashing	B-Error_Name
function	I-Error_Name
.	O
</s>
<s>
Assuming	O
uniform	O
hashing	O
allows	O
hash	B-Algorithm
table	I-Algorithm
analysis	O
to	O
be	O
made	O
without	O
exact	O
knowledge	O
of	O
the	O
input	O
or	O
the	O
hash	B-Error_Name
function	I-Error_Name
used	O
.	O
</s>
<s>
Certain	O
properties	O
of	O
hash	B-Algorithm
tables	I-Algorithm
can	O
be	O
derived	O
once	O
uniform	O
hashing	O
is	O
assumed	O
.	O
</s>
<s>
A	O
simple	O
example	O
of	O
using	O
SUHA	B-Algorithm
can	O
be	O
seen	O
while	O
observing	O
an	O
arbitrary	O
hash	B-Algorithm
table	I-Algorithm
of	O
size	O
10	O
and	O
a	O
data	O
set	O
of	O
30	O
unique	O
elements	O
.	O
</s>
<s>
If	O
chaining	O
is	O
used	O
to	O
deal	O
with	O
collisions	O
,	O
the	O
average	B-General_Concept
chain	O
length	O
of	O
this	O
hash	B-Algorithm
table	I-Algorithm
may	O
be	O
a	O
desirable	O
value	O
.	O
</s>
<s>
Without	O
any	O
assumptions	O
and	O
with	O
no	O
more	O
additional	O
information	O
about	O
the	O
data	O
or	O
hash	B-Error_Name
function	I-Error_Name
,	O
the	O
chain	O
length	O
cannot	O
be	O
estimated	O
.	O
</s>
<s>
With	O
SUHA	B-Algorithm
however	O
,	O
we	O
can	O
state	O
that	O
because	O
of	O
an	O
assumed	O
uniform	O
hashing	O
,	O
each	O
element	O
has	O
an	O
equal	O
probability	O
of	O
mapping	O
to	O
a	O
slot	O
.	O
</s>
<s>
Since	O
no	O
particular	O
slot	O
should	O
be	O
favored	O
over	O
another	O
,	O
the	O
30	O
elements	O
should	O
hash	B-Error_Name
into	O
the	O
10	O
slots	O
uniformly	O
.	O
</s>
