Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and device for data processing

A data processing and data technology, which is applied in the field of data processing, can solve the problems of poor reading and writing efficiency of hash tables, and achieve the effects of improving reading and writing efficiency, improving load balancing, and reducing the probability of hash conflicts

Active Publication Date: 2020-09-11
HUAWEI TECH CO LTD
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

As the amount of data increases, there will be more and more conflicting elements (indexes or pointers) in the hash table, resulting in poorer read and write efficiency of the hash table.

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and device for data processing
  • Method and device for data processing
  • Method and device for data processing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] In order to facilitate the understanding of the embodiments of the present application, first a brief description is given of the concepts involved in the present application.

[0025] A hash table is a data structure that implements an associative array, and is widely used for fast data lookup. The hash table has two important operations, one is the write (put) operation, which inserts elements into the hash table through the write operation; the other is the read (get) operation, which quickly finds the element from the hash table.

[0026] A hash table can include the following structural elements:

[0027] Item (entry), the element stored in the hash table is called item or entry.

[0028] Bucket, each item in the hash table is hashed into the bucket, and the hash value of the key (key) is calculated by the hash function, and the key in the hash table can be found through the hash value Location. For example, for a cuckoo hash (cuckoo hash) table, the bucket is a...

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

PUM

No PUM Login to View More

Abstract

A data processing method (200) and device. The method (200) comprises: determining a position having the smallest load as a target position from among multiple positions included in an N+1th stage hash table, wherein the multiple positions are corresponding positions, in the N+1th stage hash table, of candidate positions of first hash data in an Nth stage hash table, and the first hash data is hash data to be inserted in the Nth stage hash table (S210); migrating second hash data in the Nth stage hash table to the target position, wherein the second hash data is hash data stored at a position in the Nth stage hash table corresponding to the target position (S220); inserting the first hash data into the candidate positions (S230). The described method and device may reduce the probability of hash conflicts in an N+1th stage hash table, and improve the reading and writing efficiency of the N+1th stage hash table.

Description

technical field [0001] The present application relates to the field of storage, and in particular to a data processing method and device. Background technique [0002] A hash (Hash) table may be used to store data in a storage system, and a hash table is an index method for data storage. For example, the storage system can calculate an index based on the unique index of the data to be stored (such as the key in the data item in the KV (Key Value) storage system), a given hash function, and the capacity of the hash table. Hash value, so that the data (such as the value in the KV storage system) is stored in the storage location indicated by the hash value (hereinafter, unless otherwise specified, "storage location" refers to the storage medium indicated by the hash value location). When querying, calculate the hash value according to the given index, given hash function and table capacity, and then search at the storage location indicated by the hash value. [0003] Due to...

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

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/743
CPCH04L9/3239
Inventor 张丰伟张学仓德鲁日宁·伊戈尔王元钢
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products