CN113608701A - Data management method in storage system and solid state disk - Google Patents
Data management method in storage system and solid state disk Download PDFInfo
- Publication number
- CN113608701A CN113608701A CN202110949637.5A CN202110949637A CN113608701A CN 113608701 A CN113608701 A CN 113608701A CN 202110949637 A CN202110949637 A CN 202110949637A CN 113608701 A CN113608701 A CN 113608701A
- Authority
- CN
- China
- Prior art keywords
- data
- mapping
- block
- storage system
- address
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 239000007787 solid Substances 0.000 title claims abstract description 9
- 238000013523 data management Methods 0.000 title abstract description 8
- 238000013507 mapping Methods 0.000 claims abstract description 95
- 238000004590 computer program Methods 0.000 claims description 13
- 238000010586 diagram Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 238000005516 engineering process Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000001680 brushing effect Effects 0.000 description 3
- 230000007246 mechanism Effects 0.000 description 3
- 230000003321 amplification Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000003199 nucleic acid amplification method Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000007723 transport mechanism Effects 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0673—Single storage device
- G06F3/0679—Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the application discloses a data management method in a storage system and a solid state disk. The storage system is used for storing structured data, and the method comprises the following steps: splitting first data to be written into i data blocks with the same size, wherein i is an integer greater than or equal to 1; recording a physical address used by write-in operation for each data block to obtain i pieces of address data; generating a first address data set of the first data according to the i pieces of address data; recording the mapping relation between the first key value of the first data and the first address data set in a preset mapping table; and managing the data in the storage system by utilizing the mapping table.
Description
Technical Field
The embodiment of the present application relates to the field of information processing, and in particular, to a data management method and a solid state disk in a storage system.
Background
KV (key-value) storage transfers the storage work load of the current CPU to a storage controller, so that the software and hardware efficiency is greatly improved, and a way is laid for a new generation of high-performance and extensible storage framework. Since the KV storage technology converts object data into data fragments having the size of a structured data block, when some data changes, the entire structured data block is deleted and reprogrammed, which greatly accelerates the wear of the existing storage medium and affects the storage performance of the small-capacity KV storage device.
Disclosure of Invention
In order to solve any technical problem, embodiments of the present application provide a data management method and a solid state disk in a storage system.
To achieve the object of the embodiments of the present application, an embodiment of the present application provides a data management method in a storage system, where the storage system is configured to store structured data, and the method includes:
splitting first data to be written into i data blocks with the same size, wherein i is an integer greater than or equal to 1;
recording a physical address used by write-in operation for each data block to obtain i pieces of address data;
generating a first address data set of the first data according to the i pieces of address data;
recording the mapping relation between the first key value of the first data and the first address data set in a preset mapping table;
and managing the data in the storage system by utilizing the mapping table.
A storage medium having a computer program stored therein, wherein the computer program is arranged to perform the method as described above when executed.
An electronic device comprising a memory having a computer program stored therein and a processor arranged to execute the computer program to perform the method as described above.
A solid state disk comprises the electronic device.
One of the above technical solutions has the following advantages or beneficial effects:
when the storage system stores the structured data, the value corresponding to the key value of the data to be written is set as i pieces of address data of i data blocks, so that independent management of each data block in the data is realized.
Additional features and advantages of the embodiments of the application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of the embodiments of the application. The objectives and other advantages of the embodiments of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.
Drawings
The accompanying drawings are included to provide a further understanding of the embodiments of the present application and are incorporated in and constitute a part of this specification, illustrate embodiments of the present application and together with the examples of the embodiments of the present application do not constitute a limitation of the embodiments of the present application.
Fig. 1 is a flowchart of a data management method in a storage system according to an embodiment of the present application;
fig. 2 is a schematic diagram of a creating manner of a mapping table provided in the embodiment of the present application;
fig. 3 is a schematic diagram illustrating a storage manner of a mapping table according to an embodiment of the present application;
fig. 4 is a schematic diagram of a recovery manner of a mapping table according to an embodiment of the present application;
fig. 5 is a schematic diagram of an update manner of a mapping table according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present application more apparent, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. It should be noted that, in the embodiments of the present application, features in the embodiments and the examples may be arbitrarily combined with each other without conflict.
In order to solve the problems of low storage performance of KV storage and large Write Amplification (WA) caused by nand flash in the prior art, embodiments of the present application provide a novel key array mapping table, which is used for managing data in a storage system.
Fig. 1 is a flowchart of a data management method in a storage system according to an embodiment of the present application. As shown in fig. 1, the storage system is used for storing structured data, and the method includes:
wherein, the address data can adopt array form to record physical address;
103, generating a first address data set of the first data according to the i pieces of address data;
and 105, managing the data in the storage system by using the mapping table.
According to the method provided by the embodiment of the application, when the storage system stores the structured data, the value corresponding to the key value of the data to be written is set as i pieces of address data of i data blocks, so that independent management of each data block in the data is realized.
Fig. 2 is a schematic diagram of a creating manner of a mapping table provided in the embodiment of the present application. As shown in fig. 2, taking an example that the standard value can be 4K, the key array mapping table is created by generating a key value by hash engine, splitting the structured data block written by the host into 4K data fields, associating physical addresses corresponding to all 4K data into an array, and finally associating the key value with the array to form a key-array mapping relationship, where all key array pairs constitute the key array mapping table.
The following describes the above process in detail by taking a certain structured data to be written as an example, including:
step A, determining a key value of structured data to be written:
and carrying out hash on the key in the access command issued by the host end to obtain a hash value, namely the key in the mapping table, and obtaining the unique hash value of the structured data as the key value of the structured data, wherein the key value is used for recording and representing the logical address of the structured data information accessed by the host end.
Step B, determining an array set of the structured data to be written as a value of the structured data in the KV storage system:
step B01, splitting the structured data written by the host into data blocks with the size of 4k data fields;
for the case of less than 4k, dummy data may be added to fill 4 k;
for example, the data chunks obtained by splitting are D0, D1, D2, … …, Di, … …; wherein i is an integer of 0 or more.
Step B02, when each data block obtained by splitting is written in sequence, recording the physical address written by each data block obtained by splitting, constructing the physical address of each 4k data into an array,
wherein, each array record corresponds to all physical addresses of 4k data;
for example, the array of data blocks may be array [0], array [1], array [2], … …, array [ i ], … ….
Step B03, generating an array set of structured data according to the writing sequence of the data blocks;
the array arrangement sequence in the data set is consistent with the writing sequence of the corresponding database.
And C, associating the key value with the array to form a key-array pair.
Wherein the number of the array members corresponding to one key is not more than 128; if the size of the structured data loaded from the host side exceeds the size specified by the number of array members, the excess part will be divided into the next key-array pair.
The above-mentioned procedure provides the establishment process of the mapping relation table of the structured data to be written, and different from the key-vlaue correspondence of the structured data in the prior art, the value in the above-mentioned procedure is the array set of the physical addresses of the data blocks with the same size, and can provide operation support for the local update operation.
In a storage system, Nand Flash is used for storing data, and DRAM is used for caching user data and storing the corresponding relationship between logical addresses and physical addresses when a Solid State Disk (SSD) works. Once the SSD is powered down, the data in the RAM is lost, which may result in a serious error if there is no mapping table reconstruction mechanism. In addition, since the Cache (Cache) needs to frequently update the key array mapping table, in order to increase the access speed, the Cache can be used for local caching, and if sudden power failure occurs, data in the Cache is lost, so that a software mechanism is needed to recover the loss.
In order to solve the above problem, in the physical block in which the first data is written, a time stamp and mapping information are recorded for each data block in the physical block in which the first data is written, wherein the time stamp of the ith data block indicates a writing order of the ith data block, and the mapping information of the ith data block includes a first key value and the ith address data.
The mapping information comprises a mapping pair formed by a first key value and each piece of address data, and the representation relationship is key-array [ i ].
By recording the writing time and the mapping information of the written data in the physical block, the purpose of recording the mapping relation of the data in the physical block of the storage system can be realized, and the storage of the mapping relation is completed.
Preferably, the writing time and the mapping information are recorded in metadata of each data block.
And the metadata is utilized to finish the storage of the information, so that the information is convenient to search and position.
The mapping table is divided into N mapping sub-tables, wherein each mapping sub-table records the mapping relation of data stored in one physical block;
writing a time stamp and mapping information of an ith data block in metadata of the ith data block while writing the ith data block in the nth physical block;
wherein N and N are integers, and N is less than or equal to N, wherein N is the total number of physical blocks in the storage system.
Dividing the whole key array mapping table into N equal parts, and if one part of the physical block (block) is written in sequence flush, recording an Sn time stamp for each physical block, wherein the Sn time stamp is recorded in a metadata meta data area of each data; and recording key-array [ x ] of the data, wherein x is the offset of the array in the key-array mapping table.
By adopting the mode, the mapping table information corresponding to the user data loaded in the physical block can be written into the meta data area every time the physical block is written, namely the writing in the physical block is finished, and the 1/N large mapping table can be written into the metadata area, so that if the writing in the N blocks is finished, a complete key array mapping table can be obtained by refreshing, but the mapping table is not up to date.
The latest key array mapping table is the 1 key array mapping sub-table stored in the block indicated by the current latest Sn number, and the N-1 previous blocks of key array mapping sub-tables according to the time stamp of the block.
Fig. 3 is a schematic diagram of a storage manner of a mapping table according to an embodiment of the present application. As shown in fig. 3, the storage manner of the mapping table is designed based on the purpose of restoration, and in the process of storing the key array mapping table, since each mapping sub-table will be subjected to subsequent write operation to obtain the latest value of the respective write time, the latest key array mapping relationship must exist in the head block and N-1 blocks traced from the head block to the front, where the head block is the block with the latest write time stamp Sn in all blocks.
In an exemplary embodiment, after the storage system loses a mapping table, a target physical block written last time before the loss is determined according to timestamps in N physical blocks;
acquiring the target physical block and a mapping sub-table of the first N-1 physical blocks of the target physical block;
and generating a latest mapping table by using the acquired mapping sub-table.
The method comprises the steps of calling a block which is being written before power failure as a head block, based on a key array mapping table time-sharing flashing strategy, when writing of N blocks is completed, writing a complete key array mapping table, enabling key array mapping table information in meta data in the N blocks which are written at last to be latest, and completing building of a latest table by utilizing sub-tables corresponding to the N blocks according to the last N blocks starting from the head block according to a timestamp during writing.
Fig. 4 is a schematic diagram of a recovery manner of a mapping table according to an embodiment of the present application. As shown in fig. 4, after the power failure occurs in the storage system, the meta data region of each block is obtained, iteration is performed on the timestamp with the latest time by using the latest write timestamp, so that N blocks can be obtained, and the latest key array mapping table before the power failure can be reconstructed by using the timestamps of the N physical blocks.
In an exemplary embodiment, the managing data in the storage system by using the mapping table includes:
if the request information is the read second data, acquiring a second key value of the second data;
determining a second address data set corresponding to the second key from the mapping table;
and reading data in all storage addresses in the second address data set.
When an access request is received, all key-array pairs recorded in a mapping relation table in a DDR are accessed to find out the key value of the structured data required by the access request, then all data in the physical address indicated by each array member related to the key value are read out and sent to the front end, and the front end determines which data are required by the host end in transmission.
As can be seen from the data access process in the above processes, the embodiment of the present application provides a data access process based on a novel key-array pair, and the data access process is compatible with a data access mechanism of a KV storage system in the prior art, and has good universality.
In an exemplary embodiment, the managing data in the storage system by using the mapping table includes:
if the request information is that m data blocks in the stored third data are updated to be p data blocks, determining address data of the m data blocks, and recording physical addresses written by the p data blocks;
in a third address data set corresponding to the third data, replacing physical addresses in address data corresponding to the m data blocks with physical addresses written in by the p data blocks to obtain an updated mapping table;
wherein M is more than or equal to 1 and less than or equal to M, p is more than or equal to 1, M, M and p are positive numbers, and M is the total number of the data blocks into which the third data are divided.
In the above method flow, if a rewrite instruction is received, it is first determined whether a second key value carried by the rewrite instruction is in the mapping relationship table, and if the second key value is not in the mapping relationship table, it indicates that the rewrite instruction is a write operation, and according to the flow shown in fig. 1, when writing the structured data, the creation operation of the mapping relationship is completed.
If the second key value is in the mapping relationship table, it indicates that the rewrite instruction is to modify the original data into new data, and write the new data specified by the host into a new flash memory address, where the original data corresponding to the new data may be data stored by some or all of the array members associated with one or more keys, update a physical address indicated by the array member of the original data hit by the rewrite instruction in the key-array, and the generated new mapping relationship may include one or more key-array pairs, or may only change the physical address indicated by some of the original key-array pairs.
Fig. 5 is a schematic diagram of an update manner of a mapping table according to an embodiment of the present application. As shown in fig. 5, the update of the key array mapping table can be divided into local update and global update, the update condition depends on the requirement of the host, and only the access command of the host needs to be converted into the access to the data information included in the key value, and then the address of the user data information stored in the hit array member in the key array mapping table is updated, so as to obtain the latest key array mapping table.
To sum up, the method provided in the embodiment of the present application implements local update of the mapping relationship, only needs to update data specified by the host, does not need to update data of the entire structured data block included in the value pointed by the key, and provides a set of management policies of the mapping table (creation/update/storage/reduction of the mapping table), which can be applied to the KV storage technology to improve the pressure of processing the mapping table on performance, thereby improving the management efficiency of the SSD on user data; the table storage strategy is designed based on the idea of restoration, the trouble of a traditional table brushing strategy GC is avoided, and the performance pressure brought by table brushing is reduced from the table brushing aspect; compared with the integral programming mode in the KV storage technical scheme, the method reduces write amplification to a certain extent and prolongs the service life of the Nand flash.
An embodiment of the present application provides a storage medium, in which a computer program is stored, wherein the computer program is configured to perform the method described in any one of the above when the computer program runs.
An embodiment of the application provides an electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the computer program to perform the method described in any one of the above.
The embodiment of the application provides a Solid State Disk (SSD), which comprises the device.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the components may be implemented as software executed by a processor, such as a digital signal processor or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by a computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Claims (10)
1. A method for managing data in a storage system, the storage system being configured to store structured data, the method comprising:
splitting first data to be written into i data blocks with the same size, wherein i is an integer greater than or equal to 1;
recording a physical address used by write-in operation for each data block to obtain i pieces of address data;
generating a first address data set of the first data according to the i pieces of address data;
recording the mapping relation between the first key value of the first data and the first address data set in a preset mapping table;
and managing the data in the storage system by utilizing the mapping table.
2. The method of claim 1, further comprising:
and recording a time stamp and mapping information for each data block in the physical block in which the first data is written, wherein the time stamp of the ith data block represents the writing sequence of the ith data block, and the mapping information of the ith data block comprises a first key value and ith address data.
3. The method of claim 2, wherein the writing time and the mapping information are recorded in metadata of each data block.
4. The method of claim 3, wherein:
the mapping table is divided into N mapping sub-tables, wherein each mapping sub-table records the mapping relation of data stored in one physical block;
writing a time stamp and mapping information of an ith data block in metadata of the ith data block while writing the ith data block in the nth physical block;
wherein N and N are positive integers, and N is less than or equal to N, wherein N is the total number of physical blocks in the storage system.
5. The method of claim 2, further comprising:
after the storage system loses a mapping table, determining a target physical block written in the last time before the loss according to the timestamps in the N physical blocks;
acquiring the target physical block and a mapping sub-table of the first N-1 physical blocks of the target physical block;
and generating a latest mapping table by using the acquired mapping sub-table.
6. The method of claim 1, wherein managing data in a storage system using the mapping table comprises:
if the request information is the read second data, acquiring a second key value of the second data;
determining a second address data set corresponding to the second key from the mapping table;
and reading data in all storage addresses in the second address data set.
7. The method of claim 1, wherein managing data in a storage system using the mapping table comprises:
if the request information is that m data blocks in the stored third data are updated to be p data blocks, determining address data of the m data blocks, and recording physical addresses written by the p data blocks;
in a third address data set corresponding to the third data, replacing physical addresses in address data corresponding to the m data blocks with physical addresses written in by the p data blocks to obtain an updated mapping table;
wherein M is more than or equal to 1 and less than or equal to M, p is more than or equal to 1, M, M and p are positive numbers, and M is the total number of the data blocks into which the third data are divided.
8. A storage medium, in which a computer program is stored, wherein the computer program is arranged to perform the method of any of claims 1 to 7 when executed.
9. An electronic device comprising a memory and a processor, wherein the memory has stored therein a computer program, and wherein the processor is arranged to execute the computer program to perform the method of any of claims 1 to 7.
10. A solid state disk, SSD, further comprising the apparatus of claim 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110949637.5A CN113608701B (en) | 2021-08-18 | 2021-08-18 | Data management method in storage system and solid state disk |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110949637.5A CN113608701B (en) | 2021-08-18 | 2021-08-18 | Data management method in storage system and solid state disk |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113608701A true CN113608701A (en) | 2021-11-05 |
| CN113608701B CN113608701B (en) | 2024-09-20 |
Family
ID=78308920
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110949637.5A Active CN113608701B (en) | 2021-08-18 | 2021-08-18 | Data management method in storage system and solid state disk |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113608701B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113835639A (en) * | 2021-09-26 | 2021-12-24 | 深圳大普微电子科技有限公司 | I/O request processing method, device, equipment and readable storage medium |
| CN114691418A (en) * | 2022-05-30 | 2022-07-01 | 阿里巴巴（中国）有限公司 | Information recovery method and device for storage device, electronic device and storage medium |
| CN115993940A (en) * | 2023-03-23 | 2023-04-21 | 青岛鼎信通讯股份有限公司 | Electric quantity loss prevention method and device, electric energy meter equipment and storage medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120054419A1 (en) * | 2010-08-27 | 2012-03-01 | Via Technologies, Inc. | Memory device and operating method thereof |
| CN104025010A (en) * | 2011-09-30 | 2014-09-03 | 净睿存储股份有限公司 | Variable length encoding in a storage system |
| US20170091115A1 (en) * | 2015-09-25 | 2017-03-30 | Beijing Lenovo Software Ltd. | Method and electronic device for a mapping table in a solid-state memory |
| WO2017113123A1 (en) * | 2015-12-29 | 2017-07-06 | 华为技术有限公司 | Data deduplication method and storage device |
| CN108572958A (en) * | 2017-03-07 | 2018-09-25 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| US20190018788A1 (en) * | 2017-07-11 | 2019-01-17 | Toshiba Memory Corporation | Memory system and method for controlling nonvolatile memory |
| CN110187999A (en) * | 2019-05-09 | 2019-08-30 | 新华三技术有限公司 | Address mapping data backup method and device |
| CN110462577A (en) * | 2017-12-28 | 2019-11-15 | 华为技术有限公司 | A kind of method and solid state hard disk array of data write-in |
| CN110554839A (en) * | 2019-07-30 | 2019-12-10 | 华为技术有限公司 | distributed storage system access method, client and computer program product |
| CN111913664A (en) * | 2020-07-30 | 2020-11-10 | 杭州宏杉科技股份有限公司 | Data writing method and device |
| CN112346666A (en) * | 2020-11-30 | 2021-02-09 | 华中科技大学 | Writing and block granularity compression and combination method and system of key value storage system based on OCSSD |
-
2021
- 2021-08-18 CN CN202110949637.5A patent/CN113608701B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120054419A1 (en) * | 2010-08-27 | 2012-03-01 | Via Technologies, Inc. | Memory device and operating method thereof |
| CN104025010A (en) * | 2011-09-30 | 2014-09-03 | 净睿存储股份有限公司 | Variable length encoding in a storage system |
| US20170091115A1 (en) * | 2015-09-25 | 2017-03-30 | Beijing Lenovo Software Ltd. | Method and electronic device for a mapping table in a solid-state memory |
| WO2017113123A1 (en) * | 2015-12-29 | 2017-07-06 | 华为技术有限公司 | Data deduplication method and storage device |
| CN107430602A (en) * | 2015-12-29 | 2017-12-01 | 华为技术有限公司 | Data de-duplication method and storage device |
| CN108572958A (en) * | 2017-03-07 | 2018-09-25 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| US20190018788A1 (en) * | 2017-07-11 | 2019-01-17 | Toshiba Memory Corporation | Memory system and method for controlling nonvolatile memory |
| CN110462577A (en) * | 2017-12-28 | 2019-11-15 | 华为技术有限公司 | A kind of method and solid state hard disk array of data write-in |
| CN110187999A (en) * | 2019-05-09 | 2019-08-30 | 新华三技术有限公司 | Address mapping data backup method and device |
| CN110554839A (en) * | 2019-07-30 | 2019-12-10 | 华为技术有限公司 | distributed storage system access method, client and computer program product |
| CN111913664A (en) * | 2020-07-30 | 2020-11-10 | 杭州宏杉科技股份有限公司 | Data writing method and device |
| CN112346666A (en) * | 2020-11-30 | 2021-02-09 | 华中科技大学 | Writing and block granularity compression and combination method and system of key value storage system based on OCSSD |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113835639A (en) * | 2021-09-26 | 2021-12-24 | 深圳大普微电子科技有限公司 | I/O request processing method, device, equipment and readable storage medium |
| CN114691418A (en) * | 2022-05-30 | 2022-07-01 | 阿里巴巴（中国）有限公司 | Information recovery method and device for storage device, electronic device and storage medium |
| CN115993940A (en) * | 2023-03-23 | 2023-04-21 | 青岛鼎信通讯股份有限公司 | Electric quantity loss prevention method and device, electric energy meter equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113608701B (en) | 2024-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113608701B (en) | Data management method in storage system and solid state disk | |
| US9244833B2 (en) | Data-storage device and flash memory control method | |
| EP2735978B1 (en) | Storage system and management method used for metadata of cluster file system | |
| US8356148B2 (en) | Snapshot metadata management in a storage system | |
| EP3153987B1 (en) | Duplicate data deletion method and device | |
| CN106951375B (en) | Method and device for deleting snapshot volume in storage system | |
| CN112307263B (en) | File storage method, device, equipment and medium | |
| CN110147203B (en) | File management method and device, electronic equipment and storage medium | |
| CN112860594B (en) | Solid-state disk address remapping method and device and solid-state disk | |
| CN112631950B (en) | L2P table saving method, system, device and medium | |
| CN107203331B (en) | Method and device for writing data | |
| CN111177143B (en) | Key value data storage method and device, storage medium and electronic equipment | |
| EP4012547B1 (en) | Storage method and apparatus for key value (kv) and storage device | |
| CN110134551B (en) | Continuous data protection method and device | |
| CN111444114B (en) | Method, device and system for processing data in nonvolatile memory | |
| CN113253932B (en) | Read-write control method and system for distributed storage system | |
| CN112995257A (en) | Cache expansion method and device based on cloud storage architecture and storage medium | |
| CN110795031A (en) | Data deduplication method, device and system based on full flash storage | |
| CN112817962B (en) | Data storage method and device based on object storage and computer equipment | |
| US20230142948A1 (en) | Techniques for managing context information for a storage device | |
| US11593328B2 (en) | Update of deduplication fingerprint index in a cache memory | |
| CN114780489A (en) | Method and device for realizing distributed block storage bottom layer GC | |
| US20090187719A1 (en) | Data backup method for logical volume manager | |
| CN113535089A (en) | Method for refreshing mapping table of SSD | |
| CN112131433B (en) | Interval counting query method and device |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |