Method and device for adding, searching for and deleting key in hash table

A hash table and hash sub-table technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as inability to guarantee that z2 and y1 will not conflict, and improve search performance and search process simplified effect
CN102187642BInactive Publication Date: 2015-01-07HUAWEI TECH CO LTD
1 Cites 2 Cited by

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Patents(China)
Current Assignee / Owner
HUAWEI TECH CO LTD
Publication Date
2015-01-07
Estimated Expiration
Not applicable Β· inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The present invention discloses a method and device for adding, searching for and deleting a key in a hash table, wherein, the method for adding a key in a hash table includes: calculating both the bucket address corresponding to the key to be added and the address extension of the key to be added in each hash sub-table according to a hash function; generating the fingerprints of the key to be added corresponding to each hash sub-table, wherein the fingerprint of the key to be added corresponding to one hash sub-table includes: the address extension of the key to be added in the hash sub-table, and the bucket address corresponding to the key to be added and the address extension of the key to be added in other hash sub-tables; and when determining that there is no conflict, storing the fingerprint of the key to be added corresponding to the selected hash sub-table into the selected hash sub-table. The solution of the present invention enables that the fingerprint of each key can only match one fingerprint in one hash sub-table, thus when searching for a key, at most once is required to visit an original key table, thereby improving the search performance, and simplifying the search process.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of communication technology, in particular to a method and device for adding, searching or deleting key values ​​in a hash table. Background technique

[0002] Due to its high lookup performance, hash tables are widely used in the field of communication technology. A hash table generally consists of one or more hash sub-tables. An address space in a hash sub-table is called a bucket. Each bucket is composed of multiple slices (slots). Each slice can store A key value (key). Each hash subtable corresponds to a hash function (hash function), the key value is input to the hash function, and the output result is the address of the bucket that stores the key value in the corresponding hash subtable. The utilization of a hash table is defined as the number of keys to be stored divided by the number of shards in all hash subtables. If the number of key values ​​to be stored is 8M (8388608), the hash table includes two has...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More