sec hashing figure an illustration of open hashing for seven numbers stored in ten-slot hash table using the hash function (kk mod the numbers are inserted in the order and two of the values hash to slot one value hashes to slot three of the values hash to slot and one value hashes to slot access record will be much higher because many elements on the linked list must be searched open hashing is most appropriate when the hash table is kept in main memorywith the lists implemented by standard in-memory linked list storing an open hash table on disk in an efficient way is difficultbecause members of given linked list might be stored on different disk blocks this would result in multiple disk accesses when searching for particular key valuewhich defeats the purpose of using hashing there are similarities between open hashing and binsort one way to view open hashing is that each record is simply placed in bin while multiple records may hash to the same binthis initial binning should still greatly reduce the number of records accessed by search operation in similar fashiona simple binsort reduces the number of records in each bin to small number that can be sorted in some other way closed hashing closed hashing stores all records directly in the hash table each record with key value kr has home position that is (kr )the slot computed by the hash function if is to be inserted and another record already occupies ' home positionthen