WO2012106916A1

WO2012106916A1 - Method and apparatus for processing hash calculations

Info

Publication number: WO2012106916A1
Application number: PCT/CN2011/077484
Authority: WO
Inventors: 卢胜文
Original assignee: 华为技术有限公司
Priority date: 2011-07-22
Filing date: 2011-07-22
Publication date: 2012-08-16
Also published as: CN102308296A

Abstract

Disclosed in the embodiment of the present invention is a method and device for processing Hash calculations. The method comprises: receiving a message and extracting keywords from the message that requires Hash calculation; using a primary Hash function to perform a Hash calculation for the keywords; and determining whether the number of first conflict terms in a primary Hash storage block corresponding to a primary Hash value is smaller than a preset maximum conflict number. If the number of first conflict terms in the primary Hash storage block is smaller than the maximum conflict number, establishing a first conflict term corresponding to the keywords in the primary Hash storage block; if the number of first conflict entries in the primary Hash storage block is not smaller than the maximum conflict number, performing a Hash calculation for the keywords using a secondary Hash function, and establishing a secondary conflict term corresponding to the keywords in the secondary Hash storage block that corresponds to the secondary Hash value. The present invention applies to Hash calculation processing in the field of data processing technology.

Description

Hash calculation processing method and device

The present invention relates to the field of data processing technologies, and in particular, to a hash calculation processing method and apparatus. Background technique

A hash table, also called a hash table, is a versatile and efficient looking data table. The keyword is mapped to a value by a mapping function called a hash function, which is called a hash value. The hash value is usually used as the location of the table to access the record to speed up the lookup. However, when performing hash calculation on different keywords, you may get the same hash value, that is, the keyword key 1≠Key2, and the hash value key ( key 1 ) = Η ( Key2 ). This phenomenon is called Hash Chong

To solve the hash conflict, the usual practice is to create a hash bucket under the same hash value. Each hash bucket stores one record, forming a conflict list. When searching, first find the given value through the hash function. The hash address Η ( Κ ), then read the records in its hash bucket with Η ( Κ ) as the address, and finally match the read records with the keyword ,, if there is a match If the record is found, the search is successful, otherwise the search fails. However, the problem with this method is that the length of the hash collision chain generated when hashing the keywords in the message cannot be controlled. If the length of the hash collision chain is too long, the storage efficiency of the message may be caused. Very low.

The Ternary Content Addressable Memory (TCAM) is a hardware chip dedicated to the search operation. It is mainly used to quickly find the Access Control List (ACL), routing and other entries. The entry of the entry into the TCAM enables the length of the hash collision chain to be controlled.

In the process of implementing the present invention, the inventors have found that at least the following problems exist in the prior art: In the prior art, in order to solve the problem of hash collision of a message, a method of establishing a hash bucket is used, and a hash collision chain cannot be controlled. The length of the hash collision chain is too long, resulting in a low efficiency of message storage. The method of hash processing by TCAM can control the length of the hash collision chain. Degree, but the implementation cost is higher. Summary of the invention

Embodiments of the present invention provide a hash calculation processing method and apparatus for solving the problem of high cost of hash collision chain length control existing in the prior art.

The technical solution adopted by the embodiment of the present invention is:

A hash calculation processing method includes:

Receiving a message, and extracting a keyword that needs to perform a hash calculation in the packet;

Using the primary hash function to hash the keyword to obtain a primary hash value corresponding to the keyword;

Determining whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts; wherein the primary hash storage block includes at least one of the first a conflicting entry, each of the first conflicting entries corresponding to a keyword, and the primary hash of each keyword of the first conflicting entry calculated by the primary hashing function The value is the same; if the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, establishing a first conflicting table corresponding to the keyword in the primary hash storage block Item

If the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, the candidate hash function is used to perform hash calculation on the keyword to obtain an alternate hash corresponding to the keyword. a second conflict entry corresponding to the keyword is established in the standby hash storage block corresponding to the standby hash value; wherein, the primary hash value and the standby hash value are not Similarly, the standby hash storage block includes at least one of the second conflicting entries, each of the second conflicting entries corresponding to a keyword, and the keyword corresponding to each of the second conflicting entries passes the The alternate hash value obtained after the standby hash function is calculated is the same.

A hash calculation processing device includes:

a receiving module, configured to receive a message;

a keyword extraction module, configured to extract a keyword that needs to perform hash calculation in the packet; a primary hash calculation module, configured to perform hash calculation on the keyword by using a primary hash function, Obtaining a primary hash value corresponding to the keyword;

a first determining module, configured to determine whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts; wherein, the primary hash storage The block includes at least one of the first conflicting entries, each of the first conflicting entries corresponding to a keyword, and a keyword corresponding to each of the first conflicting entries is calculated by using the primary hash function. The primary hash value is the same;

a first conflicting table entry establishing module, configured to establish, in the primary hash storage block, the key in the primary hash storage block when the number of the first conflicting entry in the primary hash storage block is less than the maximum conflicting number The first conflicting entry corresponding to the word;

a backup hash calculation module, configured to: when the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, use a backup hash function to perform hash calculation on the keyword, An alternate hash value corresponding to the keyword;

