Method and device for processing table items based on Hash table

Abstract

The invention discloses a method and a device for processing table items based on a Hash table. The method comprises the steps of: during table item storage, storing table items to be stored in a result table in a sequential arrangement manner; calculating Hash values of key values of the table items to be stored by using dual Hash functions of an index table; and storing the Hash values and address pointers of the result table of the table items to be stored at idle positions in the index table. According to the invention, while lower access frequency and higher inquiry speed are guaranteed, the clause memory capacity of the service table items is increased effectively, the capacity of the Hash table for supporting possible services is increased, high spatial utilization rate is achieved for the Hash table, in addition, the probability of conflicts is reduced, and thus, the performance and the capacity of the Hash table are balanced.

Description

technical field [0001] The invention relates to the field of communication technology, in particular to a hash table-based entry processing method and device thereof. Background technique [0002] In the field of communication technology, a hash algorithm is often used for exact matching query of service table items. The hash function is used to perform hash operation on the key value of the business table entry, and the obtained calculation result value corresponds to the storage space in the hash table, that is, the hash operation result is addressed to realize the storage and operation of the table item. Inquire. [0003] In the current hash storage and query methods, the ubiquitous problem is the contradiction between performance and capacity. During the hash operation, although the key values ​​of each table entry are different, the operation results obtained through the hash function calculation may be the same, which will cause conflicts in the storage space. On th...

AI Technical Summary

Problems solved by technology

[0003] In the current hash storage and query methods, the ubiquitous problem is the contradiction between performance and capacity

During the hash operation, although the key values ​​of each entry are different, the calculation results obtained by the hash function may be the same, which will cause conflicts in the storage space

On the one hand, in order to minimize conflicts and ensure query performance, that is, one-time hit rate, the traditional hash table structure adopts a hash method when storing entries, that is, the storage addresses obtained through the hash function are often not continuous, so the hash table structure The space utilization rate of the Greek table is not high, and it will cause a very large waste of storage space when storing the table items. There are not many table items that can be stored, and the capacity index cannot meet the requirements.

On the other hand, in order to improve the lookup speed, the traditional hash table structure mostly uses the result of a hash calculation to index into the hash index table for lookup, but this will greatly increase the probability of collisions

Images