Information processing method and apparatus

Abstract

Embodiments of the present specification provide an information processing method and device, wherein the information processing method comprises: obtaining erasure code stripe information corresponding to an erasure code file, and writing the erasure code stripe information into a stripe information record table; in the case of detecting an operation request associated with the erasure code file, reading the erasure code stripe information in the stripe information record table; determining data address information of a target data node corresponding to the erasure code file according to the erasure code stripe information; creating operation description information according to the operation request and the data address information, and sending to the target data node.

Description

Technical Field

[0001] The embodiments in this specification relate to the field of data storage technology, and in particular to information processing methods and apparatus. Background Technology

[0002] With the development of internet technology, distributed storage systems are now widely used to achieve reliable massive data storage. Distributed file systems, as a highly available and reliable distributed storage system, are effectively applied in scenarios such as object storage, file storage, table storage, and block storage. However, as underlying distributed file systems increasingly support append-only storage media such as ZNS-SSD, the single-machine storage layer of distributed file systems also adopts a key-value (KV) storage structure. Data deletion, modification, and updates are implemented using append-only log writing, relying on background garbage collection (GC) to truly release the physical space of overwritten or deleted data. In this process, the intermediate KV-type storage engine layer and the underlying distributed file system layer each need to perform GC independently, resulting in a lack of coordination between them. This leads to greater IO amplification, increased garbage data, and impacts overall system performance. This performance impact is particularly severe in erasure coding scenarios, thus requiring an effective solution to address these issues. Summary of the Invention

[0003] In view of the above, embodiments of this specification provide an information processing method. One or more embodiments of this specification also relate to an information processing apparatus, an information processing system, a computing device, a computer-readable storage medium, and a computer program, to address the technical deficiencies existing in the prior art.

[0004] According to a first aspect of the embodiments of this specification, an information processing method is provided, comprising:

[0005] Obtain the erasure code stripe information corresponding to the erasure code file, and write the erasure code stripe information into the stripe information record table;

[0006] Upon detecting an operation request associated with the erasure code file, the erasure code stripe information is read from the stripe information record table;

[0007] Based on the erasure coding stripe information, determine the data address information of the target data node corresponding to the erasure coding file;

[0008] An operation description is created based on the operation request and the data address information, and then sent to the target data node.

[0009] According to a second aspect of the embodiments of this specification, an information processing apparatus is provided, comprising:

[0010] The acquisition module is configured to acquire erasure code stripe information corresponding to the erasure code file and write the erasure code stripe information into a stripe information record table.

[0011] The reading module is configured to read the erasure code stripe information from the stripe information record table when an operation request associated with the erasure code file is detected.

[0012] The determination module is configured to determine the data address information of the target data node corresponding to the erasure coding file based on the erasure coding stripe information;

[0013] The creation module is configured to create operation description information based on the operation request and the data address information, and send it to the target data node.

[0014] According to a third aspect of the embodiments of this specification, an information processing system is provided, comprising:

[0015] The server is used to obtain erasure coding stripe information corresponding to the erasure coding file and write the erasure coding stripe information into a stripe information record table; when an operation request associated with the erasure coding file is detected, the server reads the erasure coding stripe information from the stripe information record table; based on the erasure coding stripe information, the server determines the data address information of the target data node corresponding to the erasure coding file; based on the operation request and the data address information, the server creates operation description information and sends it to the target data node.

[0016] The target data node is used to receive the operation description information and determine the physical address information according to the operation description information; and to mark the data range to be operated corresponding to the physical address information.

[0017] According to a fourth aspect of the embodiments of this specification, a computing device is provided, comprising:

[0018] Memory and processor;

[0019] The memory is used to store computer-executable instructions, and the processor is used to implement the steps of any of the above-described information processing methods when executing the computer-executable instructions.

[0020] According to a fifth aspect of the embodiments of this specification, a computer-readable storage medium is provided that stores computer-executable instructions, which, when executed by a processor, implement the steps of the information processing method described above.

[0021] According to a sixth aspect of the embodiments of this specification, a computer program is provided, wherein when the computer program is executed in a computer, it causes the computer to perform the steps of the above-described information processing method.

[0022] The information processing method provided in this manual, in order to support the release of garbage data and space reclamation of erasure coding files in a distributed file system, can write the erasure coding stripe information into a stripe information record table after obtaining the erasure coding stripe information corresponding to the erasure coding file. This achieves persistence of the erasure coding stripe information. When an operation request associated with an erasure coding file is detected, it indicates that the data associated with the erasure coding file needs to be deleted. In order to save distributed file system operations and achieve the purpose of data deletion and space reclamation, the erasure coding stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure coding file. Finally, an operation description information is created based on the operation request and data address information and sent to the target data node, so that the target data node can accurately mark the data range to be operated on in its local storage space according to the operation description information. This realizes the Trim of data associated with erasure coding files in the erasure coding scenario, thereby improving the overall performance of the distributed file system, reducing garbage data, and achieving the goal of reducing storage costs. Attached Figure Description

[0023] Figure 1 This is a schematic diagram of the structure of an information processing method provided in one embodiment of this specification;

[0024] Figure 2 This is a flowchart illustrating an information processing method provided in one embodiment of this specification;

[0025] Figure 3 This is a schematic diagram of erasure code stripes in an information processing method provided in one embodiment of this specification;

[0026] Figure 4 This is a flowchart illustrating the processing procedure of an information processing method provided in one embodiment of this specification.

[0027] Figure 5 This is a schematic diagram of the structure of an information processing device provided in one embodiment of this specification;

[0028] Figure 6 This is a schematic diagram of the structure of an information processing system provided in one embodiment of this specification;

[0029] Figure 7 This is a structural block diagram of a computing device provided in one embodiment of this specification. Detailed Implementation

[0030] Many specific details are set forth in the following description to provide a full understanding of this specification. However, this specification can be implemented in many other ways than those described herein, and those skilled in the art can make similar extensions without departing from the spirit of this specification. Therefore, this specification is not limited to the specific implementations disclosed below.

[0031] The terminology used in one or more embodiments of this specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the one or more embodiments of this specification. The singular forms “a,” “described,” and “the” as used in one or more embodiments of this specification and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in one or more embodiments of this specification refers to and includes any or all possible combinations of one or more associated listed items.

[0032] It should be understood that although the terms first, second, etc., may be used to describe various information in one or more embodiments of this specification, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from one another. For example, first may also be referred to as second without departing from the scope of one or more embodiments of this specification, and similarly, second may also be referred to as first. Depending on the context, the word "if" as used herein may be interpreted as "when," "when," or "in response to a determination."

