Method and device for storing and searching keyword

Abstract

A method for storing keyword is disclosed, which includes: a keyword is operated respectively on the first and the second hash function in order to obtain the first and the second hash bucket addresses; the first and the second hash buckets are searched according to the first and the second hash bucket addresses; if no compressed keyword which conflicts with the compressed keyword of the keyword exists in the first hash bucket, the compressed keyword of the keyword and the pointer of the keyword are stored into the first hash bucket when the first hash bucket has remaining space; or the compressed keyword of the keyword and the pointer of the keyword are stored into the second hash bucket, when the first hash bucket has no remaining space and the second hash bucket has remaining space, and no compressed keyword which conflicts with the compressed keyword of the keyword exists in the second hash bucket. A method for searching keyword, a device for storing keyword and a device for searching keyword are also disclosed. The present invention enables increasing memory utilization ratio greatly and saving memory space and bandwidth.

Description

technical field [0001] The invention relates to the technical field of communication, in particular to methods and devices for storing and searching keywords. Background technique [0002] The exact matching algorithm based on hash is widely used in various fields. Low latency, low collision probability and high performance are the goals everyone is pursuing. [0003] The prior art provides a solution for realizing an exact matching search through a secondary hash algorithm. In this solution, two hash functions are used for a keyword (key) for an exact match search. [0004] Through the hash function 1 operation, an initial hash bucket address can be obtained, and the initial hash bucket contains several compressed key units and a cascaded linked list pointer. Each compression key unit consists of a compression key and a key pointer. A valid cascaded linked list pointer points to a cascaded hash bucket. The data structure of the cascaded hash bucket is consistent with t...

AI Technical Summary

Problems solved by technology

But the bucket depth of the initial hash bucket is too deep, which will lead to waste of storage space and bandwidth

The conflict of the hash function 2 will lead to the conflict of the compression key, which requires multiple visits to the hash bucket to complete the search, which will increase the search delay

Images