WO2016082559A1

WO2016082559A1 - Data writing method and storage device

Info

Publication number: WO2016082559A1
Application number: PCT/CN2015/083885
Authority: WO
Inventors: 叶茂
Original assignee: 华为技术有限公司
Priority date: 2014-11-28
Filing date: 2015-07-13
Publication date: 2016-06-02
Also published as: CN104461384A; CN104461384B

Abstract

A data writing method and a storage device. The method is applied to a storage device (40), and the storage device (40) comprises a processor (41), memory (42), and a storage medium (43). Data blocks in the storage medium (43) are organized in a tree structure, leaf nodes of the tree are used to store the data blocks, and a parent node and a root node of the tree are used to store index data, and the index data is used to index the data blocks. The method is performed by the processor (41), and comprises: receiving a plurality of data blocks and writing the plurality of data blocks to the memory (21); modifying the plurality of data blocks in the memory (22); determining at least two data blocks from the plurality of modified data blocks, index data of the at least two data blocks being the same (23); assigning a storage address to the at least two data blocks in the storage medium, and writing the at least two data blocks to the storage medium according to the assigned storage address(24); and modifying the index data that points to the at least two data blocks (25).

Description

Data writing method and storage device

This application claims priority to Chinese Patent Application No. 201410712344.5, entitled "A Data Writing Method and Storage Device", filed on November 28, 2014, the entire contents of which is incorporated herein by reference. In the application.

Technical field

The present invention relates to the field of electronic technologies, and in particular, to a data writing method and a storage device.

Background technique

Compared with traditional mechanical hard disks, SSD (English: Solid State Drive; Chinese) has the advantages of fast reading and writing speed, shockproof, small size, zero noise, etc., and is widely used. The number of writes to a typical SSD is limited.

In the prior art, the data block on the SSD is modified by using ROW (English: Redirection On Write; Chinese: write-time redirection) technology. Existing file system based on ROW technology on SSD generally organizes the entire file system into a tree structure. The leaf nodes in the tree structure are used to store data blocks, the parent nodes and roots are index data, and the index data is used to index data blocks.

When modifying the data block on the SSD, first modify it in the memory, and then allocate the storage address on the SSD for the modified data block. In order to be able to index to the modified data block, the index data of the modified data block needs to be performed. Update. After the update is complete, the file system will spawn a new tree root to replace the old tree root.

In the prior art, each time a data block is modified, the index data is overwritten. When the amount of modified data is large, a large amount of index data is overwritten, which causes a large write overhead for the SSD, resulting in a decrease in SSD performance and lifetime. Moreover, in the prior art, the file system must be generated with a new root to delete the modified data block from the memory, and the memory utilization is low.

Therefore, the technical problem existing in the prior art is that each time the data block is modified, its index data is modified accordingly, causing a large write overhead on the SSD, resulting in a decrease in SSD performance and lifetime.

Summary of the invention

The embodiment of the present invention provides a data writing method and a storage device, which are used to solve the problem that each modified data block existing in the prior art will modify its index data correspondingly, causing a large write overhead on the SSD, resulting in SSD performance. And the technical problem of declining lifespan achieves the technical effect of reducing the write overhead caused by modifying the data block to the SSD, improving the performance of the SSD, and prolonging the life of the SSD.

A first aspect of the embodiments of the present invention provides a data writing method, where the method is applied to a storage device, where the storage device includes a processor, a memory, and a storage medium, and the data blocks in the storage medium are organized in a tree structure. a leaf node of the tree is used to save a data block, a parent node and a root node of the tree are used to store index data, the index data is used to index the data block, and the method is performed by the processor. include:

Receiving a plurality of data blocks and writing to the memory;

Modifying the plurality of data blocks in the memory;

Determining at least two data blocks from the modified plurality of data blocks, the index data of the at least two data blocks being the same;

Allocating a storage address in the storage medium for the at least two data blocks, and writing the at least two data blocks to the storage medium according to the allocated storage address;

Modifying index data directed to the at least two data blocks.

With reference to the first aspect, in a first possible implementation, before the modifying is directed to the index data of the at least two data blocks, the method further includes:

The at least two data blocks are deleted from the memory.

With reference to the first aspect, in a second possible implementation, the modifying is directed to the index data of the at least two data blocks, and specifically includes:

Creating a record table for the at least two data blocks, and recording a storage address of the at least two data blocks in the storage medium;

Determining index data pointing to the at least two data blocks in the memory according to the record table, The modified index data of the at least two data blocks points to a storage address of the at least two data blocks;

Indexing the modified index data of the at least two data blocks to the storage medium.

A second aspect of the embodiments of the present invention provides a storage device, where the storage device includes a processor, a memory, and a storage medium, where data blocks in the storage medium are organized in a tree structure, and leaf nodes of the tree are used to save data. a block, a parent node and a root node of the tree are used to store index data, the index data is used to index the data block, and the processor is configured to:

Receiving a plurality of data blocks and writing to the memory;

Modifying the plurality of data blocks in the memory;

Modifying index data directed to the at least two data blocks.

In conjunction with the second aspect, in a first possible implementation, the processor is further configured to:

The at least two data blocks are deleted from the memory before the modification points to the index data of the at least two data blocks.

In combination with the second aspect, in a second possible implementation, the processor is specifically configured to:

Determining index data pointing to the at least two data blocks in the memory according to the record table, where the modified index data points to a storage address of the at least two data blocks;

One or more technical solutions provided in the embodiments of the present invention have at least the following technical effects or advantages:

In the embodiment of the present invention, first, modifying a plurality of data blocks in the memory, and then modifying the plurality of data blocks At least two data blocks having the same index data are determined in the block, then at least two data blocks are written to the storage medium, and finally the index data directed to the at least two data blocks is modified.

Compared with the prior art, each time the modified data block is written from the memory into the storage medium, the index data of the modified data block is updated, and the modified data block is used in the embodiment of the present invention. Determining at least two data blocks having the same index data, and writing at least two data blocks having the same index data from the memory to the storage medium, and batch updating the index data common to the at least two data blocks, thereby reducing the index The number of times the data is updated is implemented to reduce the write overhead caused by modifying the data block to the storage device.

DRAWINGS

In order to more clearly illustrate the present invention or the technical solutions in the prior art, the drawings to be used in the present invention or the description of the prior art will be briefly described below. It is obvious that the drawings in the following description are merely the present invention. Some of the embodiments can be obtained by those of ordinary skill in the art in view of the drawings without departing from the scope of the invention.

1 is a schematic diagram of a file system to which an information processing method according to an embodiment of the present invention is applied;

2 is a flowchart of an information processing method according to an embodiment of the present invention;

3 is a flowchart of updating index data in an embodiment of the present invention;

FIG. 4 is a schematic structural diagram of hardware of a storage device according to an embodiment of the present invention.

detailed description

In the embodiment of the present invention, first, a plurality of data blocks are modified in a memory, and then at least two data blocks having the same index data are determined from the modified plurality of data blocks, and then at least two data blocks are written to the memory. The storage medium is finally modified to index data pointing to at least two data blocks.

The technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the drawings in the embodiments of the present invention. It is a partial embodiment of the invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present application.

The term "and/or" in this context is merely an association describing the associated object, indicating that there may be three relationships, for example, A and / or B, which may indicate that A exists separately, and both A and B exist, respectively. B these three situations. In addition, the character "/" in this article generally indicates that the contextual object is an "or" relationship.

Embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

Embodiments of the present invention provide a data writing method, which is applied to a storage device. Please refer to FIG. 4. FIG. 4 is a schematic diagram showing the hardware structure of the storage device 40. The storage device 40 may be an SSD (English: Solid State Drive; Chinese: SSD) including a processor 41, a memory 42 and a storage medium 43, and the storage medium 43 may be a Flash granule or other type of hard disk. Data can be stored in the storage medium 43. Specifically, the data blocks in the storage medium 43 are organized in a tree structure. Please refer to FIG. 1. FIG. 1 is a schematic diagram of a tree structure in a storage medium 43. The leaf node of the tree is used to save the data block, the parent node and the root node of the tree are used to store the index data, and the index data is used to index the data block. In FIG. 1, the root of the tree is used to store the index data A, the parent node is used to store the index data B and the index data C, and the leaf node is used to store the data block D, the data block E, the data block F, and the data block H.