[0033] First, the terms and concepts used in one or more embodiments of this specification will be explained.

[0034] Erasure coding (EC) is a data protection method that segments data into fragments, expands and encodes redundant data blocks, and stores them in different locations, such as disks, storage nodes, or other geographical locations, to achieve the purpose of data protection.

[0035] ZNS-SSD (Zoned Namespace) - (Solid State Disk) is developed based on SSD. It realizes the migration of FTL (Flash Translation Layer) from inside the SSD to the upper host layer, opening up the inside of the SSD to the host, so that users can flexibly have their own specific FTL according to their needs.

[0036] Append-only: This is a property of computer data storage that allows new data to be appended to the storage, but existing data remains immutable. It only supports append-only writes and does not support random modification writes.

[0037] File: A contiguous block of stored data, uniquely identified by its filename or file ID. Each file consists of one or more chunks.

[0038] Chunk: A Chunk is a continuous range of data stored in a file. Each Chunk can be a multi-copy Chunk or an erasure-coded Chunk.

[0039] Replica: A replica is a contiguous block of data stored in a chunk on a single-machine storage engine. Each replica of a multi-replica chunk is identical; an erasure coding chunk stores data shards that satisfy erasure coding slicing and arrangement rules, and each shard contains different data.

[0040] GC (Garbage Collection) is a background task in the KV storage engine that releases physical space by rewriting files of overwritten or deleted data.

[0041] This specification provides an information processing method, and also relates to an information processing apparatus, a computing device, an information processing system, a computer-readable storage medium, and a computer program, which will be described in detail in the following embodiments.

[0042] See Figure 1 The diagram illustrates how, to support garbage data release and space reclamation for erasure-coded files in a distributed file system, the erasure-coded stripe information is obtained and written to a stripe information record table. This ensures the persistence of the erasure-coded stripe information. When an operation request associated with an erasure-coded file is detected, it indicates that data associated with the file needs to be deleted. To save distributed file system operations while achieving data deletion and space reclamation, the erasure-coded stripe information is read from the stripe information record table. Based on this information, the data address information of the target data node corresponding to the erasure-coded file is determined. Finally, an operation description is created based on the operation request and data address information and sent to the target data node. This allows the target data node to accurately mark the data range to be operated on in its local storage space based on the operation description. This implements Trim on data associated with erasure-coded files in an erasure-coded scenario, improving the overall performance of the distributed file system, reducing garbage data, and ultimately lowering storage costs.

[0043] Figure 2 A flowchart of an information processing method according to an embodiment of this specification is shown, which specifically includes the following steps.

[0044] Step S202: Obtain the erasure code stripe information corresponding to the erasure code file, and write the erasure code stripe information into the stripe information record table.

[0045] In practical applications, in distributed file systems, erasure coding can be categorized from a stripe perspective into fixed-striped erasure coding (fixed-striped EC) and non-fixed-striped erasure coding (non-fixed-striped EC); see also Figure 3 In the diagram, (a) represents a fixed-strip EC, and (b) represents a non-fixed-strip EC. Fixed-strip ECs require erasure coding of data blocks of a fixed size, equal to the size of the encoded data block corresponding to the erasure coding configuration. Erasure coding includes, but is not limited to, RS (reed-solomon), LRC (Locally Repairable Codes), or Regenerating Code. Non-fixed-strip ECs support erasure coding of data blocks of varying sizes. For cases where the size is not equal to the encoded data block size corresponding to the erasure coding configuration, data padding is required to ensure alignment. For example, a stripe (composed of…) Figure 3 In (b), D5, D6, D7, D8, P3 and P4 form 8M. Only 7M is written above, so 1M of padding data is needed to fill it. That is, 1M of padding data is used in D8 to fill it to achieve alignment. After filling, the correspondence between the logical address and the physical address data offset needs to be recorded.

[0046] Based on this, in erasure coding scenarios, because user data stored on each data node in a distributed file system is distributed across multiple replicas of an erasure coding chunk after erasure coding data fragmentation and arrangement, the user data and erasure coding stripes cannot be aligned. Therefore, it is impossible to directly perform a trim operation on the user data on each data node in the distributed file system, resulting in the need to consume more computing resources to complete the trim operation on user data, which affects the overall performance of the distributed file system.

[0047] Therefore, to support the release of garbage data and space reclamation of erasure-coded files in a distributed file system, the erasure-coded stripe information can be obtained and written to a stripe information record table to achieve persistence of the erasure-coded stripe information. When an operation request associated with an erasure-coded file is detected, it indicates that data associated with the erasure-coded file needs to be deleted. To save operations in the distributed file system and achieve the goals of data deletion and space reclamation, the erasure-coded stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure-coded file. Finally, an operation description information is created based on the operation request and data address information and sent to the target data node, so that the target data node can accurately mark the data range to be operated on in its local storage space according to the operation description information. This enables Trim of data associated with erasure-coded files in an erasure-coded scenario, thereby improving the overall performance of the distributed file system, reducing garbage data, and reducing storage costs.

[0048] Specifically, an erasure coding file refers to a file composed of user data after data fragmentation and arrangement in an erasure coding scenario, where the fragmented and arranged user data is stored on different data nodes in a distributed file system. Correspondingly, an erasure coding stripe refers to a stripe obtained by dividing an erasure coding file into segments of a fixed length. Furthermore, erasure coding stripe information refers to the attribute information of the erasure coding stripe relative to the erasure coding file, used to clarify the offset and actual size of the stripe relative to the file. It should be noted that an erasure coding file corresponds to an erasure coding stripe group, and an erasure coding stripe group consists of at least one erasure coding stripe. An erasure coding stripe needs to be stored on multiple data nodes, each storing a portion of the stripe's data; the combined data constitutes the entire erasure coding stripe. Correspondingly, the stripe information record table specifically refers to the record table that persistently stores the erasure code stripe information corresponding to each erasure code stripe associated with the erasure code file. When a Trim operation is required for a certain erasure code stripe, the mapping relationship between logical address and physical address can be determined by reading the table. This enables the Trim operation of erasure code stripes to be completed on each data node, thereby reducing the consumption of computing resources in the distributed file system and improving the overall performance of the system.