a second conflict entry establishing module, configured to establish a second conflicting entry corresponding to the keyword in the standby hash storage block corresponding to the standby hash value, where the primary hash value is The standby hash value is different, the standby hash storage block includes at least one second conflicting entry, each of the second conflicting entries corresponds to a keyword, and each of the second conflicting entries The standby hash value obtained by calculating the corresponding keyword by the standby hash function is the same.

The hash calculation processing method and apparatus provided by the embodiment of the present invention, by extracting keywords that need to be hashed in the message, hashing the keyword using the primary hash function, and obtaining the keyword Corresponding primary hash value, determining whether the number of the first conflict entry in the primary hash storage block corresponding to the primary hash value is less than a preset maximum conflict number, if the primary hash storage If the number of the first conflicting entries in the block is smaller than the maximum number of conflicts, the first conflicting entry corresponding to the keyword is established in the primary hash storage block, if the primary hash storage block The number of the first conflicting table entries is not less than the maximum number of conflicts, and the keyword is hashed using an alternate hash function to obtain an alternate hash value corresponding to the keyword, A second conflicting entry corresponding to the keyword is established in the spare hash storage block corresponding to the hash value. Embodiment of the present invention The hash calculation processing method and device can solve the problem that the prior art performs hash calculation on the keywords in the message when performing hash calculation processing on the keywords in the message. The problem that the length of the collision chain cannot be controlled, thereby improving the storage efficiency of the message. DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings used in the embodiments or the prior art description will be briefly described below. It is obvious that the drawings in the following description are only the present invention. For some embodiments, other drawings may be obtained from those of ordinary skill in the art without departing from the drawings.

1 is a flowchart of a hash calculation processing method according to Embodiment 1 of the present invention;

2 is a flowchart of a hash calculation processing method according to Embodiment 2 of the present invention;

3 is a schematic structural diagram of a hash storage block according to Embodiment 2 of the present invention;

4 is a schematic structural diagram of a primary hash storage block when the number of first conflict entries is less than the maximum number of collisions according to Embodiment 2 of the present invention;

Figure 5 (a) is a schematic structural diagram of a primary hash storage block when the number of first conflict entries is not less than the maximum number of collisions according to the second embodiment of the present invention;

FIG. 5(b) is a schematic structural diagram of a backup hash storage block according to Embodiment 2 of the present invention; FIG. 6 is a flowchart of a hash calculation processing method according to Embodiment 3 of the present invention;

7 is a flowchart of a hash calculation processing method according to Embodiment 4 of the present invention;

8 is a schematic structural diagram of a hash calculation processing apparatus according to Embodiment 5 of the present invention;

9 is a flowchart of the operation of the hash calculation processing apparatus according to Embodiment 5 of the present invention;

10 is a schematic diagram of a hardware circuit of a hash calculation processing apparatus according to Embodiment 5 of the present invention; FIG. 11 is a schematic structural diagram of a hash calculation processing apparatus according to Embodiment 5 of the present invention;

12 is a schematic structural diagram of a hash calculation processing apparatus according to Embodiment 5 of the present invention;

FIG. 13 is a schematic structural diagram of a hash calculation processing apparatus according to Embodiment 5 of the present invention. detailed description

The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. It is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

In order to make the advantages of the technical solutions of the present invention clearer, the present invention will be described in detail below with reference to the accompanying drawings and embodiments.

Embodiment 1

This embodiment provides a hash calculation processing method. As shown in FIG. 1, the method includes:

101. Receive a message, and extract a keyword that needs to perform a hash calculation in the packet.

102. Perform hash calculation on the keyword by using a primary hash function, to obtain a primary hash value corresponding to the keyword;

103. Determine whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts, where the primary hash storage block includes at least one a first conflicting entry, each of the first conflicting entries corresponding to a keyword, and the keyword corresponding to each of the first conflicting entries is calculated by using the primary hashing function. The hash value is the same;

104. If the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, establish a first conflicting entry corresponding to the keyword in the primary hash storage block. ;

105. If the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, use a backup hash function to perform hash calculation on the keyword, to obtain a corresponding to the keyword. a second hash entry corresponding to the keyword, in the standby hash storage block corresponding to the standby hash value, where the primary hash value and the standby hash are The value of the second hash entry includes at least one of the second conflicting entries, and each of the second conflicting entries corresponds to a keyword, and the keyword corresponding to each of the second conflicting entries passes The standby hash value obtained after the calculation of the standby hash function is the same. The hash calculation processing method provided by the embodiment of the present invention performs hash calculation on the keyword by using a primary hash function by extracting a keyword that needs to perform hash calculation in the packet, and obtains a keyword corresponding to the keyword. Determining, by the primary hash value, whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts, if the primary hash storage block is used And establishing, by the primary hash storage block, a first conflicting entry corresponding to the keyword, if the number of the first conflicting entry is less than the maximum number of conflicts, if the primary hashing block is in the primary hashing block The number of the first conflicting entry is not less than the maximum number of conflicts, and the keyword is hashed using an alternate hash function to obtain an alternate hash value corresponding to the keyword, and the standby hash value is A second conflicting entry corresponding to the keyword is established in the corresponding standby hash storage block. The hash calculation processing method provided by the embodiment of the present invention can solve the problem that the prior art performs hash calculation on the keywords in the message when performing hash calculation processing on the keywords in the message. The length of the hash collision chain cannot be controlled, thereby improving the storage efficiency of the message.

