After Reducing the Index
Dynamic Hashing Example
Now, since we had no more four-bit
nodes, we have reduced the index.
This involves simply discarding the
upper half of the table.
Since doubling the table may be expensive,
it may be better not to collapse the table.
The algorithm will work fine with the larger table,
and a future expansion may be avoided.
| smith | | 011101 | | white | | 001011 | | smart | | 010101
|
| jones | | 010010 | | black | | 111001 | | watkins | | 101010
|
| james | | 101000 | | brown | | 000110 | | franks | | 110010
|
| carter | | 011010 | | archer | | 110111 | | | |
|