As shown in FIG. 4, in an actual application process, the storage device 40 can be connected to the server 400 as a separate electronic device. The storage device 40 can also serve as an element of the server 400. The server 400 sends the write data to the storage device 40. After the storage device 40 receives the request for writing data, the processor 41 of the storage device 40 executes the writing method provided by the embodiment of the present invention in response to the request for writing the data.

Please refer to FIG. 2. FIG. 2 is a flowchart of a data writing method according to an embodiment of the present invention. The data writing method provided by the embodiment of the present invention, which may be applied to the storage device 40 described in FIG. 4, is executed by the processor 41, and includes the following steps:

Step 21: Receive a plurality of data blocks and write the memory;

Step 22: Modify the plurality of data blocks in the memory;

Step 23: Determine at least two data blocks from the modified plurality of data blocks, where index data of the at least two data blocks are the same;

Step 24: Allocating a storage address in the storage medium for the at least two data blocks, and writing the at least two data blocks to the storage medium according to the allocated storage address;

Step 25: Modify index data pointing to the at least two data blocks.

When the server 400 wants to write data to the storage device 40, a request to write data is sent to the storage device 40, and after the storage device 40 receives the request to write the data, the processor 41 of the storage device responds to the written data. Request, receive multiple data blocks sent by the server, and then write to memory. As shown in FIG. 1, the processor 41 receives the data block D, the data block E, the data block F, and the data block H, and writes them into the memory 42, and stores them in the leaf nodes of the tree.

When the server 400 wants to modify the data block in the storage device 40, the request for modifying the data is sent to the storage device 40. After the storage device 40 receives the request to modify the data, the processor 41 of the storage device responds to the request to modify the data, first. The data block is modified in the memory to generate a dirty data block, wherein the dirty data block is a data block that is modified in the memory and is not written into the storage medium.

The modification of the data block D in FIG. 1 is taken as an example. The index data A held by the root of the tree in the memory is indexed to the data block D by the index data B held by the parent node, and then the data block D is modified into the data block S, The data block S is stored in the memory. Since the data block S is only modified in the memory, the data block S has not been written into the storage medium, so the data block S is a dirty data block, and the index data of the dirty data block S is: an index Data B. According to the same modification method, the data block E can be modified to generate a dirty data block H, and the index data of the dirty data block H is: index data B.

In order to avoid updating the index data of the dirty data block immediately after writing the dirty data block from the memory into the storage medium, the embodiment of the present invention proposes a method for batch updating the index data, which is a dirty data block. After the dirty data block record is created, step 23 may be performed to determine at least two data blocks from the modified plurality of data blocks, and the index data of the at least two data blocks is the same.

Continuing with the above example, the index data of the dirty data block S is: index data B, and the index data of the dirty data block H is: index data B, it can be determined that the dirty data block S and the dirty data block H are the same for the two index data. data block.

Then, step 24 can be performed to write at least two dirty data blocks with the same index data from the memory into the storage medium.

In order to write dirty data blocks from the memory into the storage medium, the dirty data block is first allocated a storage address in the storage medium. The storage address in the storage medium corresponds to the physical block number, and the physical block number is usually used to represent the storage address. As long as a dirty data block is generated, the physical block number can be assigned to the generated dirty data block.

Continuing with the above example, if there is a dirty data block S and a dirty data block H in the memory, the physical block number assigned to the dirty data block S is 01, the physical block number assigned to the dirty data block H is 02, the physical block number 01 and Physical block number 02 characterizes the storage addresses of the storage medium as a and b, respectively. Then, the dirty data block S is written from the memory to the memory address a characterized by the physical block number 01, and the dirty data block H is written from the memory to the memory address b represented by the physical block number 02.

After the at least two dirty data blocks having the same index data are written from the memory into the storage medium, step 25 can be performed: modifying the index data of the at least two dirty data blocks that are the same as the index data.

Please refer to FIG. 3. FIG. 3 is a flowchart of updating index data in an embodiment of the present invention. Updating the index data specifically includes the following steps:

Step 31: Create a record table for the at least two data blocks, and record the at least two data blocks at a storage address in the storage medium;

Step 32: Modify, according to the record table, index data that points to the at least two data blocks in the memory, and the modified index data points to a storage address of the at least two data blocks;

