Hashing method based on double-counting bloom filter and hashing device

Abstract

The invention provides a hashing method for realizing hashing insert operation on a hash table; the hash table comprises a plurality of buckets, the bucket comprises an insert counter and a delete counter, the insert counter is used for recording the number of insert elements in the bucket, and the delete counter is used for recording the number of the delete elements in the bucket; the method comprises the following steps: the element to be operated is mapped to at least one bucket of the hash table according to hash function, and the bucket is called as a candidate bucket; a target bucket isfound from the candidate buckets according to selection principle of the target bucket; the elements to be inserted are inserted in the target bucket; weather the inserted elements have effect on thestorage position of the stored elements in the candidate bucket is judged, if the storage positions of the stored elements can not meet the selection principle of the target bucket, the storage positions of the stored elements are re-adjusted; the hashing method also comprises the step of accumulating the value of the insert counter of the bucket.

Description

technical field [0001] The invention relates to the field of data query, in particular to a double-count Bloom filter-based hash method and hash device. Background technique [0002] A hash table is a data structure that associates key values ​​with data values. It maps key values ​​to a storage location in the table through a hash function, thereby accessing related data values. Hash tables are widely used in many fields such as IP lookup, packet classification, and deep packet inspection. Although the hash table is helpful for fast data lookup, when the load of the hash table is large, multiple key values ​​will be mapped to the same storage location in the hash table, causing frequent conflicts in the hash table and increasing The access time of basic operations reduces the lookup performance of the hash table. In order to reduce the adverse effects of hash table collisions, those skilled in the art have proposed various conflict resolution methods including linear link...

AI Technical Summary

Problems solved by technology

[0008] The purpose of the present invention is to overcome the defect that existing hash tables are difficult to adapt to high-speed data packet processing and fast search applications, thereby providing a fast and efficient hash method and corresponding hash devices

Images