CN115391349A - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN115391349A CN115391349A CN202211055031.8A CN202211055031A CN115391349A CN 115391349 A CN115391349 A CN 115391349A CN 202211055031 A CN202211055031 A CN 202211055031A CN 115391349 A CN115391349 A CN 115391349A
- Authority
- CN
- China
- Prior art keywords
- address
- node
- data
- determining
- hash value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
- G06F16/24552—Database cache management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data processing method which can be applied to the financial field or other fields. The method comprises the following steps: the method comprises the steps of obtaining first data and a first key code corresponding to the first data, and determining a first hash value corresponding to the first key code. And determining a first bucket corresponding to the first hash value and a first address stored in the first bucket. Specifically, in order to reduce the number of times that the CPU reads the memory when accessing the first data, a second address closest to the first address may be determined from available addresses corresponding to a certain range of address spaces, the second address may be written into the first packet, and the first data may be stored in a storage space corresponding to the second address. According to the scheme of the embodiment of the application, the data access efficiency can be improved.
Description
Technical Field
The present application relates to the field of data processing, and in particular, to a data processing method and apparatus.
Background
The hash table is a data structure directly accessed from a key value (key value). That is, the hash table accesses the record by mapping the key value to a location (node) in the table to speed the lookup. For example, for the key1, the key1 'is obtained by hash calculation, and the hash table is looked up by using the key1' as an index, so that the storage address for storing the data corresponding to the key1 can be obtained, and accordingly, the data corresponding to the key1 can be accessed through the storage address.
The hash may be the same for different keys, for which case a hash collision occurs. At present, when hash collision occurs, the efficiency of accessing data is low, so a scheme is urgently needed to solve the problem.
Disclosure of Invention
In order to solve or at least partially solve the above technical problems, embodiments of the present application provide a data processing method and apparatus.
In a first aspect, an embodiment of the present application provides a data processing method, where the method includes:
acquiring first data and a first key code corresponding to the first data;
determining a first hash value corresponding to the first key;
determining a first bucket corresponding to the first hash value and a first address stored in the first bucket;
determining a second address closest to the first address from available addresses corresponding to a range of address spaces;
and writing the second address into the first packet, and storing the first data into a storage space corresponding to the second address.
Optionally, the method further includes:
dividing the address space in the certain range into a plurality of nodes, wherein one node corresponds to a section of address subspace for storing data;
constructing a balanced binary tree by taking the serial numbers of the plurality of nodes as an order;
determining a second address closest to the first address from available addresses corresponding to a range of address spaces, comprising:
determining a second node closest to a first node corresponding to the first address from available nodes in the balanced binary tree;
and determining the second address according to the sequence number of the second node.
Optionally, the determining the second address according to the sequence number of the second node includes:
and determining the serial number of the second node as the second address.
Optionally, the method further includes:
setting the second node as an unavailable node.
Optionally, the method further includes:
acquiring second data and a second key code corresponding to the second data;
determining a second hash value corresponding to the second key;
determining that no bucket corresponding to the second hash value exists;
creating a second bucket corresponding to the second hash value;
randomly selecting a third address from available addresses corresponding to the address space in the certain range;
and writing the third address into the second packet, and storing the second data into a storage space corresponding to the third address.
Optionally, the randomly selecting a third address from available addresses corresponding to the address space in the certain range includes:
randomly selecting a third node from available nodes in the balanced binary tree;
and determining the third address according to the sequence number of the third node.
Optionally, the method further includes:
setting the third node as an unavailable node.
Optionally, the determining the third address according to the sequence number of the third node includes:
and determining the sequence number of the third node as the third address.
In a second aspect, an embodiment of the present application provides a data processing apparatus, where the apparatus includes:
the first obtaining unit is used for obtaining first data and a first key code corresponding to the first data;
a first determining unit, configured to determine a first hash value corresponding to the first key;
a second determining unit, configured to determine a first bucket packet corresponding to the first hash value and a first address stored in the first bucket packet;
a third determining unit, configured to determine a second address closest to the first address from available addresses corresponding to a range of address spaces;
a first writing unit, configured to write the second address into the first packet;
and the first storage unit is used for storing the first data to a storage space corresponding to the second address.
Optionally, the apparatus further comprises:
the address dividing unit is used for dividing the address space in the certain range into a plurality of nodes, and one node corresponds to a section of address subspace for storing data;
the construction unit is used for constructing a balanced binary tree by taking the serial numbers of the plurality of nodes as an order;
the third determining unit is configured to:
determining a second node closest to a first node corresponding to the first address from available nodes in the balanced binary tree;
and determining the second address according to the sequence number of the second node.
Optionally, the determining the second address according to the sequence number of the second node includes:
and determining the serial number of the second node as the second address.
Optionally, the apparatus further comprises:
a first setting unit configured to set the second node as an unavailable node.
Optionally, the apparatus further comprises:
the second acquiring unit is used for acquiring second data and a second key corresponding to the second data;
a fourth determining unit, configured to determine a second hash value corresponding to the second key;
a fifth determining unit, configured to determine that there is no bucket corresponding to the second hash value;
a creating unit, configured to create a second bucket corresponding to the second hash value;
a selection unit, configured to randomly select a third address from available addresses corresponding to the address space in the certain range;
a second write unit, configured to write the third address into the second packet;
and the second storage unit is used for storing the second data to a storage space corresponding to the third address.
Optionally, the selecting unit is configured to:
randomly selecting a third node from available nodes in the balanced binary tree;
and determining the third address according to the sequence number of the third node.
Optionally, the apparatus further comprises:
a second setting unit configured to set the third node as an unavailable node.
Optionally, the determining the third address according to the sequence number of the third node includes:
and determining the sequence number of the third node as the third address.
Compared with the prior art, the embodiment of the application has the following advantages:
the embodiment of the application provides a data processing method, which comprises the following steps: the method comprises the steps of obtaining first data and a first key code corresponding to the first data, and then determining a first hash value corresponding to the first key code. After the first hash value is obtained, a first bucket packet corresponding to the first hash value and a first address stored in the first bucket packet may be determined. After the first address is determined, a second address for storing the first data may be determined based on the first address, and specifically, in order to reduce the number of times that the CPU reads the memory when accessing the first data, a second address closest to the first address may be determined from available addresses corresponding to a certain range of address spaces, the second address is written into the first bucket, and the first data is stored in a storage space corresponding to the second address. Therefore, by the scheme of the embodiment of the application, the times of reading the memory by the CPU can be reduced when the hash conflict occurs, and the data access efficiency is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flowchart of a data processing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of another data processing method according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The inventor of the present application has found through research that the hash calculation may be the same for different keys, and in this case, a hash collision occurs. For example, the hash values corresponding to key1 and key2 are the same, and are both keys'. For this case, a bucket (bucket) corresponding to the key ' may be established by using the key ' as an index, and the bucket stores a storage address in the memory of data corresponding to each key corresponding to the key '. For example, the hash values corresponding to key1 and key2 are both keys, data corresponding to key1 is stored in address 1, data corresponding to key2 is stored in address 2, and then address 1 and address 2 are stored in the bucket corresponding to key'.
When a request for accessing data corresponding to key1 is received, the device may first perform hash calculation on key1 to obtain key ', further obtain address 1 and address 2 in the bucket corresponding to key', then read data in address 1 and address 2, and compare the key1 with the read data, thereby finally determining the data corresponding to key 1.
Currently, when the device stores data corresponding to key1 and data corresponding to key2, the address is randomly selected from the storage space to be stored, and when the address 1 and the address 2 are relatively dispersed, the device needs to read the data in the address 1 and the address 2, that is: the device needs to read the memory multiple times to obtain the data that the user wishes to access. Resulting in inefficient data access.
In the data reading stage, when a Central Processing Unit (CPU) reads data from a memory into a CPU Cache (Cache), the data is read from a small block by a small block, which is called a Cache block (Cache Line), and the size of the Cache block is generally 64 bytes. In other words, when the CPU reads data in the memory, 64 bytes can be read at a time, so if the address 1 and the address 2 are two relatively close addresses, for example, the address 1 and the address 2 are both addresses within a certain 64 bytes, the CPU can obtain the data in the address 1 and the address 2 by reading the memory once, and accordingly, the efficiency of data access can be improved.
In view of this, embodiments of the present application provide a data processing method and apparatus, which can improve data access efficiency.
Various non-limiting embodiments of the present application are described in detail below with reference to the attached drawing figures.
Exemplary method
Referring to fig. 1, the figure is a schematic flow chart of a data processing method according to an embodiment of the present application. The method may be executed by a device including a CPU cache, where the device may be a terminal device or a server, and the embodiment of the present application is not particularly limited. In this embodiment, the method may include, for example, the steps of: S101-S105.
S101: the first data and a first key code corresponding to the first data are obtained.
S102: and determining a first hash value corresponding to the first key.
With regard to the first key (key) and the first data, it should be noted that the first data can be uniquely indexed by the first key. The specific values of the first data and the first key are not specifically limited in the embodiment of the application, and the specific values of the first data and the first key can be determined according to actual conditions.
After the first key is determined, the first key may be calculated by using a hash algorithm to obtain a first hash value corresponding to the first key. The embodiment of the present application does not specifically limit the hash algorithm, and the hash algorithm may be determined according to an actual situation.
S103: and determining a first bucket corresponding to the first hash value and a first address stored in the first bucket.
After the first hash value is determined, a first bucket corresponding to the first hash value may be searched by using the first hash value as an index, and an address stored in the first bucket is read. In one example, the first packet may include a plurality of addresses, and the first address may be any one of the plurality of addresses.
S104: and determining a second address closest to the first address from available addresses corresponding to a range of address spaces.
After determining the first address, a second address closest to the first address may be determined from available addresses corresponding to a range of address spaces.
In one example, the range of address spaces may be traversed, available addresses in the range of address spaces determined, and further, a second address that is closest to the first address determined.
In yet another example, to facilitate determining the second address, the address space of the first range may be divided into a plurality of nodes, one node corresponding to a segment of address subspace used for storing data, and a balanced binary tree may be constructed in order of sequence numbers of the plurality of nodes. In one example, for any node in the plurality of nodes, the address subspace corresponding to the node may be determined according to a certain correspondence. For example, the sequence number of a node is used to indicate the address subspace corresponding to the node.
For this case, when determining that the second address is implemented specifically, it may first determine that the first address corresponds to a first node in the balanced binary tree, and then determine a second node closest to the first node from available nodes in the balanced binary tree. After determining the second node, the second address may be determined based on a sequence number of the second node.
The construction of the balanced binary tree is not described in detail here.
In an example, an address corresponding to the serial number of the second node may be determined according to a correspondence between the serial number of the node and the address, and the address corresponding to the serial number of the second node may be determined as the second address. In yet another example, a sequence number of the second node may be determined as the second address.
S105: and writing the second address into the first packet, and storing the first data into a storage space corresponding to the second address.
After the second address is determined, the first data may be stored in a storage space corresponding to the second address, and the second address is written into the first packet. In this way, in the data reading stage, after the first hash value is determined based on the first key, the first data may be obtained by searching based on the address stored in the first packet corresponding to the first hash value. After the scheme of the embodiment of the application is adopted, the addresses stored in the first bucket are relatively close, and at least two addresses are likely to be addresses in a certain 64-byte range, so that the reading times of the CPU for the memory can be reduced when the first data is read, and the data access efficiency is improved. For example, the following steps are carried out:
assuming that there are 3 addresses in the first packet, if the conventional technique is adopted, the 3 addresses are 3 scattered addresses in the memory, and the CPU needs to read the memory 3 times when the requirement for accessing the first data is met. After the scheme is adopted, the 3 addresses are continuous addresses, and the 3 addresses are all addresses within a certain 64 bytes, so that when the requirement of accessing the first data is met, the CPU can read the memory for 1 time.
In one example, after the second address is determined based on the sequence number of the second node, the second node may also be set as an unavailable node, so as to avoid repeatedly storing other data into the second address corresponding to the second node in a subsequent data storage phase.
In addition, the scheme of the embodiment of the application may further include S201 to S205 shown in fig. 2. Fig. 2 is a schematic flowchart of another data processing method according to an embodiment of the present application.
S201: and acquiring second data and a second key code corresponding to the second data.
S202: and determining a second hash value corresponding to the second key.
Regarding the second key and the second data, it should be noted that the second data can be uniquely indexed by the second key. The specific values of the second data and the second key are not specifically limited in the embodiment of the application, and the specific values of the second data and the second key can be determined according to actual conditions.
After the second key is determined, the second key may be calculated by using a hash algorithm to obtain a second hash value corresponding to the second key. The embodiment of the present application does not specifically limit the hash algorithm, and the hash algorithm may be determined according to an actual situation.
S203: and determining that no packet corresponding to the second hash value exists, and creating a second packet corresponding to the second hash value.
After the second hash value is determined, the bucket corresponding to the first hash value may be searched by using the second hash value as an index, and if the bucket corresponding to the second hash value is not found, a second bucket corresponding to the second hash value may be created. After the second bucket is created, a correspondence between the second hash value and the second bucket may be established.
S204: and randomly selecting a third address from available addresses corresponding to the certain range of address space.
In one example, the range of address spaces may be traversed, available addresses in the range of address spaces determined, and further, a third address may be randomly selected from the available addresses.
In yet another example, the third address may be determined using the aforementioned balanced binary tree. As an example, a third node may be randomly selected from available nodes of the balanced binary tree, and the third address may be determined according to a sequence number of the third node.
In an example, an address corresponding to the serial number of the third node may be determined according to a correspondence between the node serial number and the address, and the address corresponding to the serial number of the third node is determined as the third address. In yet another example, a sequence number of the third node may be determined as the third address.
S205: and writing the third address into the second packet, and storing the second data into a storage space corresponding to the third address.
After the third address is determined, the second data may be stored in a storage space corresponding to the third address, and the third address is written into the second packet. In this way, in the data reading stage, after the second hash value is determined based on the second key, the second data may be obtained by searching based on the address stored in the second packet corresponding to the second hash value.
In an example, after the third address is determined based on the sequence number of the third node, the third node may be further set as an unavailable node, so as to avoid repeatedly storing other data into the third address corresponding to the third node in a subsequent data storage stage.
Exemplary device
Based on the method provided by the above embodiment, the embodiment of the present application further provides an apparatus, which is described below with reference to the accompanying drawings.
Referring to fig. 3, this figure is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application. The apparatus 300 may specifically include, for example: a first acquisition unit 301, a first determination unit 302, a second determination unit 303, a third determination unit 304, a first writing unit 305, and a first storage unit 306.
A first obtaining unit 301, configured to obtain first data and a first key corresponding to the first data;
a first determining unit 302, configured to determine a first hash value corresponding to the first key;
a second determining unit 303, configured to determine a first bucket packet corresponding to the first hash value and a first address stored in the first bucket packet;
a third determining unit 304, configured to determine a second address closest to the first address from available addresses corresponding to a range of address spaces;
a first writing unit 305, configured to write the second address into the first packet;
a first storage unit 306, configured to store the first data in a storage space corresponding to the second address.
Optionally, the apparatus further comprises:
the address dividing unit is used for dividing the address space in the certain range into a plurality of nodes, and one node corresponds to a section of address subspace for storing data;
the construction unit is used for constructing a balanced binary tree by taking the serial numbers of the plurality of nodes as an order;
the third determining unit 304 is configured to:
determining a second node closest to the first node corresponding to the first address from available nodes in the balanced binary tree;
and determining the second address according to the sequence number of the second node.
Optionally, the determining the second address according to the sequence number of the second node includes:
and determining the serial number of the second node as the second address.
Optionally, the apparatus further comprises:
a first setting unit configured to set the second node as an unavailable node.
Optionally, the apparatus further comprises:
the second acquiring unit is used for acquiring second data and a second key corresponding to the second data;
a fourth determining unit, configured to determine a second hash value corresponding to the second key;
a fifth determining unit, configured to determine that there is no bucket corresponding to the second hash value;
a creating unit, configured to create a second bucket corresponding to the second hash value;
a selection unit, configured to randomly select a third address from available addresses corresponding to the address space in the certain range;
a second write unit, configured to write the third address into the second packet;
and the second storage unit is used for storing the second data to a storage space corresponding to the third address.
Optionally, the selecting unit is configured to:
randomly selecting a third node from available nodes in the balanced binary tree;
and determining the third address according to the sequence number of the third node.
Optionally, the apparatus further comprises:
a second setting unit configured to set the third node as an unavailable node.
Optionally, the determining the third address according to the sequence number of the third node includes:
and determining the sequence number of the third node as the third address.
Since the apparatus 300 is an apparatus corresponding to the method provided in the above method embodiment, and the specific implementation of each unit of the apparatus 300 is the same as that of the above method embodiment, for the specific implementation of each unit of the apparatus 300, reference may be made to the description part of the above method embodiment, and details are not repeated here.
It should be noted that the data processing method and apparatus provided by the present invention can be used in the financial field or other fields. For example, it can be applied to data storage scenarios in the financial field. The other fields are arbitrary fields other than the financial field, for example, the data processing field. The foregoing is merely an example, and does not limit the application field of the data processing method and apparatus provided by the present invention.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice in the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
The above description is only exemplary of the present application and should not be taken as limiting the present application, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present application should be included in the protection scope of the present application.
Claims (10)
1. A method of data processing, the method comprising:
acquiring first data and a first key code corresponding to the first data;
determining a first hash value corresponding to the first key;
determining a first bucket corresponding to the first hash value and a first address stored in the first bucket;
determining a second address closest to the first address from available addresses corresponding to a range of address spaces;
and writing the second address into the first packet, and storing the first data into a storage space corresponding to the second address.
2. The method of claim 1, further comprising:
dividing the address space in the certain range into a plurality of nodes, wherein one node corresponds to a section of address subspace for storing data;
constructing a balanced binary tree by taking the serial numbers of the plurality of nodes as an order;
determining a second address closest to the first address from available addresses corresponding to a range of address spaces, comprising:
determining a second node closest to a first node corresponding to the first address from available nodes in the balanced binary tree;
and determining the second address according to the sequence number of the second node.
3. The method of claim 2, wherein the first address is a sequence number of the first node, and wherein determining the second address according to the sequence number of the second node comprises:
and determining the serial number of the second node as the second address.
4. The method of claim 2, further comprising:
setting the second node as an unavailable node.
5. The method of claim 2, further comprising:
acquiring second data and a second key code corresponding to the second data;
determining a second hash value corresponding to the second key;
determining that no bucket corresponding to the second hash value exists;
creating a second bucket corresponding to the second hash value;
randomly selecting a third address from available addresses corresponding to the address space in the certain range;
and writing the third address into the second packet, and storing the second data into a storage space corresponding to the third address.
6. The method of claim 5, wherein randomly selecting the third address from available addresses corresponding to the range of address spaces comprises:
randomly selecting a third node from available nodes in the balanced binary tree;
and determining the third address according to the sequence number of the third node.
7. The method of claim 6, further comprising:
setting the third node as an unavailable node.
8. The method of claim 6, wherein determining the third address according to the sequence number of the third node comprises:
and determining the sequence number of the third node as the third address.
9. A data processing apparatus, characterized in that the apparatus comprises:
the first obtaining unit is used for obtaining first data and a first key code corresponding to the first data;
a first determining unit, configured to determine a first hash value corresponding to the first key;
a second determining unit, configured to determine a first bucket packet corresponding to the first hash value and a first address stored in the first bucket packet;
a third determining unit, configured to determine a second address closest to the first address from available addresses corresponding to a range of address spaces;
a first writing unit, configured to write the second address into the first packet;
and the first storage unit is used for storing the first data to a storage space corresponding to the second address.
10. The apparatus of claim 9, further comprising:
the address dividing unit is used for dividing the address space in the certain range into a plurality of nodes, and one node corresponds to a section of address subspace for storing data;
the construction unit is used for constructing a balanced binary tree by taking the serial numbers of the plurality of nodes as an order;
the third determining unit is configured to:
determining a second node closest to a first node corresponding to the first address from available nodes in the balanced binary tree;
and determining the second address according to the sequence number of the second node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211055031.8A CN115391349A (en) | 2022-08-31 | 2022-08-31 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211055031.8A CN115391349A (en) | 2022-08-31 | 2022-08-31 | Data processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115391349A true CN115391349A (en) | 2022-11-25 |
Family
ID=84123952
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211055031.8A Pending CN115391349A (en) | 2022-08-31 | 2022-08-31 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115391349A (en) |
-
2022
- 2022-08-31 CN CN202211055031.8A patent/CN115391349A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111125447A (en) | Metadata access method, device and equipment and readable storage medium | |
| US8806175B2 (en) | Hybrid hash tables | |
| CN109766341B (en) | Method, device and storage medium for establishing Hash mapping | |
| CN110555001B (en) | Data processing method, device, terminal and medium | |
| US20100228914A1 (en) | Data caching system and method for implementing large capacity cache | |
| CN110109873B (en) | File management method for message queue | |
| US20120117297A1 (en) | Storage tiering with minimal use of dram memory for header overhead | |
| CN111309258B (en) | B + tree access method and device and computer readable storage medium | |
| CN112860592B (en) | Data caching method and device based on linked list, electronic equipment and storage medium | |
| CN114860785B (en) | Cache data processing system, method, computer device and storage medium | |
| CN113282249B (en) | Data processing method, system, device and medium | |
| CN112559386B (en) | Method, device, computer equipment and storage medium for improving SSD performance | |
| CN109213450B (en) | Associated metadata deleting method, device and equipment based on flash memory array | |
| CN114780537A (en) | Flow table storage and message forwarding method, device, computing equipment and medium | |
| US9852074B2 (en) | Cache-optimized hash table data structure | |
| CN115718819A (en) | Index construction method, data reading method and index construction device | |
| CN115033185A (en) | Memory access processing method and device, storage device, chip, board card and electronic equipment | |
| CN116431080B (en) | Data disc-dropping method, system, equipment and computer readable storage medium | |
| CN115964002A (en) | Electric energy meter terminal file management method, device, equipment and medium | |
| CN115391349A (en) | Data processing method and device | |
| CN112800123B (en) | Data processing method, device, computer equipment and storage medium | |
| US20100169322A1 (en) | Efficient access of bitmap array with huge usage variance along linear fashion, using pointers | |
| CN108984432B (en) | Method and device for processing IO (input/output) request | |
| CN111881064A (en) | Method, device and equipment for processing access request in full flash memory storage system | |
| CN112699060A (en) | Data block management method, system and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |