Method and device for adding, searching and deleting hash table

Abstract

The invention discloses a method and a device for adding, searching and deleting a hash table. The method for adding a hash table comprises the following steps of: extracting keywords of data to be added; performing hash operation on the keywords to obtain a hash address and a hash fingerprint; judging whether a corresponding target storage position is occupied according to the hash address; when the target storage position is occupied, searching for an unoccupied idle storage position from the hash table, and judging whether an occupied node at the target storage position is a first node of a bidirectional linked list; if so, adding a target node at the idle storage position according to the hash fingerprint, and linking the target node to the tail of the bidirectional linked list where the occupied node is positioned; and otherwise, moving the occupied node to the idle storage position, linking the occupied node to the tail of the bidirectional linked list where the occupied node is positioned, and adding a target node at the target storage position to constitute a single-node bidirectional linked list according to the hash fingerprint,. According to the method and the device, the utilization efficiency of the hash table and the utilization ratio of a storage space can be increased.

Description

technical field [0001] The invention relates to a method and device for adding, searching and deleting a hash table, and belongs to the technical field of data processing. Background technique [0002] Hash Table (Hash Table), also known as hash table, is a data structure that is directly accessed according to the data key value (Key Value). A traditional hash table usually includes multiple hash buckets with a certain bucket depth, and each hash bucket contains an element whose address obtained after hashing points to the bucket. In order to make the hash table achieve the desired utilization rate in the presence of conflicts, the number of hash buckets is usually increased to reduce the collision rate, and the maximum bucket depth of each hash bucket is increased to increase the tolerance for collisions . [0003] For the hash table under the software structure, as long as the processor has enough processing power, the above methods are easy to implement; but for the has...

AI Technical Summary

Problems solved by technology

[0003] For the hash table under the software structure, as long as the processor has enough processing power, the above methods are easy to implement; but for the hash table under the traditional hardware structure, no matter increasing the number of hash buckets or increasing the number of each hash bucket The maximum depth of each hash bucket means that more storage resources will be occupied, and storage resources are always limited, so a balance must be made between the number of hash buckets and the maximum depth of each hash bucket, which is Make it difficult to greatly improve the utilization efficiency of the hash table

Images