Other Collision Resolution Techniques
There are a few variations on random hashing that may improve performance:
- Double Hashing: When an overflow occurs, use a second hashing function to map the record to its overflow location.
- Chained Progressive Overflow: Like Progressive overflow except that synonyms are linked together with pointers.
- Chaining with a Separate Overflow Area: Like chained progressive overflow except that overflow addresses do not occupy home addresses.
- Scatter Tables: The Hash file contains no records, but only pointers to records. I.e., it is an index.