Embodiment 2

This embodiment provides a hash calculation processing method. As shown in FIG. 2, the method includes:

201. Receive a packet, and extract an IP address that needs to be hashed in the packet.

202. Perform a hash calculation on the IP address of the packet by using a primary hash function, and obtain a primary hash value corresponding to the IP address of the packet;

203. Determine whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts, where the primary hash storage block includes at least one The first conflicting entry, each of the first conflicting entries corresponds to an IP address of a packet, and the IP address of the packet corresponding to each of the first conflicting entries is calculated by using the primary hash function. The obtained primary hash value is the same;

204. If the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, establish a first one corresponding to the IP address of the packet in the primary hash storage block. Conflict entry

The conflicting entry includes: a flag for performing a hash calculation using an alternate hash function, The entry valid tag and the IP address of the packet. As shown in FIG. 3, whether the flag B in the conflicting entry in the figure uses the alternate hash function for hash calculation is used to identify that the IP address of the packet is hashed using the primary hash function, or Use the alternate hash function for hash calculations. For example, when B=0, it means that the IP address of the message is hashed using the primary hash function. When B=l, it means that the IP address of the packet is used by using the alternate hash function. Greek calculation. The table entry valid flag D in the conflicting entry is used to identify whether the conflicting entry is valid. When D=l, it indicates that the conflicting entry is valid. When D=0, the conflicting entry is invalid. .

The hash storage block includes: a flag of a conflict entry established by the alternate hash function and an alternate hash function type flag. Specifically, as shown in FIG. 3, a counter C of a common standby hash function may be set in the hash storage block for counting the second conflicting entry established by the standby hash function, when C=0 When it is, there is no second conflicting entry established by the standby hash function. When C=l, it indicates that there is a second conflicting entry established by the standby hash function. The alternate hash function type flag T in the hash memory block in the figure indicates whether an alternate hash function is set. When T=0, it indicates that the alternate hash function is not set.

205. When the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, determine whether the standby hash function type flag in the primary hash storage block is set. ;

206. If the standby hash function type flag in the primary hash storage block has been set, select a hash function corresponding to the standby hash function type flag according to the standby hash function type flag. As a backup hash function;

207. If the alternate hash function type flag in the primary hash storage block is not set, select a hash function as a standby hash function, and set the in the primary hash storage block. The type flag of the alternate hash function;

Specifically, a hash function that generates less hash collision than the primary hash function may be selected as the standby hash function;

Alternatively, by performing hash calculation on the IP address of the packet by using at least one hash function, obtaining at least one hash function value corresponding to the IP address of the packet, and selecting one and the at least one The hash function in the hash storage block corresponding to the hash function value is smaller than the hash function of the maximum conflict number as the standby hash function.

208. Perform a hash calculation on the IP address of the packet by using the standby hash function, and obtain an alternate hash value corresponding to the IP address of the packet.

209. Establish a second conflicting entry corresponding to the IP address of the packet in the standby hash storage block corresponding to the standby hash value.

Specifically, an initial value of a counter of a common standby hash function in the primary hash storage block may be set to a predetermined number (for example, 0), when the first one of the primary hash storage blocks is When the number of the conflicting entries is not less than the maximum number of conflicts, a second conflicting entry corresponding to the IP address of the packet is established in the standby hash storage block, and the primary hash storage block is used. The counter value of the counter of the common alternate hash function is incremented by one.

As shown in FIG. 4, for example, the maximum number of collisions for generating a hash collision in the hash storage block is 6, and after receiving the message, extracting an IP address for which the packet needs to be hashed, assuming the The IP address of the packet is 10.0.0.1, and the IP address 10.0.0.1 of the packet is hashed using the primary hash function, and the primary user corresponding to the IP address 10.0.0.1 of the message is obtained. The hash value is 1, and it is determined that the number of the first conflict entry in the primary hash storage block corresponding to the primary hash value 1 is 0, less than the maximum conflict number 6, and is stored in the primary hash. A first conflict entry corresponding to the IP address 10.0.0.1 of the packet is established in the block. If the message 11.0.0.1 is received again, the IP address 11.0.0.1 of the hash calculation is extracted, and the primary hash function is used to perform hash calculation on the IP address 11.0.0.1 of the message. Obtaining that the primary hash value corresponding to the IP address 11.0.0.1 of the packet is also 1, and determining that the number of the first conflict entry in the primary hash storage block corresponding to the primary hash value 1 is 1 . The first conflicting entry corresponding to the IP address 11.0.0.1 of the packet is established in the primary hash storage block, and the primary hash storage block is used. The number of the first conflicting entries in the middle is 2. Similarly, in turn, the message 12.0.0.1, the message 13.0.0.1, the message 14.0.0.1, the message 15.0.0.1 are received, and the primary hash function is used to sequentially address the IP address 12.0.0.1, 13.0.0.1, 14.0.0.1, 15.0.0.1 perform hash calculation, and the main hash values corresponding to IP addresses 12.0.0.1, 13.0.0.1, 14.0.0.1, 15.0.0.1 are all 1 . Determining that the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value 1 is 2, 3, 4, 5, respectively, which are smaller than the maximum conflicting number 6, in the primary use A first conflicting entry corresponding to the IP address 12.0.0.1, 13.0.0.1, 14.0.0.1, 15.0.0.1 is established in the hash storage block, and the number of the first conflicting entry in the primary hash storage block is Is 6.