[0049] Therefore, in order to achieve data deletion and space reclamation without affecting the performance of the distributed file system when performing Trim on user data, the erasure code stripe information corresponding to the erasure code file can be obtained first during the data fragment storage stage. The erasure code stripe information can be written into the stripe information record table to achieve persistence of the erasure code stripe information through the stripe information record table, so that the stripe information record table can be directly read from the stripe information record table for subsequent data Trim operations.

[0050] Furthermore, when obtaining the erasure coding stripe information corresponding to the erasure coding file, since the user data involved in the erasure coding file needs to be written to different data nodes of the distributed file system, the information table interface provided by the distributed file system can be used to obtain the erasure coding stripe information of the erasure coding file. In this embodiment, the specific implementation method is as follows:

[0051] Based on the information table interface of the distributed file system, the stripe location information and stripe attribute information corresponding to the erasure coding file are determined; the erasure coding stripe information is determined according to the stripe location information and the stripe attribute information.

[0052] Specifically, the information table interface of the distributed file system refers to the interface for setting and retrieving erasure coding stripe information. When an erasure coding file is segmented into erasure coding stripes, this interface allows the determination of the erasure coding stripe information. The erasure coding stripe information determined by the information table interface is related to the position and attributes of the erasure coding stripe relative to the erasure coding file. Correspondingly, the stripe position information refers to the offset of the erasure coding stripe relative to the erasure coding file, and the stripe attribute information refers to the actual size of the erasure coding file relative to the erasure coding file, excluding the size of the padding data.

[0053] Based on this, the distributed file system provides an information table interface. When an erasure coding file is split into multiple erasure coding stripes by the distributed file system, the stripe location information and stripe attribute information corresponding to the erasure coding stripes in the erasure coding file can be determined through the information table interface of the distributed file system. The erasure coding stripe information can then be determined by the stripe location information and the stripe attribute information, and then written into the stripe information record table corresponding to the erasure coding file, which can be used for subsequent data trim operations.

[0054] In practical implementation, the distributed file system can provide a Range Table interface to obtain information about the erasure code stripe boundaries of erasure-coded files. The erasure code stripe boundaries are the erasure code stripe information. Each entry in the Range Table corresponds to an erasure code stripe. Each stripe has its offset relative to the file and its actual size, i.e., the logical address information corresponding to the stripe. The table also records the mapping relationship between logical and physical addresses, i.e., the address of the data involved in each erasure code stripe within the data block of each data node. This mapping relationship is used to determine the physical address of the data range to be operated on at the data node during subsequent Trim operations. The data range to be operated on is the data range to be deleted.

[0055] In summary, by providing an information table interface through the distributed file system, the erasure code information of each stripe can be persistently recorded when erasure code stripes are generated. This allows for subsequent Trim operations to be performed by combining the stripe information record table, thereby effectively improving the performance of the distributed file system.

[0056] Step S204: If an operation request associated with the erasure code file is detected, the erasure code stripe information is read from the stripe information record table.

[0057] Specifically, based on the above-mentioned addition of erasure code stripe information corresponding to each erasure code stripe to the stripe information record table, if an operation request associated with the erasure code file is detected, it indicates that the user data involved in the erasure code file needs to be trimmed at the current stage. In this process, in order not to affect the performance of the distributed file system and to enable the KV storage engine to work collaboratively with the distributed file system, the erasure code stripe information associated with the erasure code file can be read from the stripe information record table first. This information can then be used to determine the stripe to which the data to be trimmed belongs, so that the KV storage engine can perform trimming according to the erasure code stripe information in the stripe information record table, and the distributed file system can prompt the data nodes to process the data.

[0058] Specifically, an operation request refers to a request that performs a Trim operation on the user data involved in the erasure coding file. This request can come from the server or the user.

[0059] Furthermore, when reading erasure coding stripe information, since the erasure coding file corresponds to at least one erasure coding stripe, the Trim operation will also be performed at the stripe granularity. That is, after receiving the operation request, it is necessary to determine the address mapping relationship corresponding to the target erasure coding stripe based on the erasure coding stripe information. In this embodiment, the specific implementation method is as follows:

[0060] The system receives an operation request for a target erasure code stripe corresponding to the erasure code file; reads the erasure code stripe information from the stripe information record table according to the operation request; and determines the address mapping relationship corresponding to the target erasure code stripe in the erasure code stripe information so that the data address information can be determined subsequently based on the address mapping relationship.

[0061] Specifically, the target erasure code stripe refers to the erasure code stripe to which the data in the erasure code file that needs to be trimmed belongs; correspondingly, the address mapping relationship refers to the mapping relationship between the logical address and physical address of the target erasure code stripe, which can determine the physical address of the data that needs to be trimmed in each data node of the erasure code stripe. Furthermore, the logical address is expressed as an offset and a length, and similarly, the physical address is also expressed as an offset and a length.

[0062] Based on this, when an operation request is received for the target erasure code stripe corresponding to the erasure code file, it indicates that a Trim operation needs to be performed on the data associated with the target erasure code stripe. At this time, according to the operation request, the erasure code stripe information of the associated erasure code file can be read from the stripe information record table first, and then the address mapping relationship corresponding to the target erasure code stripe can be determined from the erasure code stripe information. This allows the physical address corresponding to the data range to be operated to be converted according to the mapping relationship.

[0063] In practice, after detecting an operation request submitted for the target erasure coding file, the KV storage engine can first read the Range Table according to the operation request, and then determine the Range boundary associated with the target erasure coding file in the Range Table based on the reading result, that is, the erasure coding stripe information corresponding to the target erasure coding stripe, and then perform Trim according to the erasure coding stripe information.

[0064] In summary, by determining the erasure code stripe information corresponding to the target erasure code stripe through the stripe information record table, subsequent Trim operations can be performed directly based on the erasure code stripe information, thereby completing the Trim operation with less computing resources and improving the performance of the distributed file system.

[0065] Furthermore, considering that the data contained in the target erasure code stripe may be partially useful and partially useless, it is not possible to directly perform Trim on the target erasure code stripe in this scenario. Therefore, in order to support Trim operations for different scenarios, it can be accomplished through a judgment method. In this embodiment, the specific implementation method is as follows:

[0066] Determine whether the target erasure code stripe contains redundant data; if not, execute the step of reading the erasure code stripe information from the stripe information record table according to the operation request; if yes, update the preset index record table according to the operation request, and if the information recorded in the index record table meets the operation execution conditions, read the erasure code stripe information from the stripe information record table according to the index record table.

[0067] Specifically, redundant data refers to useful data; correspondingly, the index record table is a record table used to record logical addresses. It records information corresponding to the Trim operation on the target erasure code stripe containing redundant data. When the recorded information meets certain conditions, the entire target erasure code stripe will be directly Trimed based on the information recorded in the index record table. In other words, the index record table is used to cumulatively record information on Trim operations performed on data within the target erasure code stripe. The operation execution condition specifically refers to a cumulative data volume condition; that is, when the amount of data involved in the operation request information recorded in the index record table exceeds the target erasure code stripe, subsequent processing can proceed according to the index record table.

[0068] Based on this, see Figure 3 In (c) and (d), after determining the target erasure coding file, if trimming is performed on the entire EC stripe, it is not necessary to determine whether the stripe contains redundant data; simply trim all data involved in the entire stripe. However, if trimming is performed on a portion of the data within the EC stripe, it is necessary to first determine whether the target erasure coding stripe contains redundant data. If it does, it means that the target erasure coding stripe contains some useful data and some useless data. In this case, trimming the target erasure coding stripe is not possible, so the operation request should be recorded first. See also... Figure 3 As shown in (d), when trimming is required for R1, R2-1, R2-2, and R2-3 in a stripe, but R3-1, R3-2, P1, and P2 cannot be trimmed, the preset index record table can be updated according to the operation request until the information recorded in the index record table meets the operation execution conditions. This indicates that the accumulated data volume exceeds the target erasure coding stripe. Therefore, the erasure coding stripe information can be read from the stripe information record table according to the index record table, and then the subsequent trimming operation can be performed. If it does not contain any data, it means that all data in the target erasure coding file can be trimmed, so the subsequent trimming operation can be performed directly.

[0069] In practice, the reason why trimming fails is because the target erasure code stripe contains both useful and useless data. The KV storage engine has an index record table that records the position of K->KV in the file. Deleting K marks this position as invalid in the index record table, but the actual data in the data node cannot be deleted. Only when the data of the deleted K is greater than or equal to the size of the target erasure code stripe can the entire target erasure code stripe be trimmed together.

[0070] In summary, by determining redundant data and applying different trimming methods, we can ensure that different trimming operations are performed on the target erasure code stripe in different scenarios, thereby guaranteeing the success of the trimming operation and improving the performance of the distributed file system.

[0071] Based on this, if the target erasure code stripe contains both useless and useful data, the reading of the erasure code stripe information according to the index record table is actually completed when the amount of data accumulated exceeds the target erasure code stripe. In this embodiment, the specific implementation method is as follows:

[0072] Based on the operation request, target operation record information corresponding to the target erasure code stripe is generated, and the target operation record information is added to the index record table; if the operation record information recorded in the index record table meets the operation execution conditions, at least two operation record information related to the target erasure code stripe are read from the index record table; based on the at least two operation record information, the erasure code stripe information is read from the stripe information record table.

[0073] Specifically, the target operation record information refers to the information corresponding to the Trim operation on a portion of the data in the target erasure code stripe.

[0074] Based on this, if it is determined that the target erasure code stripe contains redundant data, it indicates that the received operation request is for a trim operation on a portion of the data in the target erasure code stripe. Therefore, the target operation record information corresponding to the target erasure code stripe can be generated first based on the operation request, and then written into the index record table. This process continues until all data in the target erasure code stripe has recorded the corresponding trim operation record information. Once it is determined that the operation record information recorded in the index record table meets the operation execution conditions, at least two operation record information related to the target erasure code stripe can be read from the index record table; then, based on these at least two operation record information, the erasure code stripe information can be read from the stripe information record table.

[0075] In practical applications, determining whether the index information record table meets the operation execution conditions is actually done by comparing the amount of data. In this embodiment, the specific implementation method is as follows:

[0076] Determine the global data volume associated with the operation record information recorded in the index record table; if the global data volume is greater than or equal to the stripe data volume corresponding to the target erasure code stripe, perform the step of reading at least two operation record information associated with the target erasure code stripe in the index record table.

[0077] Specifically, the global data volume refers to the cumulative data volume involved in the operation record information recorded in the index record table; correspondingly, the stripe data volume refers to the data volume corresponding to the target erasure code stripe.

[0078] Based on this, after updating the operation record information to the index record table, the global data volume associated with the operation record information in the index record table can be determined periodically until the accumulated data volume exceeds the data volume corresponding to the target erasure code stripe. This determines that a Trim operation can be performed on the target erasure code stripe, and thus the erasure code stripe information can be read again.

[0079] In practice, if the KV storage engine cannot perform the Trim operation according to the Range boundary in the Range Table, i.e., the erasure code stripe information corresponding to the target erasure code stripe, it means that the target erasure code stripe contains some useful data and some useless data. Therefore, in order to ensure that the Trim operation can be performed normally, the Trim information can be recorded first until the amount of data involved in the recorded Trim information exceeds the target erasure code stripe, and then the subsequent Trim operation can be performed according to the erasure code stripe information.

[0080] In summary, by using a cumulative approach to retain target operation record information, all operation requests can be recorded. When the accumulated data exceeds the target erasure code stripe, subsequent Trim operations can be performed, thus achieving the goal of completing the Trim operation with fewer computing resources.

[0081] Step S206: Determine the data address information of the target data node corresponding to the erasure coding file based on the erasure coding stripe information.

[0082] Specifically, after reading the erasure coding stripe information from the stripe information record table, further, since the user data involved in the target erasure coding stripe is stored on different data nodes of the distributed file system, the target data node can be determined first, and then the data address information of the target data node corresponding to the erasure coding file can be determined according to the erasure coding stripe information, that is, the different data address information corresponding to different data nodes can be determined, so as to enable different operation description information to be sent for different target data nodes.

[0083] Furthermore, after determining the address mapping relationship corresponding to the target erasure code stripe from the erasure code stripe information, the data address information of the target data node corresponding to the target erasure code stripe can then be determined based on the address mapping relationship. This facilitates the Trim operation on the target data node.

[0084] Furthermore, when determining the data address information, the physical address corresponding to the target erasure code stripe is actually determined based on the mapping relationship between logical addresses and physical addresses. In this embodiment, the specific implementation method is as follows:

[0085] The data node in the distributed file system associated with the target erasure coding stripe is taken as the target data node; the physical address information of the target erasure coding stripe corresponding to the target data node is determined according to the address mapping relationship, and is taken as the data address information of the target data node corresponding to the target erasure coding stripe; wherein, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure coding stripe.