Step 33: Write the modified index data of the at least two data blocks to the storage medium.

Step 31 is explained first. Continuing with the above example, after the physical block number is assigned to the dirty data block, in the embodiment of the present invention, in order to directly write the dirty data block from the memory into the storage medium, the dirty data block can be indexed and needs to be in the memory. The correspondence between the index data of the dirty data block and the physical block number is stored. That is, dirty data block records are created for dirty data blocks. Specifically, dirty data block records can be created for dirty data blocks in non-volatile memory.

Since the function of the dirty data block record is to index the dirty data block, in order to avoid the loss of the dirty data block record after the power failure, the dirty data block cannot be indexed, and the dirty data block record can be stored in the non-volatile memory to ensure the dirty data. Storage security for block records.

Continuing with the above example, after the physical block number 01 is allocated to the dirty data block S, a dirty data block record is created for the dirty data block S, and the index data of the dirty data block S is recorded as: index data B, and the corresponding physical block number is 01. . Similarly, after the physical block number 02 is allocated to the dirty data block H, a dirty data block record is created for the dirty data block H, and the index data of the dirty data block H is recorded as: index data B, and the corresponding physical block number is 02.

In the embodiment of the present invention, when a dirty data block record is created for a dirty data block in a non-volatile memory, a mapping table may be established in the memory, and the mapping table is used to record the logical block number and the physical block number of the dirty data block. The mapping relationship, the logical block number can be obtained from the index data.

Since dirty block records are stored sequentially in non-volatile memory, if you want to index to a dirty block, you must search sequentially in the record table formed by the dirty block record to find the time. In order to quickly find the dirty data block, the logical block number of the dirty data block can be obtained according to the index data of the dirty data block, and then the mapping of the logical block number to the physical block number is established. When indexing a dirty data block, it is convenient and quick to quickly determine the physical block number of the dirty data block according to the mapping relationship.

Continuing with the above example, the index data of the dirty data block S is: index data B, the index data of the dirty data block H is: index data B, the original index data B can be indexed to the data block D and the data block E, the data block D The logical block number is 111, and the logical block number of the data block E is 222, so it can be determined that the logical block number of the dirty data block S is 111, and the logical block number of the dirty data block H is 222, that is, the original data block and the modified data block are obtained. The logical block number of the dirty data block is the same.

A mapping table is then created in which the logical block number 111 is mapped to physical block number 01 and the logical block number 222 is mapped to physical block number 02. When the dirty block with the logical block number of 111 is indexed, the corresponding physical block number can be quickly determined to be 01 according to the mapping table. If a record table formed based on a plurality of dirty data blocks is recorded, it is necessary to search sequentially in the record table. If the record of the dirty block with the logical block number 111 is at the end of the record table, it takes a long time to index. A dirty block with a logical block number of 111.

Although it is convenient and efficient to use a mapping table to index dirty data blocks, because the mapping table is only stored in memory, once the power is turned off, the mapping table disappears. Therefore, after the power is turned off, the formed record table is recorded according to the plurality of dirty data blocks, and the mapping table is generated. Mapping tables are often used to index dirty data blocks.

Then step 32 and step 33 are performed. Continuing with the above example, the index data B originally records the physical block number 03 of the data block D and the physical block number 04 of the data block E. Since the data block D and the data block E are respectively modified, the dirty data block S and the dirty data are generated. Block H, therefore, the index data B should be correspondingly changed to record the physical block number 01 of the dirty data block S and the physical block number 02 of the dirty data block H. Therefore, the index data B is modified in the memory, and the dirty data block M is generated. The dirty data block M records the physical block number 01 of the dirty data block S and the physical block number 02 of the dirty data block H.

The index data C originally records the physical block number 05 of the data block F and the physical block number 06 of the data block K, assuming that after modifying the data block D and the data block E, the data block F and the data block K are also modified to generate The dirty data block W and the dirty data block R, the physical block numbers assigned to the dirty data block W and the dirty data block R are 07 and 08, and the index data of the dirty data block W and the dirty data block R are: index data C, The index data common to both is index data C. Therefore, the index data C is correspondingly changed to record the physical block numbers 07 and 08 of the dirty data block W and the dirty data block R. Therefore, the index data C is modified in the memory, and the dirty data block N is generated. The dirty data block N records the physical block number 07 of the dirty data block W and the dirty data block R. Physical block number 08.

The process of specifically updating the index data B and the index data C is: modifying the index data B and the index data C in the memory respectively, and generating the dirty data block M and the dirty data block W. Then, the physical block numbers assigned to the dirty data block M and the dirty data block W in the storage medium are 09 and 10, respectively, and the dirty data block M and the dirty data block W are written from the memory to the physical block numbers 09 and 10, respectively. The storage address represented.

Finally update index data A. Since the index data of the dirty data block M is: index data A, the index data of the dirty data block W is: index data A. Therefore, the index data corresponding to the two is index data A. The index data A originally records the physical block number 11 of the index data B and the physical block number 12 of the index data C. Since the index data B and the index data C are respectively modified in the memory, the dirty data block M and the dirty data block W are generated. . Therefore, the index data A should be changed correspondingly to the physical block number 09 of the dirty data block M and the physical block number 10 of the dirty data block W. The index data A is modified in the memory to generate a dirty data block T. Then, the physical block number assigned to the dirty data block T in the storage medium is 13, and the dirty data block T is written from the memory into the storage address represented by the physical block number 13.

In the embodiment of the present invention, after the modified index data is written into the storage medium from the memory, the method further includes:

Delete the dirty block record table in the non-volatile memory and the map in the memory;

The modified index data is deleted from the memory.

Specifically, after the modified index data is written from the memory to the storage medium, the modified index data can be indexed in the storage medium, and the modified data in the memory is not necessary to be stored, so In order to improve the memory utilization, the modified index data may be deleted from the memory after the modified index data is written from the memory to the storage medium.

In addition, after the dirty data block and the modified index data are written from the memory into the storage medium, the dirty data block and the modified index data can be directly indexed from the storage medium, and the dirty data in the non-volatile memory. The data block record table and the mapping table in the memory are also unnecessary to be stored, so in order to improve the memory utilization, the modified index data can be read from the memory into the storage medium, and the modified index data is Deleted in memory.

In the embodiment of the present invention, when the specified dirty data block needs to be read, the method further includes:

Receiving a read request to read a specified dirty data block;

Retrieving the specified dirty data block in the memory in response to the read request;

If the specified dirty data block exists in the memory, reading the specified dirty data block from the memory;

If the specified dirty data block does not exist in the memory, the specified physical block number corresponding to the specified logical block number is searched from the mapping table according to the specified logical block number of the specified dirty data block;

The designated dirty data block is read from the storage medium according to the specified physical block number.

Specifically, when reading the specified dirty data block, you can first find the specified dirty data block from the memory. If the specified dirty data block is not written from the memory to the storage medium, the specified dirty can be directly found from the memory. The data block is then read out of memory to the specified dirty data block. If the dirty data block is written from the memory to the storage medium, the dirty data block is deleted from the memory. In this case, the mapping table can be used to find the logical block number of the specified dirty data block from the mapping table, thereby finding the corresponding The physical block number, the specified dirty data block is read from the storage address represented by the physical block number.

Based on the same inventive concept, an embodiment of the present invention further provides a storage device. Please refer to FIG. 4. FIG. 4 is a schematic diagram showing the hardware structure of the storage device 40. The storage device 40 may be an SSD (English: Solid State Drive; Chinese: SSD) including a processor 41, a memory 42 and a storage medium 43, and the storage medium 43 may be a Flash granule or other type of hard disk. The data blocks in the storage medium 43 are organized in a tree structure, the leaf nodes of the tree are used to store data blocks, the parent nodes and root nodes of the tree are used to store index data, and the index data is used to index data blocks. For the meaning of the terminology involved in the storage device shown in FIG. 4 and the specific implementation, reference may be made to the foregoing descriptions of FIGS. 1 to 3 and the related embodiments.

As shown in FIG. 4, in an actual application process, the storage device 40 can be connected to the server 400 as a separate electronic device. The storage device 40 can also serve as an element of the server 400. The server 400 sends the write data to the storage device 40. After the storage device 40 receives the request for writing data, the processor 41 of the storage device 40 executes the writing method provided by the embodiment of the present invention in response to the request for writing the data. The processor 41 is configured to:

