Rehashing (Variable Hashing)

Steven J. Zeil

Old Dominion University, Dept. of Computer Science

Table of Contents

1. Expanding the hash Table
2. Saving the Hash Values

Hash tables offer exceptional performance when not overly full.

This is the traditional dilemma of all array-based data structures:

Rehashing or variable hashing attempts to circumvent this dilemma by expanding the hash table size whenever it gets too full.


In the Forum:

(no threads at this time)