[0086] Specifically, the target data node refers to the data node in the distributed file system that stores the data involved in the target erasure coding stripe. Correspondingly, the physical address information refers to the physical address at the data block level within the data node where the user data is stored, and its structure consists of offset and length. In other words, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure coding stripe.

[0087] Based on this, firstly, the data node associated with the target erasure code stripe in the distributed file system is taken as the target data node; secondly, the physical address information of the target data node corresponding to the target erasure code stripe is determined according to the address mapping relationship, and is taken as the data address information of the target data node corresponding to the target erasure code stripe; wherein, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure code stripe.

[0088] In practical implementation, when the KV storage engine performs Trim according to the Range boundaries in the Range Table, it can directly convert the logical address to the physical address. This means directly converting the data range to be operated on in the corresponding Replica, thus clearly defining the physical address of the data to be Trimed in the target data node. For example, if the logical addresses of the data involved in the target erasure coding stripe are <0,0><1MB,1MB+4KB><2MB,2MB+8KB>, when it is necessary to delete data with a logical offset of 1MB and a length of 1MB, the corresponding physical address of the target data node can be converted according to the mapping relationship. That is, the physical location is: offset = 1MB+4KB, length = 1MB+4KB; this facilitates subsequent Trim operations on the target data node based on this physical address.

[0089] In summary, by using the mapping relationship between logical addresses and physical addresses to determine the data address information, the Trim of the target erasure code stripe can be completed at the KV storage engine layer. Subsequently, by sending it to the target data node, the Trim at the distributed file system layer can be completed. This allows the two systems to complete the Trim operation, thereby effectively improving the performance of the distributed file system.

[0090] Step S208: Create operation description information based on the operation request and the data address information, and send it to the target data node.

[0091] Specifically, after obtaining the data address information, further considering that each target data node needs to perform a Trim operation in conjunction with different operation description information, after obtaining the data address information of the corresponding target data node, operation description information can be created based on the operation request and data address information. The offset and length of the data range to be operated on by the target data node need to be clarified through the operation description information, so that the target data node can determine the data range to be operated on in the local storage space and mark the data range to be operated on according to the operation description information.

[0092] Furthermore, considering that the target erasure code stripe also corresponds to a fixed stripe erasure code, when performing the Trim operation in this scenario, the stripe information record table can be omitted, and the operation can be completed directly according to the erasure code configuration parameters. In this embodiment, the specific implementation method is as follows:

[0093] If the erasure coding stripe corresponding to the erasure coding file has a fixed stripe length, determine the erasure coding configuration parameters corresponding to the erasure coding file; determine the base data address information of the target data node corresponding to the erasure coding stripe based on the erasure coding configuration parameters; create base operation description information based on the operation request and the base data address information, and send it to the target data node.

[0094] Specifically, erasure coding configuration parameters refer to the parameters corresponding to the erasure coding stripes in the erasure coding file. The granularity of data deletion supported can be determined through the erasure coding configuration parameters. Correspondingly, the baseline data address information refers to the physical address information corresponding to the target data node of the erasure coding stripe.

[0095] Based on this, since the erasure coding stripe has a fixed stripe length, it means that the length of the erasure coding stripe is fixed. Therefore, when performing a Trim operation, the erasure coding configuration parameters corresponding to the erasure coding file can be determined first. Secondly, based on the erasure coding configuration parameters, the baseline data address information of the target data node corresponding to the erasure coding stripe can be determined. Finally, baseline operation description information can be created based on the operation request and the baseline data address information and sent to the target data node. The target data node then determines the data range to be operated on in its local storage space and marks the data range to be operated on according to the baseline operation description information.

[0096] In practice, since the length of the fixed stripe is fixed, the granularity of data deletion that can be supported can be determined based on the erasure coding configuration parameters. For example, assuming the EC stripe is 1MB, only 0-1MB and 1MB-2MB can be deleted; while 0.5MB-1.5MB cannot be directly deleted.

[0097] The information processing method provided in this manual, in order to support the release of garbage data and space reclamation of erasure coding files in a distributed file system, can write the erasure coding stripe information into a stripe information record table after obtaining the erasure coding stripe information corresponding to the erasure coding file. This achieves persistence of the erasure coding stripe information. When an operation request associated with an erasure coding file is detected, it indicates that the data associated with the erasure coding file needs to be deleted. In order to save distributed file system operations and achieve the purpose of data deletion and space reclamation, the erasure coding stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure coding file. Finally, an operation description information is created based on the operation request and data address information and sent to the target data node, so that the target data node can accurately mark the data range to be operated on in its local storage space according to the operation description information. This realizes the Trim of data associated with erasure coding files in the erasure coding scenario, thereby improving the overall performance of the distributed file system, reducing garbage data, and achieving the goal of reducing storage costs.

[0098] The following is in conjunction with the appendix Figure 4 Taking the application of the information processing method provided in this specification in erasure coding scenarios as an example, the information processing method will be further explained. Figure 4 A flowchart illustrating the processing steps of an information processing method provided in one embodiment of this specification is shown, specifically including the following steps.

[0099] Step S402: Based on the information table interface of the distributed file system, determine the stripe location information and stripe attribute information corresponding to the erasure coding file.

[0100] Step S404: Determine the erasure code stripe information based on the stripe position information and stripe attribute information, and write the erasure code stripe information into the stripe information record table.

[0101] Step S406: Upon receiving an operation request for the target erasure code stripe corresponding to the erasure code file, if the target erasure code stripe does not contain redundant data, proceed to step S408; if the target erasure code stripe contains redundant data, proceed to step S410.

[0102] Step S408: Read erasure code stripe information from the stripe information record table according to the operation request.

[0103] Step S410: Update the preset index record table according to the operation request, and determine the global data volume associated with the operation record information recorded in the index record table.

[0104] Step S412: If the total amount of data exceeds the amount of data in the stripe corresponding to the target erasure code stripe, read at least two operation record information related to the target erasure code stripe from the index record table.

[0105] Step S414: Read erasure code stripe information from the stripe information record table based on at least two operation record information.

[0106] Step S416: Determine the address mapping relationship corresponding to the target erasure code stripe in the erasure code stripe information.

[0107] Step S418: Use the data node in the distributed file system that is associated with the target erasure code stripe as the target data node.

[0108] Step S420: Determine the physical address information of the target data node corresponding to the target erasure code stripe according to the address mapping relationship, and use it as the data address information of the target data node corresponding to the target erasure code stripe; wherein, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure code stripe.

[0109] Step S422: Create operation description information based on the operation request and data address information, and send it to the target data node.

