Hash Table Performance
•
Excellent, if no overflow blocks
•
Degrades considerably when number of
keys exceeds the number of buckets (I.e.
many overflow blocks).
•
Typically, we assume that a hash-lookup
takes 1.2 I/Os.
•