As shown in FIG. 5(a), if a packet with an IP address of 16.0.0.1 is received at this time, the primary hash function is used to perform a hash calculation on the IP address 16.0.0.1 of the packet. Obtaining that the primary hash value corresponding to the IP address 16.0.0.1 of the packet is also 1, and determining that the number of the first conflict entry in the primary hash storage block corresponding to the primary hash value 1 is 6, not less than the maximum number of collisions 6, determining whether the standby hash function type flag T in the primary hash storage block is set, if the standby hash in the primary hash storage block The hash function type flag T=l indicates that the alternate hash function type flag in the primary hash storage block has been set, and the standby hash function type is selected according to the standby hash function type flag. a hash function corresponding to the flag as a standby hash function; if the alternate hash function type flag Τ=0 in the primary hash storage block, indicating the standby hash in the primary hash storage block The Greek function type flag is not set, select one than the main Using a hash function to generate a hash function with less hash collision as a standby hash function, or hashing the IP address of the packet by using at least one hash function to obtain at least one IP with the packet a hash function value corresponding to the address, selecting a hash function in the hash storage block corresponding to the at least one hash function value that is smaller than the maximum conflict number as the standby hash function, using the The standby hash function performs a hash calculation on the IP address 16.0.0.1 of the packet, and obtains an alternate hash value corresponding to the IP address 16.0.0.1 of the packet, and stores the primary hash in the primary hash. The alternate hash function type flag is set in the block. As shown in FIG. 5(b), a second conflict entry corresponding to the IP address 16.6.1.1 of the packet is established in the spare hash storage block corresponding to the standby hash value 16, and the The count value of the counter of the alternate hash function in the primary hash block is incremented by one.

The hash calculation processing method provided by the embodiment of the present invention, by setting whether a flag of a conflict entry established by a standby hash function and an alternate hash function type flag are set in the primary hash storage block, when the primary hash is used When the number of the first conflicting entries in the storage block is not less than the maximum number of conflicts, Determining whether the standby hash function type flag in the primary hash storage block is set, if the standby hash function type flag in the primary hash storage block has been set, according to the standby a hash function type flag, selecting a hash function corresponding to the standby hash function type flag as a standby hash function, performing hash calculation on the keyword by using the standby hash function, and obtaining the keyword And corresponding to the standby hash value, establishing a second conflicting entry corresponding to the keyword in the standby hash storage block corresponding to the standby hash value. The hash calculation processing method provided by the embodiment of the present invention can solve the problem that the prior art performs hash calculation on the keywords in the message when performing hash calculation processing on the keywords in the message. The length of the hash collision chain cannot be controlled, thereby improving the storage efficiency of the message.

Embodiment 3

This embodiment provides a hash calculation processing method. As shown in FIG. 6, the method includes:

601. Perform a hash calculation on the keyword of the packet by using a primary hash function, to obtain a primary hash value corresponding to the keyword;

602. Search, in the primary hash storage block, the first conflicting entry corresponding to the keyword, and determine whether a location corresponding to the keyword is found in the primary hash storage block. The first conflicting entry;

603. If the first conflicting entry corresponding to the keyword is found in the primary hash storage block, return a search result.

604. If the first conflict entry corresponding to the keyword is not found in the primary hash storage block, obtain whether the primary hash storage block exists in the primary hash storage block by using a standby hash. a flag of the conflicting entry established by the function and the alternate hash function type flag;

605. Determine, according to whether the identifier of the conflicting entry established by the standby hash function exists in the primary hash storage block, whether there is the first identifier corresponding to the keyword established by the standby hash function. Second conflict entry;

606. If there is no second conflict entry corresponding to the keyword established by the standby hash function, the return is not found; 607. If there is the second conflict entry corresponding to the keyword established by the standby hash function, use the standby hash corresponding to the standby hash function type flag in the primary hash storage block. The function performs a hash calculation on the keyword to obtain an alternate hash value corresponding to the keyword;

608. Search, in the standby hash storage block corresponding to the standby hash value, whether the second conflicting entry corresponding to the keyword is found by the keyword pair.

609. If the second conflict entry corresponding to the keyword is found in the standby hash storage block, return a search result, if the key is not found in the standby hash storage block. The second conflicting entry corresponding to the word is returned without being found.

The hash calculation processing method provided by the embodiment of the present invention, if the first conflict entry corresponding to the keyword is not found in the primary hash storage block, the standby hash function in the primary hash storage block is used. The standby hash function corresponding to the type flag performs hash calculation on the keyword, obtains a standby hash value corresponding to the keyword, and searches for a location in the spare hash storage block corresponding to the standby hash value. The second conflicting entry corresponding to the keyword returns the search result. Compared with the prior art, the hash calculation processing method provided by the embodiment of the present invention, when the first conflict entry corresponding to the keyword is not found in the primary hash storage block, is in the standby hash storage. Querying the second conflicting entry corresponding to the keyword in the block can shorten the search time of the packet, thereby improving the searching efficiency of the packet.