[0110] In summary, to support garbage data release and space reclamation for erasure-coded files in a distributed file system, the erasure-coded stripe information can be obtained and written to a stripe information record table to achieve persistence of the erasure-coded stripe information. When an operation request associated with an erasure-coded file is detected, it indicates that data associated with the erasure-coded file needs to be deleted. To save operations in the distributed file system and achieve the goals of data deletion and space reclamation, the erasure-coded stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure-coded file. Finally, an operation description information is created based on the operation request and data address information and sent to the target data node, enabling the target data node to accurately mark the data range to be operated on in its local storage space based on the operation description information. This enables Trim of data associated with erasure-coded files in an erasure-coded scenario, improving the overall performance of the distributed file system, reducing garbage data, and ultimately reducing storage costs.

[0111] Corresponding to the above method embodiments, this specification also provides embodiments of an information processing apparatus. Figure 5 A schematic diagram of the structure of an information processing apparatus according to one embodiment of this specification is shown. Figure 5 As shown, the device includes:

[0112] The acquisition module 502 is configured to acquire erasure code stripe information corresponding to the erasure code file and write the erasure code stripe information into a stripe information record table.

[0113] The reading module 504 is configured to read the erasure code stripe information from the stripe information record table when an operation request associated with the erasure code file is detected.

[0114] The determination module 506 is configured to determine the data address information of the target data node corresponding to the erasure coding file based on the erasure coding stripe information;

[0115] The creation module 508 is configured to create operation description information based on the operation request and the data address information, and send it to the target data node.

[0116] In an optional embodiment, the acquisition module 502 is further configured to:

[0117] Based on the information table interface of the distributed file system, the stripe location information and stripe attribute information corresponding to the erasure coding file are determined; the erasure coding stripe information is determined according to the stripe location information and the stripe attribute information.

[0118] In an optional embodiment, the reading module 504 is further configured to:

[0119] Receive the operation request submitted for the target erasure code stripe corresponding to the erasure code file; read the erasure code stripe information from the stripe information record table according to the operation request; determine the address mapping relationship corresponding to the target erasure code stripe from the erasure code stripe information;

[0120] Accordingly, the determining module 506 is further configured to:

[0121] Based on the address mapping relationship, the data address information of the target data node corresponding to the target erasure code stripe is determined.

[0122] In an optional embodiment, the determining module 506 is further configured to:

[0123] The data node in the distributed file system associated with the target erasure coding stripe is taken as the target data node; the physical address information of the target erasure coding stripe corresponding to the target data node is determined according to the address mapping relationship, and is taken as the data address information of the target data node corresponding to the target erasure coding stripe; wherein, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure coding stripe.

[0124] In an optional embodiment, the information processing apparatus further includes:

[0125] The judgment module is configured to determine whether the target erasure code stripe contains redundant data;

[0126] If not, run the reading module 504;

[0127] If so, the running recording module is configured to update a preset index record table according to the operation request, and if the information recorded in the index record table meets the operation execution conditions, read the erasure code stripe information from the stripe information record table according to the index record table.

[0128] In an optional embodiment, the recording module is further configured to:

[0129] Based on the operation request, target operation record information corresponding to the target erasure code stripe is generated, and the target operation record information is added to the index record table; if the operation record information recorded in the index record table meets the operation execution conditions, at least two operation record information related to the target erasure code stripe are read from the index record table; based on the at least two operation record information, the erasure code stripe information is read from the stripe information record table.

[0130] In an optional embodiment, the recording module is further configured to:

[0131] Determine the global data volume associated with the operation record information recorded in the index record table; if the global data volume is greater than or equal to the stripe data volume corresponding to the target erasure code stripe, perform the step of reading at least two operation record information associated with the target erasure code stripe in the index record table.

[0132] In an optional embodiment, the information processing apparatus further includes:

[0133] The parameter processing module is configured to, when the erasure coding stripe corresponding to the erasure coding file is of fixed stripe length, determine the erasure coding configuration parameters corresponding to the erasure coding file; determine the base data address information of the target data node corresponding to the erasure coding stripe based on the erasure coding configuration parameters; create base operation description information based on the operation request and the base data address information, and send it to the target data node.

[0134] The information processing device provided in this manual, in order to support the release of garbage data and space reclamation of erasure-coded files in a distributed file system, can write the erasure-coded stripe information into a stripe information record table after obtaining the erasure-coded stripe information corresponding to the erasure-coded file. This achieves persistence of the erasure-coded stripe information. When an operation request associated with an erasure-coded file is detected, it indicates that the data associated with the erasure-coded file needs to be deleted. To save operations in the distributed file system and achieve the purpose of data deletion and space reclamation, the erasure-coded stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure-coded file. Finally, operation description information is created based on the operation request and data address information and sent to the target data node, so that the target data node can accurately mark the data range to be operated on in its local storage space according to the operation description information. This realizes the Trim of data associated with erasure-coded files in the erasure-coded scenario, thereby improving the overall performance of the distributed file system, reducing garbage data, and achieving the goal of reducing storage costs.

[0135] The above is an illustrative scheme of an information processing device according to this embodiment. It should be noted that the technical solution of this information processing device and the technical solution of the information processing method described above belong to the same concept. For details not described in detail in the technical solution of the information processing device, please refer to the description of the technical solution of the information processing method described above.

[0136] Corresponding to the above method embodiments, this specification also provides information processing system embodiments. Figure 6 A schematic diagram of the structure of an information processing system according to one embodiment of this specification is shown. Figure 6 As shown, the information processing system 600 includes:

[0137] Server 610 is used to obtain erasure coding stripe information corresponding to the erasure coding file and write the erasure coding stripe information into a stripe information record table; when an operation request associated with the erasure coding file is detected, the erasure coding stripe information is read from the stripe information record table; based on the erasure coding stripe information, the data address information of the target data node corresponding to the erasure coding file is determined; operation description information is created based on the operation request and the data address information and sent to the target data node;

[0138] The target data node 620 is used to receive the operation description information and determine the physical address information according to the operation description information; and to mark the data range to be operated corresponding to the physical address information.

[0139] In an optional embodiment, the server 610 is further configured to:

[0140] Based on the information table interface of the distributed file system, the stripe location information and stripe attribute information corresponding to the erasure coding file are determined; the erasure coding stripe information is determined according to the stripe location information and the stripe attribute information.

[0141] In an optional embodiment, the server 610 is further configured to:

