ing technique. What it does is that it will run two - passes on the keys. The first run stores the keys that are not synonyms in their hashed address while the second run stores the synonyms in the next available positions. This technique reduces the amount of displacement that is caused by linear probing and thus improves the searching for a key that is not a synonym.Separate Overflow AreaSeparate overflow area uses the one pass algorithm (just like linear probing), but it stores its synonyms in a separate overflow location. This method eliminates the displacement problem altogether but accessing synonyms entails sequentially searching all the records in the overflow area. The is a good technique provided that the overflow area is not too big, which could cause lengthy search.Double HashingDouble hashing involves the use of a second hashing function to store the synonyms into an overflow area. This method would apply the first hashing function to the key of the record, if the result is not a synonym, the record is hashed into the appropriate location. If there is a synonym, a second hashing function is applied to the result of the first hashing function, generating a location that is within the overflow area, then record is stored in this location.Synonym ChainingThis method can be used with or without a separate overflow area. It functions much like a linked list, in which the link to the next record is in the current record. However, all the locations are not linked together. In each location there is a link to the synonym in the overflow area, and also the overflow area locations contains a link to its synonym. Bucket AddressingBucket addressing involves the use of more than one record space for each position in the storage area. What happens is that the first record of a position will reside in the first bucket, and the synonyms will follow. If there are more synonyms than buckets, then we have a bucket spill. In bucket spill addre...