Embodiment 4

The embodiment provides a hash calculation processing method. As shown in FIG. 7, the method includes: 701. Search, in a primary hash storage block, a first conflict entry corresponding to a keyword of a packet;

702. Determine whether a first conflicting entry corresponding to the keyword is found in the primary hash storage block.

703. If the first conflicting entry corresponding to the keyword is found in the primary hash storage block, delete the first conflicting entry corresponding to the keyword.

704. If the first rush corresponding to the keyword is not found in the primary hash storage block a table entry, obtaining, in the primary hash storage block, whether there is a flag of a conflicting entry established by a standby hash function and the standby hash function type flag;

705. Determine, according to whether the identifier of the conflicting entry established by the standby hash function exists in the primary hash storage block, whether there is the first identifier corresponding to the keyword established by the standby hash function. Second conflict entry;

Specifically, it may be determined by a counter of a common standby hash function in the primary hash storage block whether there is a second conflict entry established by the standby hash function, if the primary hash storage block If the count value of the counter of the standby hash function is not 0, there is a conflict entry established by the standby hash function. If the count value of the counter of the standby hash function in the primary hash storage block is 0, then There is no conflict entry created by the alternate hash function.

706. If there is no second conflict entry corresponding to the keyword established by the standby hash function, the return is not found;

707. If there is the second conflict entry corresponding to the keyword established by the standby hash function, use the standby hash corresponding to the standby hash function type flag in the primary hash storage block. The function performs a hash calculation on the keyword to obtain an alternate hash value corresponding to the keyword;

708. Search for a second conflicting entry corresponding to the keyword in the standby hash storage block corresponding to the standby hash value; a second conflicting entry corresponding to the key;

710. If the second conflicting entry corresponding to the keyword is found in the standby hash storage block, deleting the second conflicting entry corresponding to the keyword, if If the second conflict entry corresponding to the keyword is not found in the spare hash storage block corresponding to the standby hash value, the return is not found.

Specifically, after deleting the second conflict entry corresponding to the keyword in the standby hash storage block, the counter value of the counter of the standby hash function in the primary hash storage block is decremented by one. The hash calculation processing method provided by the embodiment of the present invention, if the first conflict entry corresponding to the keyword of the packet is found in the primary hash storage block, deleting the primary hash storage block in the primary hash storage block If the first conflicting entry corresponding to the keyword is not found in the primary hash storage block, the first conflicting entry corresponding to the keyword is searched for in the standby hash storage block. The second conflicting entry corresponding to the keyword is deleted, and if found, the second conflicting entry corresponding to the keyword is deleted in the standby hash storage block. Compared with the prior art, the hash calculation processing method provided by the embodiment of the present invention can solve the problem that the length of the hash collision chain generated by the prior art hashing the keywords in the message cannot be solved in a low-cost manner. Control problems, thereby improving the storage efficiency of messages.

Embodiment 5

The embodiment provides a hash calculation processing device. As shown in FIG. 8, the device includes: a receiving module 801, configured to receive a message;

a keyword extraction module 802, configured to extract a keyword that needs to perform hash calculation in the packet; a primary hash calculation module 803, configured to perform hash calculation on the keyword by using a primary hash function, to obtain The primary hash value corresponding to the keyword;

a first determining module 804, configured to determine whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts; wherein, the primary hash The storage block includes at least one of the first conflicting entries, each of the first conflicting entries corresponding to a keyword, and the keyword corresponding to each of the first conflicting entries is calculated by using the primary hash function. The obtained primary hash value is the same;

a first conflicting entry establishing module 805, configured to establish, in the primary hash storage block, the number of the first conflicting entry in the primary hash storage block when the number of the first conflicting entries is smaller than the maximum number of conflicting entries The first conflicting entry corresponding to the keyword;

The standby hash calculation module 806 is configured to: when the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, use a standby hash function to perform hash calculation on the keyword, Obtaining an alternate hash value corresponding to the keyword;

a second conflict entry creation module 807, configured to store the standby hash corresponding to the standby hash value Establishing, in the storage block, a second conflicting entry corresponding to the keyword; wherein, the primary hash value is different from the standby hash value, and the standby hash storage block includes at least one of the second a conflicting entry, each of the second conflicting entries corresponding to a keyword, and the candidate hash value obtained by calculating the keyword corresponding to the second conflicting entry is the same.

As shown in FIG. 9, after receiving the message by the receiving module, the keyword extraction module extracts a keyword that needs to be hashed in the message, and uses the main hashing module to use the main user. The hash function performs a hash calculation on the keyword, and obtains a primary hash value corresponding to the keyword, and determines, by the first determining module, a primary hash storage block corresponding to the primary hash value. If the number of the first conflicting entries is less than the preset maximum number of conflicts, if the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, the first conflicting entry is established. The module establishes, in the primary hash storage block, a first conflicting entry corresponding to the keyword; if the number of the first conflicting entry in the primary hashed storage block is not less than the maximum number of conflicts, The standby hash calculation module uses the standby hash function to perform hash calculation on the keyword, to obtain a backup hash value corresponding to the keyword, and the second conflict entry entry establishing module is in the standby hope A second conflicting entry corresponding to the keyword is established in the alternate hash storage block corresponding to the value.

