| Chaining |
|
|
|
|
|
|
|
|
|
|
|
| • | For 2
or more search keys, |
|||||||||
| – | you
will have 2 or more hash tables (if the |
|||||||||
| performance
for each is equally important) |
||||||||||
| – | where
the data within each node actually is a |
|||||||||
| pointer
to the physical data rather than an |
||||||||||
| instance |
||||||||||
| By name |
| data |
| data |
|
|
|
|
| pointed
to |
|||
| from
another |
|||
| node in
another |
|||
| HT chain |
|||
| hash table |