Receiving a plurality of data blocks and writing to the memory;

Modifying the plurality of data blocks in the memory;

Modifying index data directed to the at least two data blocks.

Optionally, the processor 41 is further configured to:

Optionally, the processor 41 is specifically configured to:

The various changes and specific examples in the data writing method in the foregoing embodiments of FIG. 1 to FIG. 3 are also applicable to the storage device of the embodiment. The foregoing detailed description of the data writing method can be clearly understood by those skilled in the art. The implementation method of the storage device in this embodiment is known, so for the sake of brevity of the description, it will not be described in detail herein.

In the embodiment of the present invention, a plurality of data blocks are first modified in a memory, and then at least two data blocks having the same index data are determined from the modified plurality of data blocks, and then at least two data blocks are written to the storage medium. Finally, the index data pointing to at least two data blocks is modified.

Compared with the prior art, each time the modified data block is written from the memory to the storage medium, it must be repaired. In the embodiment of the present invention, at least two data blocks with the same index data are determined from the modified data block, and at least two data blocks with the same index data are written from the memory. After the storage medium is added, the index data common to the at least two data blocks is batch-updated, so that the number of times the index data is updated is reduced, and the write overhead caused by the modified data block to the storage device is reduced.

Those skilled in the art will appreciate that embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.

The present invention has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (system), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or FIG. These computer program instructions can be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing device to produce a machine for the execution of instructions for execution by a processor of a computer or other programmable data processing device. Means for implementing the functions specified in one or more of the flow or in a block or blocks of the flow chart.

The computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device. The apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.

These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Obviously, those skilled in the art can make various modifications and variations to the present invention without departing from the present invention. The spirit and scope of the Ming. Thus, it is intended that the present invention cover the modifications and modifications of the invention

Claims

A data writing method, the method being applied to a storage device, the storage device comprising a processor, a memory and a storage medium, the data blocks in the storage medium being organized in a tree structure, and a leaf node of the tree is used Saving a data block, the parent node and the root node of the tree are used to store index data, the index data is used to index the data block, and the method is performed by the processor, including:

Receiving a plurality of data blocks and writing to the memory;

Modifying the plurality of data blocks in the memory;

Determining at least two data blocks from the modified plurality of data blocks, the index data of the at least two data blocks being the same;

Allocating a storage address in the storage medium for the at least two data blocks, and writing the at least two data blocks to the storage medium according to the allocated storage address;

Modifying index data directed to the at least two data blocks.
The method of claim 1, wherein before the modifying points to the index data of the at least two data blocks, the method further comprises:

The at least two data blocks are deleted from the memory.
The method of claim 1, wherein the modifying the index data directed to the at least two data blocks comprises:

Creating a record table for the at least two data blocks, and recording a storage address of the at least two data blocks in the storage medium;

Determining index data pointing to the at least two data blocks in the memory according to the record table, where the modified index data of the at least two data blocks points to a storage address of the at least two data blocks;

Indexing the modified index data of the at least two data blocks to the storage medium.
A storage device includes a processor, a memory, and a storage medium, the data blocks in the storage medium are organized in a tree structure, the leaf nodes of the tree are used to save data blocks, the parent node of the tree and The root node is configured to store index data, and the index data is used to index the data block, The processor is used to:

Receiving a plurality of data blocks and writing to the memory;

Modifying the plurality of data blocks in the memory;

Determining at least two data blocks from the modified plurality of data blocks, the index data of the at least two data blocks being the same;

Allocating a storage address in the storage medium for the at least two data blocks, and writing the at least two data blocks to the storage medium according to the allocated storage address;

Modifying index data directed to the at least two data blocks.
The storage device of claim 4, wherein the processor is further configured to:

The at least two data blocks are deleted from the memory before the modification points to the index data of the at least two data blocks.
The storage device of claim 4, wherein the processor is specifically configured to:

Creating a record table for the at least two data blocks, and recording a storage address of the at least two data blocks in the storage medium;

Determining index data pointing to the at least two data blocks in the memory according to the record table, where the modified index data points to a storage address of the at least two data blocks;

Indexing the modified index data of the at least two data blocks to the storage medium.