the desired key value is not found and the bucket still has free slotsthen the search is complete if the bucket is fullthen it is possible that the desired record is stored in the overflow bucket in this casethe overflow bucket must be searched until the record is found or all records in the overflow bucket have been checked if many records are in the overflow bucketthis will be an expensive process simple variation on bucket hashing is to hash key value to some slot in the hash table as though bucketing were not being used if the home position is fullthen the collision resolution process is to move down through the table toward the end of the bucket will searching for free slot in which to store the record if the bottom of the bucket is reachedthen the collision resolution routine wraps around to the top of the bucket to continue the search for an open slot for exampleassume that buckets contain eight recordswith the first bucket consisting of slots through if record is hashed to slot the collision resolution process will attempt to insert the record into the table in the order and finally if all slots in this bucket are fullthen the record is assigned to the overflow bucket the advantage of this approach is that initial collisions are reducedbecause any slot can be home position rather than just the first slot in the bucket bucket methods are good for implementing hash tables stored on diskbecause the bucket size can be set to the size of disk block whenever search or insertion occursthe entire bucket is read into memory because the entire bucket is then in memoryprocessing an insert or search operation requires only one disk accessunless the bucket is full if the bucket is fullthen the overflow bucket must be retrieved from disk as well naturallyoverflow should be kept small to minimize unnecessary disk accesses linear probing we now turn to the most commonly used form of hashingclosed hashing with no bucketingand collision resolution policy that can potentially use any slot in the hash table during insertionthe goal of collision resolution is to find free slot in the hash table when the home position for the record is already occupied we can view any collision resolution method as generating sequence of hash table slots that can potentially hold the record the first slot in the sequence will be the home position for the key if the home position is occupiedthen the collision resolution policy goes to the next slot in the sequence if this is occupied as wellthen another slot must be foundand so on this sequence of slots is known as the probe sequenceand it is generated by some probe function that we will call the insert function is shown in figure insertion works as follows