[0142] The system receives an operation request for a target erasure code stripe corresponding to the erasure code file; reads the erasure code stripe information from the stripe information record table according to the operation request; determines the address mapping relationship corresponding to the target erasure code stripe from the erasure code stripe information; and accordingly, determining the data address information of the target data node corresponding to the erasure code file based on the erasure code stripe information includes: determining the data address information of the target data node corresponding to the target erasure code stripe based on the address mapping relationship.

[0143] In an optional embodiment, the server 610 is further configured to:

[0144] The data node in the distributed file system associated with the target erasure coding stripe is taken as the target data node; the physical address information of the target erasure coding stripe corresponding to the target data node is determined according to the address mapping relationship, and is taken as the data address information of the target data node corresponding to the target erasure coding stripe; wherein, the physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure coding stripe.

[0145] In an optional embodiment, the server 610 is further configured to:

[0146] Determine whether the target erasure code stripe contains redundant data; if not, execute the step of reading the erasure code stripe information from the stripe information record table according to the operation request; if yes, update the preset index record table according to the operation request, and if the information recorded in the index record table meets the operation execution conditions, read the erasure code stripe information from the stripe information record table according to the index record table.

[0147] In an optional embodiment, the server 610 is further configured to:

[0148] Based on the operation request, target operation record information corresponding to the target erasure code stripe is generated, and the target operation record information is added to the index record table; if the operation record information recorded in the index record table meets the operation execution conditions, at least two operation record information related to the target erasure code stripe are read from the index record table; based on the at least two operation record information, the erasure code stripe information is read from the stripe information record table.

[0149] In an optional embodiment, the server 610 is further configured to:

[0150] Determine the global data volume associated with the operation record information recorded in the index record table; if the global data volume is greater than or equal to the stripe data volume corresponding to the target erasure code stripe, perform the step of reading at least two operation record information associated with the target erasure code stripe in the index record table.

[0151] In an optional embodiment, the server 610 is further configured to:

[0152] If the erasure coding stripe corresponding to the erasure coding file has a fixed stripe length, determine the erasure coding configuration parameters corresponding to the erasure coding file; determine the base data address information of the target data node corresponding to the erasure coding stripe based on the erasure coding configuration parameters; create base operation description information based on the operation request and the base data address information, and send it to the target data node.

[0153] In summary, to support garbage data release and space reclamation for erasure-coded files in a distributed file system, the erasure-coded stripe information can be obtained and written to a stripe information record table to achieve persistence of the erasure-coded stripe information. When an operation request associated with an erasure-coded file is detected, it indicates that data associated with the erasure-coded file needs to be deleted. To save operations in the distributed file system and achieve the goals of data deletion and space reclamation, the erasure-coded stripe information can be read from the stripe information record table to determine the data address information of the target data node corresponding to the erasure-coded file. Finally, an operation description information is created based on the operation request and data address information and sent to the target data node, enabling the target data node to accurately mark the data range to be operated on in its local storage space based on the operation description information. This enables Trim of data associated with erasure-coded files in an erasure-coded scenario, improving the overall performance of the distributed file system, reducing garbage data, and ultimately reducing storage costs.

[0154] The above is an illustrative scheme of an information processing system according to this embodiment. It should be noted that the technical solution of this information processing system and the technical solution of the information processing method described above belong to the same concept. For details not described in detail in the technical solution of the information processing system, please refer to the description of the technical solution of the information processing method described above.

[0155] Figure 7 A structural block diagram of a computing device 700 according to one embodiment of this specification is shown. The components of the computing device 700 include, but are not limited to, a memory 710 and a processor 720. The processor 720 is connected to the memory 710 via a bus 730, and a database 750 is used to store data.

[0156] The computing device 700 also includes an access device 740, which enables the computing device 700 to communicate via one or more networks 760. Examples of these networks include a Public Switched Telephone Network (PSTN), a Local Area Network (LAN), a Wide Area Network (WAN), a Personal Area Network (PAN), or a combination of communication networks such as the Internet. The access device 740 may include one or more of any type of wired or wireless network interface (e.g., a Network Interface Card (NIC)), such as an IEEE 802.11 Wireless Local Area Network (WLAN) interface, a Wi-MAX interface, an Ethernet interface, a Universal Serial Bus (USB) interface, a cellular network interface, a Bluetooth interface, a Near Field Communication (NFC) interface, and so on.

[0157] In one embodiment of this specification, the above-described components of the computing device 700 and Figure 7 Other components, not shown, can also be connected to each other, for example, via a bus. It should be understood that... Figure 7 The block diagram of the computing device shown is for illustrative purposes only and is not intended to limit the scope of this specification. Those skilled in the art can add or replace other components as needed.

[0158] The computing device 700 can be any type of stationary or mobile computing device, including mobile computers or mobile computing devices (e.g., tablet computers, personal digital assistants, laptop computers, notebook computers, netbooks, etc.), mobile phones (e.g., smartphones), wearable computing devices (e.g., smartwatches, smart glasses, etc.) or other types of mobile devices, or stationary computing devices such as desktop computers or PCs. The computing device 700 can also be a mobile or stationary server.

[0159] The processor 720 is configured to execute the following computer-executable instructions, which, when executed by the processor, implement the steps of the above-described information processing method.

[0160] The above is an illustrative scheme of a computing device according to this embodiment. It should be noted that the technical solution of this computing device and the technical solution of the information processing method described above belong to the same concept. For details not described in detail in the technical solution of the computing device, please refer to the description of the technical solution of the information processing method described above.

[0161] An embodiment of this specification also provides a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the above-described information processing method.

[0162] The above is an illustrative scheme of a computer-readable storage medium according to this embodiment. It should be noted that the technical solution of this storage medium and the technical solution of the information processing method described above belong to the same concept. For details not described in detail in the technical solution of the storage medium, please refer to the description of the technical solution of the information processing method described above.

[0163] An embodiment of this specification also provides a computer program, wherein when the computer program is executed in a computer, it causes the computer to perform the steps of the above-described information processing method.

[0164] The above is an illustrative example of a computer program according to this embodiment. It should be noted that the technical solution of this computer program and the technical solution of the information processing method described above belong to the same concept. Details not described in detail in the technical solution of the computer program can be found in the description of the technical solution of the information processing method described above.

[0165] The foregoing has described specific embodiments of this specification. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in a different order than that shown in the embodiments and may still achieve the desired result. Furthermore, the processes depicted in the drawings do not necessarily require the specific or sequential order shown to achieve the desired result. In some embodiments, multitasking and parallel processing are possible or may be advantageous.

