Dynamic hash method and device, equipment and storage medium

Abstract

The invention discloses a dynamic hash method and device, equipment and a storage medium. The method comprises the steps: obtaining the historical data of accessing a to-be-updated original hash tablein history, and determining the frequency of accessing a corresponding record located in the original hash table in history based on the historical data; generating a corresponding hash function based on the frequency corresponding record higher than the frequency threshold, so as to minimize the possibility of hash conflict when accessing the record of which the frequency is higher than the frequency threshold based on the generated hash function; creating a hash table corresponding to the generated hash function, and inserting each record contained in the original hash table into the generated hash table according to the generated hash function; and replacing the original hash table with the generated hash table, and replacing the hash function corresponding to the original hash table with the generated hash function. According to the method, the efficiency of the hash algorithm can be improved, so that the program running efficiency of the program to which the hash algorithm belongs is improved.

Description

technical field [0001] The present invention relates to the technical field of hashing, and more specifically, to a dynamic hashing method, device, equipment and storage medium. Background technique [0002] Hash can compress a message of any length into a fixed-length message digest. When using the hash algorithm to achieve record query, the records that need to be accessed are usually stored in the hash table, and the corresponding hash function is used to calculate the key value used to realize the record query to obtain the corresponding hash value, and then in the hash table Query the record at the position corresponding to the hash value in the Greek table, that is, the record that needs to be accessed; however, the conventional static hash (hash) algorithm will not be optimized as the user environment changes, so there are different environments. Different hash algorithms affect the program operation efficiency of the program to which they belong. Contents of the i...

AI Technical Summary

Problems solved by technology

When using the hash algorithm to achieve record query, the records that need to be accessed are usually stored in the hash table, and the corresponding hash function is used to calculate the key value used to realize the record query to obtain the corresponding hash value, and then in the hash table Query the record at the position corresponding to the hash value in the Greek table, that is, the record that needs to be accessed; however, the conventional static hash (hash) algorithm will not be optimized as the user environment changes, so there are different environments. The problem that different hash algorithms affect the program operation efficiency of the program due to their different efficiencies

Images