Specifically, as shown in FIG. 10, after receiving the packet, the keyword extraction module extracts, by using a processor (such as a CPU), a keyword that needs to perform hash calculation in the packet, where The primary hash calculation module performs hash calculation on the keyword by using the primary hash function by the processor, obtains a primary hash value corresponding to the keyword, and uses the primary hash value. Send to memory for storage. The first determining module determines, by the processor, whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is smaller than a maximum number of conflicts preset in the memory, If the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, the first conflicting entry establishing module is established in the primary hash storage block by the processor. a first conflicting entry corresponding to the keyword, and sending a hash calculation processing result to another device by using an interface unit; if the number of the first conflicting entry in the primary hash storage block is not less than the maximum conflict Number, the standby hash calculation module uses an alternate hash function by the processor Performing a hash calculation on the keyword to obtain a backup hash value corresponding to the keyword, where the second conflict entry creation module passes the standby hash corresponding to the standby hash value by the processor. A second conflicting entry corresponding to the keyword is established in the storage block, and the hash calculation processing result is sent to other devices through the interface unit.

Further, the conflict entry includes: a flag for hash calculation using an alternate hash function, a valid entry of the entry, and the keyword.

Further, the hash storage block includes: a flag of whether there is a conflict entry established by the standby hash function and an alternate hash function type flag.

Further, as shown in FIG. 11, the primary hash calculation module 803 includes:

a determining unit 8031, configured to determine whether the standby hash function type flag in the primary hash storage block is set; when the type flag has been set, according to the standby in the primary hash storage block a hash function type flag, selecting a hash function corresponding to the alternate hash function type flag as a standby hash function;

The first calculating unit 8033 is configured to hash the keyword by using the standby hash function. As shown in FIG. 11, the primary hash computing module 803 may further include: the type flag is not set. When selecting a hash function as an alternate hash function;

The first calculating unit 8033 is further configured to perform hash calculation on the keyword by using the standby hash function;

The setting unit 8035 is configured to set the standby hash function type flag in the primary hash storage block.

Further, as shown in FIG. 11, the second selecting unit 8034 further includes:

a first selection sub-unit 80341 for selecting a hash collision than the primary hash function Less hash function as a standby hash function;

a second selection sub-unit 80342, configured to perform hash calculation on the keyword by using at least one hash function to obtain at least one hash function value corresponding to the keyword, and select one and the at least one hash The hash function in the hash storage block corresponding to the function value is smaller than the hash function of the maximum conflict number as the standby hash function.

Further, as shown in FIG. 12, the apparatus may further include:

The finding module 808 is configured to search, in the primary hash storage block, the first conflicting entry corresponding to the keyword;

The returning module 809 is configured to: when the first conflicting entry corresponding to the keyword is found in the primary hash storage block, return a search result;

The obtaining module 810 is configured to: when the first conflicting entry corresponding to the keyword is not found in the primary hash storage block, obtain the whether in the primary hash storage block There is a flag of the conflicting entry established by the alternate hash function and the alternate hash function type flag;

The second determining module 811 is configured to determine, according to the flag of the conflicting entry established by the standby hash function in the primary hash storage block, whether there is a key established by the standby hash function and the key The second conflicting entry corresponding to the word;

The returning module 809 is configured to: when there is no second conflicting entry corresponding to the keyword established by the standby hash function, returning is not found;

The standby hash calculation module 806 is further configured to use the foregoing in the primary hash storage block when there is the second conflict entry corresponding to the keyword established by the standby hash function. The standby hash function corresponding to the standby hash function type flag performs hash calculation on the keyword to obtain a standby hash value corresponding to the keyword; and searches for the second conflict entry corresponding to the keyword ;

The returning module 809 is further configured to: when the second conflicting entry corresponding to the keyword is found in the standby hash storage block, return a search result; The returning module 809 is further configured to: when the second conflicting entry corresponding to the keyword is not found in the standby hash storage block, the return is not found.

Further, as shown in FIG. 13, the apparatus may further include:

The searching module 808 is further configured to search, in the primary hash storage block, the first conflicting entry corresponding to the keyword;

a deleting module 812, configured to delete the first conflict corresponding to the keyword when the first conflicting entry corresponding to the keyword is found in the primary hash storage block Entry.

Further, as shown in FIG. 13, the apparatus may further include:

The obtaining module 810 is further configured to: when the first conflicting entry corresponding to the keyword is not found in the primary hash storage block, obtain the location in the primary hash storage block. Determining whether there is a flag of the conflicting entry established by the standby hash function and the standby hash function type flag; the second determining module 811 is further configured to: according to whether the primary hash storage block is There is a flag of the conflicting entry established by the standby hash function, and it is determined whether there is the second conflicting entry corresponding to the keyword established by the standby hash function;

The returning module 809 is further configured to: when there is no second conflicting entry corresponding to the keyword established by the standby hash function, the return is not found;

The standby hash calculation module 806 is further configured to use the foregoing in the primary hash storage block when there is the second conflict entry corresponding to the keyword established by the standby hash function. The standby hash function corresponding to the standby hash function type flag performs hash calculation on the keyword to obtain a standby hash value corresponding to the keyword; and finds a second conflicting entry corresponding to the keyword;

