CN114265958A - Mapping management method and device of KV SSD and storage medium - Google Patents
Mapping management method and device of KV SSD and storage medium Download PDFInfo
- Publication number
- CN114265958A CN114265958A CN202210192037.3A CN202210192037A CN114265958A CN 114265958 A CN114265958 A CN 114265958A CN 202210192037 A CN202210192037 A CN 202210192037A CN 114265958 A CN114265958 A CN 114265958A
- Authority
- CN
- China
- Prior art keywords
- value
- hash
- index information
- data processing
- key
- 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
Abstract
The invention provides a mapping management method, a mapping management device and a storage medium of a KV SSD, wherein the method comprises the following steps: when a data processing request command is received, acquiring index information of a block to be operated carried in the data processing request command; performing Hash calculation on the index information according to a preset Hash algorithm to obtain a Hash value of the index information; inquiring an address mapping relation table according to the Hash value to obtain a physical block address corresponding to the Hash value, wherein the address mapping relation table comprises a key value pair formed by the Hash value of the index information and the corresponding physical block address; and performing data processing operation on the block to be operated according to the physical block address. The invention uses the Hash algorithm to convert the KV index information from variable length to fixed length, simplifies the original management algorithm based on the tree structure into the management algorithm based on the linear array, greatly simplifies the complexity and reduces the engineering realization cost.
Description
Technical Field
The invention relates to the technical field of data storage, in particular to a method and a device for mapping management of a KV SSD and a storage medium.
Background
Key Value is commonly used for object storage, and currently exists in a host system as a database storage system. However, the hard disk storing data is conventionally a block storage device, that is, the minimum unit of access of each data is fixed. In the Key Value storage, the smallest access unit is a Key (Key) Value pair, and the length of each Key Value pair is changed. These two storage forms are not compatible, and therefore a special driver layer is required in the conventional storage system to implement the conversion of the two forms, thereby incurring additional overhead.
In 5 months 2021, NVMe international standards organization issued protocol updates of NVMe version 2.0. In the new version of protocol, 2 new command sets, namely a Zone Namespace command set and a Key Value command set (KV command set for short), are added on the basis of the original NVM command set. NVMe protocol is widely used as an interface protocol for SSD firmware hard disks in general. The newly added KV command set in NVMe 2.0 can realize that the storage hard disk directly supports KV pair data interaction, so that the method is very friendly to an object storage system, and the load of a host end on the object storage system is greatly reduced.
The KV SSD is a solid state disk based on the Key Value command set. Existing KV SSDs use a Tree data structure (Key Range Tree) to manage KV data sets on the entire hard disk, as shown in fig. 1. The existing KV SSD mapping management scheme based on the tree data structure mainly has the following problems:
1. in an embedded firmware environment, the processing power of the CPU and the RAM capability are weaker than those of the host side. The management of the multi-level tree data structure inside the SSD consumes large resources, resulting in long CPU processing time, large RAM space overhead, and large algorithm complexity.
And 2, synchronously processing the management algorithm of the NAND Flash which needs to be processed by the traditional SSD in the SSD, such as a plurality of complex logics of an FTL Flash translation layer, garpage Collection Garbage Collection, Wear Leveling, Data Recovery and the like. If the method is coupled with KV tree management, the complexity of the SSD internal algorithm is obviously increased.
3. The traditional SSD internal mapping management generally adopts a fixed-length block management mode, and is incompatible with a format that KV is changed into a data block. The original design can not be reused, and the development and test cost is increased.
Disclosure of Invention
In view of the above, the present invention has been made to provide a mapping management method, apparatus and storage medium for a KV SSD that overcome or at least partially solve the above-mentioned problems.
In one aspect of the present invention, a mapping management method for a KV SSD is provided, the method comprising:
when a data processing request command is received, acquiring index information of a block to be operated carried in the data processing request command;
performing Hash calculation on the index information according to a preset Hash algorithm to obtain a Hash value of the index information;
inquiring an address mapping relation table according to the Hash value to obtain a physical block address corresponding to the Hash value, wherein the address mapping relation table comprises a key value pair formed by the Hash value of index information and the corresponding physical block address;
and performing data processing operation on the block to be operated according to the physical block address.
Further, the obtaining of the index information of the block to be operated carried in the data processing request command includes:
and acquiring the Key value of the block to be operated carried in the data processing request command, the effective data length of the Key value and the NS ID of the logic domain to which the KV pair belongs.
Further, the Hash calculation of the index information according to a preset Hash algorithm includes:
generating a random initial value for Hash calculation;
taking the random initial value and the index information as input data to carry out Hash calculation;
and limiting the maximum value of the obtained Hash result according to a preset constraint value.
Further, the size of each key-value pair object in the address mapping relationship table is the same.
In another aspect of the present invention, there is provided a mapping management apparatus of a KV SSD, the apparatus including:
the interface module is used for acquiring index information of a block to be operated carried in a data processing request command when the data processing request command is received;
the computing module is used for carrying out Hash computing on the index information according to a preset Hash algorithm to obtain a Hash value of the index information;
the mapping management module is used for inquiring an address mapping relation table according to the Hash value to obtain a physical block address corresponding to the Hash value, and the address mapping relation table comprises a key value pair consisting of the Hash value of the index information and the corresponding physical block address;
and the processing module is used for carrying out data processing operation on the block to be operated according to the physical block address.
Further, the interface module is configured to obtain a Key value of the block to be operated, an effective data length of the Key value, and an NS ID of the logical domain to which the KV pair belongs, which are carried in the data processing request command.
Further, the computing module is specifically configured to generate a random initial value for Hash computation; taking the random initial value and the index information as input data to carry out Hash calculation; and limiting the maximum value of the obtained Hash result according to a preset constraint value.
In a third aspect, the present invention also provides a computer readable and writable storage medium, on which a computer program is stored, which, when executed by a processor, implements the steps of the above-described mapping management method for KV SSD.
According to the mapping management method, device and storage medium for the KV SSD, provided by the embodiment of the invention, the Hash algorithm is used for converting the KV index information from the length to the fixed length, so that the original management algorithm based on the tree structure is simplified into the management algorithm based on the linear mapping relation, the complexity is greatly simplified, the problems of large resource consumption and high complexity caused by the tree structure of the KV SSD are solved, and the engineering implementation cost is reduced.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is a schematic diagram of the principle of KV data management using a tree data structure;
fig. 2 is a flowchart of a mapping management method of the KV SSD according to an embodiment of the present invention;
fig. 3 is a block diagram of a mapping management apparatus for a KV SSD according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As used herein, the singular forms "a", "an", "the" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Fig. 2 schematically shows a flowchart of a mapping management method of a KV SSD according to an embodiment of the present invention. Referring to fig. 2, the method for mapping and managing the KV SSD according to the embodiment of the present invention specifically includes the following steps:
s11, when a data processing request command is received, acquiring index information of a block to be operated carried in the data processing request command;
and S12, performing Hash calculation on the index information according to a preset Hash algorithm to obtain a Hash value of the index information.
Data stores are typically based on index values and data describing a basic data pair by pair, for example:
NVM command set: the fixed-length LBA is an index value, and fixed-length Data (Data) is stored;
KV command set: the variable-length Key is an index Value and variable-length data (Value).
The invention mainly solves the problems of large resource consumption and high complexity caused by a KV SSD tree structure, and introduces a Hash algorithm to convert variable-length index related information in KV into a fixed-length Hash value.
S13, querying an address mapping table according to the Hash value to obtain a physical block address corresponding to the Hash value, where the specific example of the KV address mapping table is shown in table 1, and the address mapping table includes a key value pair formed by the Hash value of the index information and the corresponding physical block address.
TABLE 1 KV Address mapping Table
| L2P Table index value | L2P Table content |
| KH 0 | PBA 0 |
| KH 1 | PBA 1 |
| KH 2 | PBA 2 |
| … | … |
Wherein, the size of each key value pair object Entry in the address mapping relation table is the same and is fixed.
The embodiment of the invention adopts a Hash algorithm to convert a variable-length Key into a fixed-length Hash Value, the Hash Value is taken as an LBA in a traditional NVM command set, an address mapping relation table from a logic domain to a physical domain is still defined as a classical linear table, and the position of KV data (the content of Value) in an NAND array can be inquired in the address mapping relation table from the Hash Value, so that subsequent data read-write actions are carried out.
And S14, performing data processing operation on the block to be operated according to the physical block address.
According to the mapping management method of the KV SSD, provided by the embodiment of the invention, the Hash algorithm is used for converting the KV index information from the length-variable mode to the fixed mode, so that the original management algorithm based on the tree structure is simplified into the management algorithm based on the linear mapping relation, the complexity is greatly simplified, the problems of high resource consumption and high complexity caused by the tree structure of the KV SSD are solved, and the engineering implementation cost is reduced.
In this embodiment of the present invention, the obtaining of the index information of the to-be-operated block carried in the data processing request command in step S11 specifically includes: and acquiring the Key value of the block to be operated carried in the data processing request command, the effective data length of the Key value and the NS ID of the logic domain to which the KV pair belongs. Ns (namespace) is a first-level partition unit in the logical field of the command, and the range of ns (namespace) is large and belongs to a part of the index information. Specifically, a SSD may contain multiple NSs, with different NS having different NS IDs, and each NS containing many KV pairs. The KV pair cannot cross the boundary of the domain NS.
Aiming at the scene that a plurality of NS are used in a mixed mode, the number of KV pairs on each NS is unpredictable in advance, and the RAM space in the whole SSD can be shared by the method provided by the invention.
Further, the Hash calculation of the index information according to a preset Hash algorithm in step S12 includes:
generating a random initial value for Hash calculation;
taking the random initial value and the index information as input data to carry out Hash calculation;
and limiting the maximum value of the obtained Hash result according to a preset constraint value.
In this embodiment, first, a random initial value used for Hash calculation is generated, then a Hash value of KV index information, that is, a KH value, is calculated according to several variables such as a Key value of a block to be operated, an effective data length of the Key value, and an NS ID of a KV pair belonging to a logical domain, and a maximum value of an obtained Hash result is limited by a preset constraint value Limit.
In one embodiment, since there are multiple Key messages affecting the index information in the KV command set, the Key Hash calculation engine will cover all variables in the protocol.
The Hash algorithm function can be expressed as:
wherein:
1. KeyLength: the effective data length of Key in KV alignment is represented;
2. key: the value of Key in KV alignment is represented;
3. NSID: an ID value representing the current logical field Namespace;
4. seed: representing a random initial value of a Hash calculation;
5. and Limit: a constraint value representing the maximum value of the result of the Hash value;
in the embodiment, the Hash algorithm input quantity, besides the information of the Key in the KV pair, introduces several aspects of Key Length, NSID, Seed, and Limit, and based on the 5 variables, not only can the situation that the same Key value leads to the same KH value under different NS and different Key lengths be fully avoided, but also the KH value can be discretized as much as possible within a prescribed range.
For simplicity of explanation, the method embodiments are described as a series of acts or combinations, but those skilled in the art will appreciate that the embodiments are not limited by the order of acts described, as some steps may occur in other orders or concurrently with other steps in accordance with the embodiments of the invention. Further, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred and that no particular act is required to implement the invention.
Fig. 3 schematically shows a configuration diagram of a mapping management apparatus of a KV SSD according to an embodiment of the present invention. Referring to fig. 3, the mapping management apparatus for the KV SSD according to the embodiment of the present invention specifically includes an interface module 201, a calculation module 202, a mapping management module 203, and a processing module 204, where:
the interface module 201 is configured to, when receiving a data processing request command, obtain index information of a block to be operated, which is carried in the data processing request command;
the calculating module 202 is configured to perform Hash calculation on the index information according to a preset Hash algorithm to obtain a Hash value of the index information;
the mapping management module 203 is configured to query an address mapping relation table according to the Hash value, to obtain a physical block address corresponding to the Hash value, where the address mapping relation table includes a key value pair formed by the Hash value of the index information and the corresponding physical block address;
and the processing module 204 is configured to perform data processing operation on the block to be operated according to the physical block address.
In this embodiment of the present invention, the interface module 201 is configured to obtain a Key value of a block to be operated, an effective data length of the Key value, and an NS ID of a logical domain to which the KV pair belongs, which are carried in the data processing request command.
Further, the calculating module 202 is specifically configured to generate a random initial value for Hash calculation, perform Hash calculation using the random initial value and the index information as input data, and limit a maximum value of an obtained Hash result according to a preset constraint value. The index information comprises a Key value, an effective data length of the Key value and an NS ID. In the embodiment, the Hash algorithm input quantity, besides the information of the Key in the KV pair, introduces several aspects of Key Length, NSID, Seed, and Limit, and based on the 5 variables, not only can the situation that the same Key value leads to the same KH value under different NS and different Key lengths be fully avoided, but also the KH value can be discretized as much as possible within a prescribed range.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
Furthermore, an embodiment of the present invention further provides a computer readable and writable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the mapping management method for KV SSD as described above.
In this embodiment, if the mapping management method of the KV SSD is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.
According to the mapping management method, device and storage medium for the KV SSD, provided by the embodiment of the invention, the Hash algorithm is used for converting the KV index information from the length to the fixed length, so that the original management algorithm based on the tree structure is simplified into the management algorithm based on the linear mapping relation, the complexity is greatly simplified, the problems of large resource consumption and high complexity caused by the tree structure of the KV SSD are solved, and the engineering implementation cost is reduced.
Furthermore, those skilled in the art will appreciate that while some embodiments herein include some features included in other embodiments, rather than other features, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. For example, any of the claimed embodiments may be used in any combination.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. A method of mapping management of a KV SSD, the method comprising:
when a data processing request command is received, acquiring index information of a block to be operated carried in the data processing request command;
performing Hash calculation on the index information according to a preset Hash algorithm to obtain a Hash value of the index information;
inquiring an address mapping relation table according to the Hash value to obtain a physical block address corresponding to the Hash value, wherein the address mapping relation table comprises a key value pair formed by the Hash value of index information and the corresponding physical block address;
and performing data processing operation on the block to be operated according to the physical block address.
2. The method according to claim 1, wherein obtaining the index information of the to-be-operated block carried in the data processing request command comprises:
and acquiring the Key value of the block to be operated carried in the data processing request command, the effective data length of the Key value and the NS ID of the logic domain to which the KV pair belongs.
3. The method according to claim 1 or 2, wherein the Hash calculation of the index information according to a preset Hash algorithm comprises:
generating a random initial value for Hash calculation;
taking the random initial value and the index information as input data to carry out Hash calculation;
and limiting the maximum value of the obtained Hash result according to a preset constraint value.
4. The method of claim 1 or 2, wherein the size of each key-value pair object in the address mapping relationship table is the same.
5. An apparatus for mapping management of KV SSD, the apparatus comprising:
the interface module is used for acquiring index information of a block to be operated carried in a data processing request command when the data processing request command is received;
the computing module is used for carrying out Hash computing on the index information according to a preset Hash algorithm to obtain a Hash value of the index information;
the mapping management module is used for inquiring an address mapping relation table according to the Hash value to obtain a physical block address corresponding to the Hash value, and the address mapping relation table comprises a key value pair consisting of the Hash value of the index information and the corresponding physical block address;
and the processing module is used for carrying out data processing operation on the block to be operated according to the physical block address.
6. The apparatus according to claim 5, wherein the interface module is configured to obtain a Key value of a block to be operated, an effective data length of the Key value, and an NS ID of a logical domain to which the KV pair belongs, which are carried in the data processing request command.
7. The apparatus according to claim 5 or 6, wherein the computing module is configured to generate a random initial value for the Hash computation; taking the random initial value and the index information as input data to carry out Hash calculation; and limiting the maximum value of the obtained Hash result according to a preset constraint value.
8. The apparatus of claim 5 or 6, wherein the size of each key-value pair object in the address mapping relation table is the same.
9. A computer-readable and writable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210192037.3A CN114265958A (en) | 2022-03-01 | 2022-03-01 | Mapping management method and device of KV SSD and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210192037.3A CN114265958A (en) | 2022-03-01 | 2022-03-01 | Mapping management method and device of KV SSD and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114265958A true CN114265958A (en) | 2022-04-01 |
Family
ID=80833916
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210192037.3A Pending CN114265958A (en) | 2022-03-01 | 2022-03-01 | Mapping management method and device of KV SSD and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114265958A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116301636A (en) * | 2023-03-22 | 2023-06-23 | 鹏钛存储技术(南京)有限公司 | Data structure, method for managing data structure and hardware accelerator for realizing key value protocol based on hash algorithm |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023809A (en) * | 2009-09-21 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Storage system, method for reading data from storage system and method for writing data to storage system |
| US20140195720A1 (en) * | 2013-01-09 | 2014-07-10 | Wisconsin Alumni Research Foundation | High-Performance Indexing For Data-Intensive Systems |
| CN104054071A (en) * | 2012-12-14 | 2014-09-17 | 华为技术有限公司 | Method for accessing storage device and storage device |
| CN108089817A (en) * | 2016-11-23 | 2018-05-29 | 三星电子株式会社 | The method of storage system and its operating method and operating data processing system |
| CN110968269A (en) * | 2019-11-18 | 2020-04-07 | 华中科技大学 | SCM and SSD-based key value storage system and read-write request processing method |
| CN111813709A (en) * | 2020-07-21 | 2020-10-23 | 北京计算机技术及应用研究所 | High-speed parallel storage method based on FPGA (field programmable Gate array) storage and calculation integrated framework |
-
2022
- 2022-03-01 CN CN202210192037.3A patent/CN114265958A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023809A (en) * | 2009-09-21 | 2011-04-20 | 成都市华为赛门铁克科技有限公司 | Storage system, method for reading data from storage system and method for writing data to storage system |
| CN104054071A (en) * | 2012-12-14 | 2014-09-17 | 华为技术有限公司 | Method for accessing storage device and storage device |
| US20140195720A1 (en) * | 2013-01-09 | 2014-07-10 | Wisconsin Alumni Research Foundation | High-Performance Indexing For Data-Intensive Systems |
| CN108089817A (en) * | 2016-11-23 | 2018-05-29 | 三星电子株式会社 | The method of storage system and its operating method and operating data processing system |
| CN110968269A (en) * | 2019-11-18 | 2020-04-07 | 华中科技大学 | SCM and SSD-based key value storage system and read-write request processing method |
| CN111813709A (en) * | 2020-07-21 | 2020-10-23 | 北京计算机技术及应用研究所 | High-speed parallel storage method based on FPGA (field programmable Gate array) storage and calculation integrated framework |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116301636A (en) * | 2023-03-22 | 2023-06-23 | 鹏钛存储技术(南京)有限公司 | Data structure, method for managing data structure and hardware accelerator for realizing key value protocol based on hash algorithm |
| CN116301636B (en) * | 2023-03-22 | 2023-12-22 | 鹏钛存储技术(南京)有限公司 | Method for managing data structure and hardware accelerator based on hash algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11874815B2 (en) | Key-value storage device and method of operating the same | |
| US20200117728A1 (en) | Key-value store tree data block spill with compaction | |
| US11334270B2 (en) | Key-value store using journaling with selective data storage format | |
| CN108932257B (en) | Multi-dimensional data query method and device | |
| KR20200122994A (en) | Key Value Append | |
| US11314689B2 (en) | Method, apparatus, and computer program product for indexing a file | |
| CN111125033B (en) | Space recycling method and system based on full flash memory array | |
| CN110134335B (en) | RDF data management method and device based on key value pair and storage medium | |
| CN111459919A (en) | Data query method, loading assembly, search assembly and storage medium | |
| CN114265958A (en) | Mapping management method and device of KV SSD and storage medium | |
| US20180075116A1 (en) | Information processing system, control device, and computer-readable recording medium having processing program recorded therein | |
| CN113835639B (en) | I/O request processing method, device, equipment and readable storage medium | |
| Tulkinbekov et al. | CaseDB: Lightweight key-value store for edge computing environment | |
| US10303655B1 (en) | Storage array compression based on the structure of the data being compressed | |
| CN110780814B (en) | Stored data sorting method and device | |
| Gholami Taghizadeh et al. | CA-Dedupe: Content-aware deduplication in SSDs | |
| Yin et al. | PBFilter: A flash-based indexing scheme for embedded systems | |
| CN111104435B (en) | Metadata organization method, device and equipment and computer readable storage medium | |
| CN112965939A (en) | File merging method, device and equipment | |
| CN112711627B (en) | Data importing method, device and equipment of Greemplum database | |
| CN113485948B (en) | NVM bad block management method and control part | |
| CN113741787B (en) | Data storage method, device, equipment and medium | |
| CN110134509B (en) | Data caching method and device | |
| CN113703671B (en) | Data block erasing method and related device | |
| CN113505086B (en) | Storage system capacity statistical method, device, storage medium and equipment |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20220401 |
|
| RJ01 | Rejection of invention patent application after publication |