Database Reference
In-Depth Information
Figure A2-9.
UML Diagram for the TreeMap Class
A2.5 Summary and Concluding Remarks
Let us summarize what we have covered in this chapter:
•
A hash function takes a key value, applies an algorithm to
determine its location.
•
The hash function maps key values from a relatively large domain
to a relatively smaller range of address locations. Because of this,
collision may occur and must be resolved.
•
Among the commonly used hashing techniques are absolute
addressing, direct table lookup, division-remainder, mid-square,
folding, and truncation.
•
Three commonly used collision resolution strategies are linear
probing, synonym chaining, and rehashing.
•
In linear probing, consecutive address locations are checked until
a free location is found for insertion, or the sought item is found.