The deleting module 812 is further configured to: when the second conflict entry corresponding to the keyword is found in the standby hash storage block, delete the first corresponding to the keyword Second conflict entry; When the second conflicting entry corresponding to the keyword is not found, the return is not found. The hash calculation processing apparatus provided by the embodiment of the present invention extracts a keyword in the message that needs to be hashed by the keyword extraction module, and uses the main hash function to perform the keyword on the keyword by using the main hash calculation module. In the calculation, the primary hash value corresponding to the keyword is obtained, and the first determining module determines whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a maximum number of conflicts, if the number of the first conflicting entries in the primary hash storage block is less than the maximum number of conflicts, the first conflicting entry building module is established in the primary hash storage block. The first conflicting entry corresponding to the keyword, if the number of the first conflicting entries in the primary hash storage block is not less than the maximum number of conflicts, hashing the keyword using an alternate hash function Calculating, obtaining a backup hash value corresponding to the keyword, and establishing, by the second conflict establishing module, a second conflicting entry corresponding to the keyword in the standby hash storage block corresponding to the standby hash value . The hash calculation processing apparatus provided by the embodiment of the present invention can solve the problem that the prior art performs hash calculation on the keywords in the message when performing hash calculation processing on the keywords in the message. The length of the hash collision chain cannot be controlled, thereby improving the storage efficiency of the message.

The Hash calculation processing apparatus provided by the embodiment of the present invention may implement the foregoing method embodiment. For the specific function implementation, refer to the description in the method embodiment, and details are not described herein again. The hash calculation processing method and apparatus provided by the embodiments of the present invention can be applied to the switch router products in the field of data communication or wireless communication, but are not limited thereto.

A person skilled in the art can understand that all or part of the process of implementing the above embodiment method can be completed by a computer program to instruct related hardware, and the program can be stored in a computer readable storage medium. In execution, the flow of an embodiment of the methods as described above may be included. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), or a random access memory (RAM).

The above is only a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto, and any person skilled in the art can easily within the technical scope disclosed by the present invention. All changes or substitutions contemplated are intended to be included within the scope of the invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

Claim

A hash calculation processing method, comprising:

Performing a hash calculation on the keyword by using a primary hash function to obtain a primary hash value corresponding to the keyword;

Determining whether the number of the first conflicting entries in the primary hash storage block corresponding to the primary hash value is less than a preset maximum number of conflicts; wherein the primary hash storage block includes at least one of the first a conflicting entry, each of the first conflicting entries corresponding to a keyword, and the primary hash of each keyword of the first conflicting entry calculated by the primary hashing function The same value;

And establishing, by the primary hash storage block, a first conflicting entry corresponding to the keyword, if the number of the first conflicting entries in the primary hash storage block is smaller than the maximum number of conflicting entries;

2. The method according to claim 1, wherein the conflict entry includes: a flag for hash calculation using an alternate hash function, an entry valid flag, and the keyword.

3. The method according to claim 2, wherein the hash storage block comprises: a flag of a conflict entry established by the standby hash function and an alternate hash function type flag.

The method according to claim 3, wherein the hashing of the keyword by using a standby hash function includes:

Determining whether the alternate hash function type flag in the primary hash storage block is set, such as If the standby hash function type flag in the primary hash storage block has been set, selecting a hash function corresponding to the standby hash function type flag as a backup according to the standby hash function type flag A hash function that hashes the keyword using the alternate hash function.

5. The method according to claim 4, further comprising:

If the alternate hash function type flag in the primary hash storage block is not set, selecting a hash function as a standby hash function, and hashing the keyword using the alternate hash function ;

The alternate hash function type flag is set in the primary hash storage block.

The method according to claim 5, wherein the selecting a hash function as the standby hash function comprises:

Selecting a hash function that produces fewer hash collisions than the primary hash function as an alternate hash function;

Or,

Performing a hash calculation on the keyword by using at least one hash function to obtain at least one hash function value corresponding to the keyword, and selecting a hash storage block corresponding to the at least one hash function value The hash function whose number of conflict table entries is smaller than the maximum number of conflicts is used as an alternate hash function.

7. The method according to claim 3, further comprising:

Locating, in the primary hash storage block, the first conflicting entry corresponding to the keyword, if the first corresponding to the keyword is found in the primary hash storage block Conflict entry, returning the search result;

If the first conflict entry corresponding to the keyword is not found in the primary hash storage block, obtaining whether the primary hash storage block exists in the primary hash storage block is established by using a standby hash function. The flag of the conflicting entry and the alternate hash function type flag;

Determining, according to the flag of the conflicting entry established by the standby hash function in the primary hash storage block, whether there is the second conflict corresponding to the keyword established by the standby hash function Entry, if there is no corresponding to the keyword established by the alternate hash function The second conflict entry, the return is not found;

If there is the second conflict entry corresponding to the keyword established by the standby hash function, using the alternate hash function pair corresponding to the alternate hash function type flag in the primary hash storage block Performing a hash calculation on the keyword to obtain a backup hash value corresponding to the keyword;

