chap searching hash table overflow figure an illustration of bucket hashing for seven numbers stored in fivebucket hash table using the hash function (kk mod each bucket contains two slots the numbers are inserted in the order and two of the values hash to bucket three values hash to bucket one value hashes to bucket and one value hashes to bucket because bucket cannot hold three valuesthe third one ends up in the overflow bucket will be stored at some other slot in the table it is the business of the collision resolution policy to determine which slot that will be naturallythe same policy must be followed during search as during insertionso that any record not found in its home position can be recovered by repeating the collision resolution process bucket hashing one implementation for closed hashing groups hash table slots into buckets the slots of the hash table are divided into bucketswith each bucket consisting of / slots the hash function assigns each record to the first slot within one of the buckets if this slot is already occupiedthen the bucket slots are searched sequentially until an open slot is found if bucket is entirely fullthen the record is stored in an overflow bucket of infinite capacity at the end of the table all buckets share the same overflow bucket good implementation will use hash function that distributes the records evenly among the buckets so that as few records as possible go into the overflow bucket figure illustrates bucket hashing when searching for recordthe first step is to hash the key to determine which bucket should contain the record the records in this bucket are then searched if