[0166] The computer instructions include computer program code, which may be in the form of source code, object code, executable file, or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording media, USB flash drive, portable hard drive, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium may be appropriately added to or subtracted according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media may not include electrical carrier signals and telecommunication signals.

[0167] It should be noted that, for the sake of simplicity, the foregoing method embodiments are all described as a series of actions. However, those skilled in the art should understand that the embodiments in this specification are not limited to the described order of actions, because according to the embodiments in this specification, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in this specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to the embodiments in this specification.

[0168] In the above embodiments, the descriptions of each embodiment have different focuses. For parts not described in detail in a certain embodiment, please refer to the relevant descriptions of other embodiments.

[0169] The preferred embodiments disclosed above are merely illustrative of this specification. The optional embodiments do not exhaustively describe all details, nor do they limit the invention to the specific implementations described. Clearly, many modifications and variations can be made based on the embodiments described herein. These embodiments are selected and specifically described in this specification to better explain the principles and practical applications of the embodiments, thereby enabling those skilled in the art to better understand and utilize this specification. This specification is limited only by the claims and their full scope and equivalents.

Claims

1. An information processing method, comprising: Obtain erasure coding stripe information corresponding to the erasure coding file, and write the erasure coding stripe information into the stripe information record table, wherein the erasure coding stripe information is the offset and stripe size of the erasure coding stripe relative to the erasure coding file; Upon detecting an operation request associated with the erasure code file, the erasure code stripe information is read from the stripe information record table, wherein the operation request is an operation request for deletion; Based on the erasure coding stripe information, determine the data address information of the target data node corresponding to the erasure coding file; An operation description is created based on the operation request and the data address information and sent to the target data node, wherein the operation description is for deletion.

2. The method according to claim 1, wherein obtaining the erasure coding stripe information corresponding to the erasure coding file includes: Based on the information table interface of the distributed file system, determine the stripe location information and stripe attribute information corresponding to the erasure coding file; The erasure code stripe information is determined based on the stripe position information and the stripe attribute information.

3. The method according to claim 1 or 2, wherein reading the erasure code stripe information from the stripe information record table upon detecting an operation request associated with the erasure code file includes: Receive the operation request submitted for the target erasure code stripe corresponding to the erasure code file; According to the operation request, the erasure code stripe information is read from the stripe information record table; Determine the address mapping relationship corresponding to the target erasure code stripe in the erasure code stripe information; Accordingly, determining the data address information of the target data node corresponding to the erasure coding file based on the erasure coding barcode information includes: Based on the address mapping relationship, the data address information of the target data node corresponding to the target erasure code stripe is determined.

4. The method according to claim 3, wherein determining the data address information of the target data node corresponding to the target erasure code stripe based on the address mapping relationship includes: The data node in the distributed file system associated with the target erasure code stripe is taken as the target data node; The physical address information of the target data node corresponding to the target erasure code stripe is determined according to the address mapping relationship, and is used as the data address information of the target data node corresponding to the target erasure code stripe; The physical address information includes the data offset information and data length information of the target data node corresponding to the target erasure code stripe.

5. The method according to claim 3, further comprising, before the step of reading the erasure code stripe information from the stripe information record table according to the operation request: Determine whether the target erasure code stripe contains redundant data; If not, perform the step of reading the erasure code stripe information from the stripe information record table according to the operation request; If so, update the preset index record table according to the operation request, and if the information recorded in the index record table meets the operation execution conditions, read the erasure code stripe information from the stripe information record table according to the index record table.

6. The method according to claim 5, wherein updating the preset index record table according to the operation request, and reading the erasure code stripe information from the stripe information record table according to the index record table when the information recorded in the index record table satisfies the operation execution conditions, comprises: Based on the operation request, generate target operation record information corresponding to the target erasure code barcode, and add the target operation record information to the index record table; If the operation record information recorded in the index record table meets the operation execution conditions, at least two operation record information related to the target erasure code stripe are read from the index record table; Based on the at least two operation record information, the erasure code stripe information is read from the stripe information record table.

7. The method according to claim 6, wherein, when the operation record information recorded in the index record table meets the operation execution conditions, reading at least two operation record information associated with the target erasure code stripe from the index record table includes: Determine the global data volume associated with the operation record information recorded in the index record table; If the global data volume is greater than or equal to the stripe data volume corresponding to the target erasure code stripe, the step of reading at least two operation record information associated with the target erasure code stripe from the index record table is performed.

8. The method according to claim 1, further comprising: When the erasure coding stripe corresponding to the erasure coding file has a fixed stripe length, determine the erasure coding configuration parameters corresponding to the erasure coding file; Based on the erasure coding configuration parameters, determine the base data address information of the target data node corresponding to the erasure coding stripe; Based on the operation request and the baseline data address information, a baseline operation description is created and sent to the target data node.

9. An information processing apparatus, comprising: The acquisition module is configured to acquire erasure coding stripe information corresponding to the erasure coding file and write the erasure coding stripe information into a stripe information record table, wherein the erasure coding stripe information is the offset of the erasure coding stripe relative to the erasure coding file and the stripe size; The reading module is configured to read erasure code stripe information from the stripe information record table when an operation request associated with the erasure code file is detected, wherein the operation request is an operation request for deletion; The determination module is configured to determine the data address information of the target data node corresponding to the erasure coding file based on the erasure coding stripe information; The creation module is configured to create operation description information based on the operation request and the data address information, and send it to the target data node, wherein the operation description information is operation description information for deletion.

10. An information processing system, comprising: The server is used to obtain the erasure coding stripe information corresponding to the erasure coding file and write the erasure coding stripe information into the stripe information record table; Upon detecting an operation request associated with the erasure code file, the erasure code stripe information is read from the stripe information record table; Based on the erasure coding stripe information, determine the data address information of the target data node corresponding to the erasure coding file; create operation description information based on the operation request and the data address information, and send it to the target data node, wherein the erasure coding stripe information is the offset and stripe size of the erasure coding stripe relative to the erasure coding file, the operation request is an operation request for deletion, and the operation description information is an operation description information for deletion; The target data node is used to receive the operation description information and determine the physical address information according to the operation description information; and to mark the data range to be operated corresponding to the physical address information.

11. A computing device, comprising: Memory and processor; The memory is used to store computer-executable instructions, and the processor is used to execute the computer-executable instructions, which, when executed by the processor, implement the steps of the method according to any one of claims 1 to 8.

12. A computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the method according to any one of claims 1 to 8.

Images