Locating, in the spare hash storage block corresponding to the standby hash value, the second conflicting entry corresponding to the keyword, if the matching with the keyword is found in the spare hash storage block The second conflicting entry returns a search result;

If the second conflict entry corresponding to the keyword is not found in the spare hash storage block, the return is not found.

8. The method according to claim 3, further comprising:

Locating, in the primary hash storage block, the first conflicting entry corresponding to the keyword, if the first corresponding to the keyword is found in the primary hash storage block The conflicting entry deletes the first conflicting entry corresponding to the keyword.

9. The method according to claim 8, further comprising:

Determining, according to the flag of the conflicting entry established by the standby hash function in the primary hash storage block, whether there is the second conflict corresponding to the keyword established by the standby hash function An entry, if there is no second conflict entry corresponding to the keyword established by the standby hash function, the return is not found;

Searching, in the standby hash storage block corresponding to the standby hash value, a second conflicting entry corresponding to the keyword, if a location corresponding to the keyword is found in the spare hash storage block Second The conflicting entry deletes the second conflicting entry corresponding to the keyword; and the second conflicting entry that is included is returned.

10. A hash computing processing device, comprising:

a receiving module, configured to receive a message;

a keyword extraction module, configured to extract a keyword that needs to be hashed in the message; a primary hash calculation module, configured to perform hash calculation on the keyword by using a primary hash function, to obtain a context The primary hash value corresponding to the keyword;

The apparatus according to claim 10, wherein the conflict entry includes: a flag for performing hash calculation using an alternate hash function, an entry valid flag, and the keyword.

The method according to claim 11, wherein the hash storage block comprises: a flag of a conflict entry established by a standby hash function and an alternate hash function type flag.

The device according to claim 12, wherein the primary hash calculation module further comprises:

a determining unit, configured to determine whether the standby hash function type flag in the primary hash storage block is set; when the ambiguity has been set, according to the standby hash in the primary hash storage block a function type flag, selecting a hash function corresponding to the alternate hash function type flag as an alternate hash function;

And a first calculating unit, configured to perform hash calculation on the keyword by using the standby hash function.

14. The apparatus according to claim 13, wherein the primary hash calculation module further comprises: selecting a hash function as a standby hash function when the alarm is not set;

The first calculating unit is further configured to perform, by using the standby hash function, a hash setting unit, where the keyword is used to set the standby hash function type flag in the primary hash storage block.

The apparatus according to claim 14, wherein the second selecting unit further comprises: a first selecting subunit, configured to select a hash that generates less hash collision than the main hash function The function acts as a standby hash function;

a second selection subunit, configured to perform hash calculation on the keyword by using at least one hash function, to obtain at least one hash function value corresponding to the keyword, and selecting one and the at least one hash function A hash function in which the number of conflicting entries in the hash storage block corresponding to the value is smaller than the maximum number of conflicts is used as a standby hash function.

The device according to claim 12, further comprising: a finding module, searching, in the primary hash storage block, the first conflicting entry corresponding to the keyword;

a returning module, configured to return a search result when the first conflicting entry corresponding to the keyword is found in the primary hash storage block;

An obtaining module, configured to: when the first conflicting entry corresponding to the keyword is not found in the primary hash storage block, obtain the presence or absence of the primary hash storage block a flag of the conflicting entry established by the alternate hash function and the alternate hash function type flag;

a second determining module, configured to determine, according to the flag of the conflicting entry established by the standby hash function in the primary hash storage block, whether there is a key established by the standby hash function Corresponding said second conflicting entry;

The returning module is configured to: when there is no second conflicting entry corresponding to the keyword established by the standby hash function, the return is not found;

The standby hash calculation module is further configured to use the backup in the primary hash storage block when there is the second conflict entry corresponding to the keyword established by a standby hash function The standby hash function corresponding to the hash function type flag performs hash calculation on the keyword to obtain a standby hash value corresponding to the keyword; the second conflict entry corresponding to the keyword;

The returning module is further configured to: when the second conflicting entry corresponding to the keyword is found in the standby hash storage block, return a search result;

The returning module is further configured to: when the second conflicting entry corresponding to the keyword is not found in the standby hash storage block, the return is not found.

17. The device according to claim 12, further comprising:

The searching module is further configured to search, in the primary hash storage block, the first conflicting entry corresponding to the keyword;

a deleting module, configured to: find, in the primary hash storage block, the corresponding to the keyword When the first conflicting entry is deleted, the first conflicting entry corresponding to the keyword is deleted.

The device according to claim 17, further comprising:

The obtaining module is further configured to: when the first conflicting entry corresponding to the keyword is not found in the primary hash storage block, obtain the foregoing in the primary hash storage block Whether there is a flag of the conflicting table entry established by the standby hash function and the standby hash function type flag;

The second determining module is further configured to determine, according to the flag of the conflicting entry established by the standby hash function in the primary hash storage block, whether there is a connection established by the standby hash function The second conflicting entry corresponding to the keyword;

The returning module is further configured to: when there is no second conflicting entry corresponding to the keyword established by the standby hash function, the return is not found;

The deleting module is further configured to: when the second conflicting entry corresponding to the keyword is found in the standby hash storage block, deleting the second corresponding to the keyword The conflict entry; when the second conflict entry corresponding to the keyword is found, the return is not found.