Data object deletion method, apparatus, device, storage medium, and program product

Abstract

The application relates to a data object deletion method, device, equipment, storage medium and program product. The method comprises the following steps: determining a current physical disk to be subjected to deletion processing, and determining each mounted logical disk mounted to a logical disk buffer area corresponding to the current physical disk, the mounted logical disk being a logical disk of the current physical disk; determining a total data amount of each to-be-deleted data object recorded on an object to-be-deleted area of the mounted logical disk, the to-be-deleted data object being recorded on the object to-be-deleted area in response to a deletion request for the to-be-deleted data object, and the to-be-deleted data object being a data object on the mounted logical disk; selecting a current processing logical disk from each mounted logical disk mounted to the logical disk buffer area according to the total data amount; and performing deletion on each to-be-deleted data object recorded on an object to-be-deleted area of the current processing logical disk. The method can improve the balance between deletion efficiency and resource utilization.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular to a method, apparatus, device, storage medium, and program product for deleting data objects. Background Technology

[0002] In the current distributed storage environment, data deletion operations face severe challenges: On the one hand, deletion operations are essentially disk I / O intensive tasks. When faced with large-scale small files or scattered data objects, traditional deletion mechanisms generate a large number of random disk accesses, leading to I / O bottlenecks. On the other hand, business systems have increasingly higher requirements for the continuity of storage services. The resource consumption of deletion operations often competes with core business resources, which can lead to a business latency increase of more than 50% in severe cases.

[0003] In traditional technologies, distributed storage systems are designed primarily to optimize data write and read performance, with insufficient focus on optimizing deletion operations. This has resulted in a technological imbalance of "heavy storage replacing light deletion." For example, the distributed file system Ceph employs a delayed deletion mechanism that moves data to be deleted to a stray directory before asynchronous background cleanup. This leads to storage space being occupied by invalid data for extended periods, potentially wasting over 30% of storage space in high-frequency deletion scenarios. This "space-for-time" approach results in a severe imbalance between deletion efficiency and resource utilization. Summary of the Invention

[0004] Therefore, it is necessary to provide a data object deletion method, apparatus, computer device, computer-readable storage medium, and computer program product that can improve the balance between deletion efficiency and resource utilization in order to address the above-mentioned technical problems.

[0005] On one hand, this application provides a data object deletion method, including: determining the current physical disk to be deleted, and determining each mounted logical disk that is mounted to the logical disk buffer corresponding to the current physical disk, wherein the mounted logical disk is a logical disk of the current physical disk; determining the total data volume of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk, wherein the data object to be deleted is recorded in the object deletion area in response to a deletion request for the data object to be deleted, and the data object to be deleted is a data object on the mounted logical disk; selecting the current processing logical disk from each mounted logical disk that is mounted to the logical disk buffer according to the total data volume; and deleting each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk.

[0006] In this embodiment, the current physical disk to be deleted is determined, and each mounted logical disk that has been mounted to the corresponding logical disk buffer of the current physical disk is determined. The mounted logical disk is the logical disk of the current physical disk. The total amount of data of each data object to be deleted recorded in the object to be deleted area of ​​the mounted logical disk is determined. The data object to be deleted is recorded in the object to be deleted area in response to the deletion request for the data object to be deleted. The data object to be deleted is the data object on the mounted logical disk. According to the total amount of data, the current processing logical disk is selected from each mounted logical disk that has been mounted to the logical disk buffer, and each data object to be deleted recorded in the object to be deleted area of ​​the current processing logical disk is deleted. By mounting logical disks on the logical disk buffer of the physical disk and recording the data objects to be deleted in the object deletion area of ​​the logical disk, asynchronous deletion (i.e., non-instantaneous deletion) of the data objects to be deleted can be achieved. Furthermore, the logical disk to be deleted (i.e., the currently processed logical disk) can be determined based on the total amount of data objects to be deleted. Then, the data objects to be deleted on the currently processed logical disk are deleted in a centralized manner, which can reduce the number of times the physical disk is accessed during the deletion process, reduce the amount of data read and written during the deletion process, reduce the computer resource consumption during the deletion process, thereby improving the deletion efficiency and resource utilization, and improving the balance between deletion efficiency and resource utilization.

[0007] In some embodiments, the object deletion area contains object information of the data object to be deleted, and the method further includes: receiving a deletion request for a data object to be deleted on a target logical disk of the current physical disk, the deletion request containing object information of the data object to be deleted; adding the object information of the data object to be deleted to an object buffer corresponding to the target logical disk; and, if the object buffer is full, transferring the object information in the object buffer to the object deletion area of ​​the target logical disk.

[0008] In this embodiment, the object information of the data objects to be deleted is recorded through the object buffer. When the object buffer is full, the object information in the object buffer is transferred to the object deletion area of ​​the target logical disk, thereby reducing access to the object deletion area and thus reducing disk access.

[0009] In some embodiments, adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk includes: determining whether the data object to be deleted meets the fast deletion condition based on at least one of the following: the data volume of the data object to be deleted, the total data volume of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current space usage of the physical disk, and the space usage of the object metadata area of ​​the target logical disk; and if it is determined that the data object to be deleted meets the fast deletion condition, adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk.

[0010] In this embodiment, when the data object to be deleted is small, a single flush of object metadata can only reclaim a limited amount of free space, resulting in low returns. Therefore, fast deletion is preferable. However, when the total amount of data of the currently recorded data objects to be deleted is large, or when the physical disk space usage or the object metadata area of ​​the logical disk is insufficient, direct deletion is preferable to release more storage space in a timely manner. Therefore, determining whether the data object to be deleted meets the fast deletion condition based on at least one of the following: the amount of data of the data object to be deleted, the total amount of data of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current physical disk space usage, and the space usage of the object metadata area of ​​the target logical disk, can balance the timeliness of storage space release and the efficiency of data object deletion.

[0011] In some embodiments, the data objects on the current processing logical disk are stored in the data object area of ​​the current processing logical disk, and the data block bitmap area of ​​the current processing logical disk is used to store the data block bitmap. Each data block in the data object area has a corresponding bit in the data block bitmap. Deleting each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk includes: for each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk, reading the data block interval information corresponding to the data object to be deleted, the data block interval information being used to identify the data block interval occupied by the data object to be deleted in the data object area; based on the data block interval information, locating the bits corresponding to each data block occupied by the data object to be deleted from the data block bitmap, and setting the bits corresponding to each data block occupied by the data object to be deleted as free markers to delete the data object to be deleted.

[0012] In this embodiment, since the data block bitmap area of ​​the current processing logical disk is used to store the data block bitmap, each data block in the data object area has a corresponding bit in the data block bitmap. Therefore, when it is necessary to delete each data object recorded in the object deletion area in batches, if the data block bitmap is not in the cache, the data block bitmap can be read from the disk, and the bits in the data block bitmap can be modified centrally. Instead of reading from the disk (i.e., physical disk) to the cache every time a bit is modified, the central modification can be performed in one disk write operation, thereby further reducing the disk access frequency.

[0013] In some embodiments, the object metadata area of ​​the current processing logical disk is used to store the object metadata of each data object on the current processing logical disk, each sub-area of ​​the object metadata area is used to store one object metadata, the current processing logical disk stores a metadata bitmap corresponding to the object metadata area, each bit in the metadata bitmap corresponds to a sub-area in the object metadata area, and each sub-area is used to store one object metadata; the method further includes: reading the metadata record corresponding to the current processing logical disk from the object metadata area of ​​the current processing logical disk, the metadata record containing the object metadata of each data object on the current processing logical disk; determining the sub-area occupied by the object metadata of the data object to be deleted; setting the bit in the metadata bitmap corresponding to the sub-area occupied by the object metadata of the data object to be deleted as a free flag, so as to delete the object metadata of the data object to be deleted.

[0014] In this embodiment, by centrally modifying bits in the metadata bitmap, it is not necessary to read from the disk (i.e., physical disk) to the cache every time a bit is modified. Furthermore, after the centralized modification, only one disk write operation is required, thereby further reducing the frequency of disk access.

[0015] In some embodiments, the object index area of ​​the current processing logical disk stores object index information, which includes index information for each data object on the current processing logical disk. The index information is used to identify the sub-area occupied by the object metadata of the data object in the object metadata area. Reading the data block interval information corresponding to the data object to be deleted includes: reading the object metadata of the data object to be deleted from the object metadata area according to the index information of the data object to be deleted, wherein the object metadata includes the identification information of the data block interval information; and reading the data block interval information from the current processing logical disk according to the identification information of the data block interval information. The method further includes: determining the index information of the data object to be deleted from the object index information according to the object information of the data object to be deleted, and deleting the index information of the data object to be deleted from the object index information.

[0016] In this embodiment, data block range information can be quickly read based on object metadata, and the index information of the data object to be deleted can be removed from the object index information, which can ensure the integrity of data deletion.

[0017] On the other hand, this application also provides a data object deletion device, comprising: a logical disk determination module, configured to determine the current physical disk to be deleted, and to determine each mounted logical disk that is mounted to the logical disk buffer corresponding to the current physical disk, wherein the mounted logical disk is a logical disk of the current physical disk; a data volume determination module, configured to determine the total data volume of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk, wherein the data object to be deleted is recorded in the object deletion area in response to a deletion request for the data object to be deleted, and the data object to be deleted is a data object on the mounted logical disk; a logical disk selection module, configured to select the current processing logical disk from each mounted logical disk that is mounted to the logical disk buffer according to the total data volume; and an object deletion module, configured to delete each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk.

[0018] On the other hand, this application also provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described data object deletion method.

[0019] On the other hand, this application also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps in the above-described data object deletion method.

[0020] On the other hand, this application also provides a computer program product, including a computer program that, when executed by a processor, implements the steps in the above-described data object deletion method.

[0021] The aforementioned data object deletion method, apparatus, computer device, computer-readable storage medium, and computer program product determine the current physical disk to be deleted and each mounted logical disk that is mounted to the logical disk buffer corresponding to the current physical disk. The mounted logical disk is the logical disk of the current physical disk. The total amount of data of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk is determined. The data object to be deleted is recorded in the object deletion area in response to a deletion request for the data object to be deleted. The data object to be deleted is the data object on the mounted logical disk. The current processing logical disk is selected from each mounted logical disk in the logical disk buffer according to the total amount of data, and each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk is deleted. By mounting logical disks on the logical disk buffer of the physical disk and recording the data objects to be deleted in the object deletion area of ​​the logical disk, asynchronous deletion (i.e., non-instantaneous deletion) of the data objects to be deleted can be achieved. Furthermore, the logical disk to be deleted (i.e., the currently processed logical disk) can be determined based on the total amount of data objects to be deleted. Then, the data objects to be deleted on the currently processed logical disk are deleted in a centralized manner, which can reduce the number of times the physical disk is accessed during the deletion process, reduce the amount of data read and written during the deletion process, reduce the computer resource consumption during the deletion process, thereby improving the deletion efficiency and resource utilization, and improving the balance between deletion efficiency and resource utilization. Attached Figure Description

[0022] To more clearly illustrate the technical solutions in the embodiments of this application or related technologies, the drawings used in the description of the embodiments of this application or related technologies will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1 This is a diagram illustrating the application environment of a data object deletion method in one embodiment.

[0024] Figure 2 This is a flowchart illustrating a data object deletion method in one embodiment;

[0025] Figure 3 This is a flowchart illustrating the process of recording data objects to be deleted in one embodiment;

[0026] Figure 4 This is a flowchart illustrating the synchronous deletion method in one embodiment;

[0027] Figure 5 This is a flowchart illustrating the data object deletion method in another embodiment;

[0028] Figure 6 This is a structural block diagram of a data object deletion device in one embodiment;

[0029] Figure 7 This is an internal structural diagram of a computer device in one embodiment;

[0030] Figure 8 This is a diagram of the internal structure of a computer device in another embodiment. Detailed Implementation

[0031] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the scope of this application.

[0032] It should be noted that the terms "first," "second," etc., used in this application can be used to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish the first element from the second element. The terms "comprising" and "having," and any variations thereof, used in this application, are intended to cover non-exclusive inclusion. The term "multiple" used in this application refers to two or more. The term "and / or" used in this application refers to one of the embodiments, or any combination of multiple embodiments.

[0033] The data object deletion method provided in this application embodiment can be applied to, for example, Figure 1 In the illustrated application environment, the environment includes a distributed storage system and a terminal 102. The distributed storage system includes multiple storage nodes. The terminal 102 communicates with the storage nodes via a network. Storage nodes can be terminals or servers. The data storage system can store data that the server needs to process. The data storage system can be integrated onto a server or located on a cloud or other network server. The distributed storage system can be a system used to provide cloud services. Each storage node in the distributed storage system can independently execute the data object deletion method described in this application.

[0034] Terminal 102 can be, but is not limited to, various personal computers, laptops, smartphones, tablets, drones, low-altitude aircraft, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, smart in-vehicle systems, and projection equipment. Portable wearable devices can include smartwatches, smart bracelets, and head-mounted displays. Head-mounted displays can be virtual reality (VR) devices, augmented reality (AR) devices, and smart glasses. Storage nodes can be independent physical servers or virtual machines, or cloud servers providing cloud computing services.

[0035] In one exemplary embodiment, such as Figure 2 As shown, a method for deleting data objects is provided. This method can be executed by a terminal or a server, and can be applied to... Figure 1 Taking any one of the storage nodes as an example, the explanation includes the following steps:

[0036] Step 202: Determine the current physical disk to be deleted, and determine each mounted logical disk that is mounted to the logical disk buffer corresponding to the current physical disk. The mounted logical disk is the logical disk of the current physical disk.

[0037] In this context, a data object is an independent data packet, which can be a part of a file. For example, a data object can be a part or all of an image, video, or document. When a file deletion operation or request is triggered, one or more data objects can be deleted.

[0038] A storage node can include multiple physical disks. The current physical disk is any physical disk on the storage node. One physical disk can correspond to multiple logical disks; that is, one physical disk can be divided into multiple logical disks. "Multiple" means at least two.

[0039] For example, mounting a logical disk to a logical disk buffer can be achieved by adding the logical disk information of the logical disk to the logical disk buffer. The logical disk buffer can be, but is not limited to, a queue. The logical disk buffer can reside in memory.

[0040] Step 204: Determine the total amount of data of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk. The data objects to be deleted are recorded in the object deletion area in response to the deletion request for the data objects to be deleted. The data objects to be deleted are data objects on the mounted logical disk.

[0041] In this context, the data objects to be deleted recorded in the object deletion area of ​​a mounted logical disk belong to that mounted logical disk. The data objects to be deleted recorded in the object deletion area do not store the data objects themselves, but rather store the object information of the data objects to be deleted.

[0042] The object information may include or include the identification information of the data object to be deleted. Based on the object information, it can be determined which physical disk, logical disk, and specific data object the data object to be deleted belongs to. For example, the object information may include at least one of a physical disk identifier, a logical disk identifier, and an object identifier. The logical disk identifier identifies the logical disk to which the data object to be deleted belongs, and the object identifier identifies the data object to be deleted within the logical disk. The physical disk identifier identifies the physical disk to which the data object to be deleted belongs. The object information may also include the amount of data in the data object to be deleted.

[0043] For example, a mounted logical disk is mounted to the logical disk buffer corresponding to the current physical disk when there is object information in the object to be deleted area of ​​the mounted logical disk.

[0044] Step 206: Select the current processing logical disk from the mounted logical disks that have been mounted to the logical disk buffer according to the total data volume.

[0045] For example, for each mounted logical disk, the data volume of each mounted logical disk recorded in the object's deletion area is summed to obtain the total data volume corresponding to that mounted logical disk. The mounted logical disk with the largest total data volume can be used as the currently processed logical disk.

[0046] For example, the maximum total data volume can be compared with a preset data volume. If the maximum total data volume is greater than or equal to the preset data volume, the mounted logical disk corresponding to the maximum total data volume is used as the current processing logical disk. If the maximum total data volume is less than the preset data volume, it is determined that the current physical disk does not need to be deleted, thus eliminating the need to execute step 208. The preset data volume can be set according to actual conditions.

[0047] For example, for each mounted logical disk, the ratio of the total data volume to the capacity of the object deletion area can be calculated to obtain the object deletion area utilization rate corresponding to the mounted logical disk. The mounted logical disk with the highest object deletion area utilization rate can be used as the currently processed logical disk. Alternatively, if the highest object deletion area utilization rate is greater than or equal to a utilization rate threshold, the mounted logical disk corresponding to the highest object deletion area utilization rate can be used as the currently processed logical disk. The utilization rate threshold can be set according to actual needs, for example, it can be 90% or 95%.

[0048] For example, there may be one or more currently processed logical disks. For instance, the usage rate of the object to be deleted area corresponding to each mounted logical disk can be compared with a usage rate threshold. If the usage rate of the object to be deleted area is greater than or equal to the usage rate threshold, then the mounted logical disk corresponding to the usage rate of the object to be deleted area is taken as the currently processed logical disk.

[0049] Step 208: Delete each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk.

[0050] For example, if all data objects to be deleted recorded in the object deletion area of ​​the currently processed logical disk have been deleted, the currently processed logical disk can be removed from the logical disk buffer corresponding to the current physical disk. Specifically, the logical disk information of the currently processed logical disk can be deleted from the logical disk buffer, thereby achieving the purpose of removing the currently processed logical disk.

[0051] For example, a storage node may contain multiple physical disks. The storage node may periodically or periodically traverse each physical disk of the storage node, with the current physical disk being the traversed physical disk, and then, for the traversed physical disk, execute steps 202-208.

[0052] In the above data object deletion method, the current physical disk to be deleted is determined, and each mounted logical disk that is mounted to the corresponding logical disk buffer of the current physical disk is determined. The mounted logical disk is the logical disk of the current physical disk. The total amount of data of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk is determined. The data object to be deleted is recorded in the object deletion area in response to the deletion request for the data object to be deleted. The data object to be deleted is the data object on the mounted logical disk. According to the total amount of data, the current processing logical disk is selected from each mounted logical disk in the logical disk buffer, and each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk is deleted. By mounting logical disks on the logical disk buffer of the physical disk and recording the data objects to be deleted in the object deletion area of ​​the logical disk, asynchronous deletion (i.e., non-instantaneous deletion) of the data objects to be deleted can be achieved. Furthermore, the logical disk to be deleted (i.e., the currently processed logical disk) can be determined based on the total amount of data objects to be deleted. Then, the data objects to be deleted on the currently processed logical disk are deleted in a centralized manner, which can reduce the number of times the physical disk is accessed during the deletion process, reduce the amount of data read and written during the deletion process, reduce the computer resource consumption during the deletion process, thereby improving the deletion efficiency and resource utilization, and improving the balance between deletion efficiency and resource utilization.

[0053] In an exemplary embodiment, the object to be deleted area contains object information of the data object to be deleted, and the method further includes: receiving a deletion request for the data object to be deleted on the target logical disk of the current physical disk, the deletion request containing the object information of the data object to be deleted; adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk; and transferring the object information in the object buffer to the object to be deleted area of ​​the target logical disk when the object buffer is full.

[0054] The target logical disk can be any logical disk of the current physical disk. The object buffer resides in memory and can be, but is not limited to, an array. The object deletion area of ​​the target logical disk is a part of the target logical disk. By transferring object information to the object deletion area, the purpose of recording the data objects to be deleted in the object deletion area is achieved.

[0055] For example, a storage node can be configured with a deletion method label. If the deletion method label indicates that the fast deletion method is supported, it is determined whether the data object to be deleted meets the fast deletion conditions. If it does, the steps of "adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk" and subsequent steps are executed. If the data object to be deleted does not meet the fast deletion conditions, the synchronous deletion method (immediate deletion method) is used to delete the data object to be deleted. If the deletion method label indicates that the storage node does not support the fast deletion method, the synchronous deletion method is used to delete the data object to be deleted.

[0056] For example, after transferring the object information in the object buffer to the object to be deleted area of ​​the target logical disk, if the target logical disk is not mounted to the logical disk buffer corresponding to the current physical disk, then the target logical disk is mounted to the logical disk buffer corresponding to the current physical disk; if the target logical disk is already mounted to the logical disk buffer corresponding to the current physical disk, then there is no need to mount it again.

[0057] like Figure 3 As shown, a flowchart illustrating the process of recording data objects to be deleted is provided, including: determining whether the data object to be deleted meets the conditions for fast deletion; if not, deleting the object synchronously (i.e., deleting the data object to be deleted using the synchronous deletion method); if it meets the conditions, recording the data object to be deleted in the logical disk's deletion array (i.e., the object buffer), and determining whether the logical disk's deletion array is full; if it is full, writing (i.e., transferring) the data objects to be deleted recorded in the logical disk's deletion array to the object deletion area of ​​the currently processed logical disk, and attaching the currently processed logical disk to the deletion queue (i.e., the logical disk buffer) of the current physical disk.

[0058] In this embodiment, the object information of the data objects to be deleted is recorded through the object buffer. When the object buffer is full, the object information in the object buffer is transferred to the object deletion area of ​​the target logical disk, thereby reducing access to the object deletion area and thus reducing disk access.

[0059] In an exemplary embodiment, adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk includes: determining whether the data object to be deleted meets the fast deletion condition based on at least one of the following: the data volume of the data object to be deleted, the total data volume of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current space usage of the physical disk, and the space usage of the object metadata area of ​​the target logical disk. The object metadata area is used to store the object metadata of the data object to be deleted recorded on the object deletion area of ​​the target logical disk. If it is determined that the data object to be deleted meets the fast deletion condition, the object information of the data object to be deleted is added to the object buffer corresponding to the target logical disk.

[0060] The current physical disk space usage can be considered as the current physical disk utilization rate. The object metadata area space usage can be considered as the object metadata area utilization rate. The object metadata area of ​​the target logical disk is a part of the target logical disk and is used to store the object metadata of each data object on the target logical disk.

[0061] The quick deletion criteria can include multiple sub-conditions, namely: the amount of data in the object to be deleted is less than the reference amount of data; the current physical disk usage rate is less than the first reference usage rate; and the usage rate of the object metadata area on the target logical disk is less than the second reference usage rate. The reference amount of data can be set according to actual needs. The first and second reference usage rates can be the same or different, and can be set according to actual needs.

[0062] For example, if any one of the sub-conditions is met, the fast deletion condition is determined to be met. Alternatively, if at least two sub-conditions are met, the fast deletion condition is determined to be met.

[0063] For example, if the amount of data in the data object to be deleted is greater than or equal to the amount of reference data, it is determined that the data object to be deleted does not meet the conditions for fast deletion, and the synchronous deletion method is used to directly delete the data object to be deleted, thereby freeing up more storage resources in a timely manner.

[0064] In this embodiment, when the data object to be deleted is small, a single flush of object metadata can only reclaim a limited amount of free space, resulting in low returns. Therefore, fast deletion is preferable. However, when the total amount of data of the currently recorded data objects to be deleted is large, or when the physical disk space usage or the object metadata area of ​​the logical disk is insufficient, direct deletion is preferable to release more storage space in a timely manner. Therefore, determining whether the data object to be deleted meets the fast deletion condition based on at least one of the following: the amount of data of the data object to be deleted, the total amount of data of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current physical disk space usage, and the space usage of the object metadata area of ​​the target logical disk, can balance the timeliness of storage space release and the efficiency of data object deletion.

[0065] In an exemplary embodiment, data objects on the current processing logical disk are stored in the data object area of ​​the current processing logical disk, and the data block bitmap area of ​​the current processing logical disk is used to store the data block bitmap. Each data block in the data object area has a corresponding bit in the data block bitmap. Deleting each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk includes: for each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk, reading the data block interval information corresponding to the data object to be deleted, the data block interval information is used to identify the data block interval occupied by the data object to be deleted in the data object area; based on the data block interval information, locating the bits corresponding to each data block occupied by the data object to be deleted from the data block bitmap, and setting the bits corresponding to each data block occupied by the data object to be deleted as free markers to delete the data object to be deleted.

[0066] In this data block bitmap, each bit has a value of 0 or 1. If a bit in the data block bitmap has a value of 0, it means that the corresponding data block is not occupied; if the bit has a value of 1, it means that the corresponding data block is occupied. The free flag is used to indicate that the data block is not occupied, and thus the free flag is 0.

[0067] The current processing logical disk includes a range storage area, which stores the data block range information corresponding to each data object on the current processing logical disk. Since a data object may be stored across multiple non-contiguous data block ranges, a data object to be deleted can correspond to multiple data block range information. The data block range information can be stored in the form of an extB+ tree (range B+ tree). Each data object corresponds to one extB+ tree, which records the data block range information corresponding to each data object. Setting the bits corresponding to each data block occupied by the data object to be deleted as a free flag achieves the purpose of deleting the data object. The data block range information can be read from the cache or the disk, with priority given to reading from the cache; if the information is not found in the cache, it is read from the disk.

[0068] A data block interval can include multiple consecutive data blocks. Of course, a data block interval can also be a single data block. Data block interval information can include the location information of the data block interval, such as the location or index of the starting data block of the data block interval, and the length of the data block interval (i.e., the number of data blocks in the data block interval).

[0069] For example, since the object to be deleted area stores the object information of the data object to be deleted, the node corresponding to the data object to be deleted can be located in the interval B+ tree by using the object information as an index, and the data block interval information corresponding to the data object to be deleted can be read from the node corresponding to the data object to be deleted.

[0070] In this embodiment, since the data block bitmap area of ​​the current processing logical disk is used to store the data block bitmap, each data block in the data object area has a corresponding bit in the data block bitmap. Therefore, when it is necessary to delete each data object recorded in the object deletion area in batches, if the data block bitmap is not in the cache, the data block bitmap can be read from the disk, and the bits in the data block bitmap can be modified centrally. Instead of reading from the disk (i.e., physical disk) to the cache every time a bit is modified, the central modification can be performed in one disk write operation, thereby further reducing the disk access frequency.

[0071] In an exemplary embodiment, the object metadata area of ​​the current processing logical disk is used to store the object metadata of each data object on the current processing logical disk. Each sub-area of ​​the object metadata area is used to store one object metadata. The current processing logical disk includes a metadata bitmap corresponding to the object metadata area. Each bit in the metadata bitmap corresponds to a sub-area in the object metadata area, and each sub-area is used to store one object metadata. The method further includes: reading the metadata record corresponding to the current processing logical disk from the object metadata area of ​​the current processing logical disk. The metadata record contains the object metadata of each data object on the current processing logical disk. Determine the sub-area occupied by the object metadata of the data object to be deleted. Set the bit in the metadata bitmap corresponding to the sub-area occupied by the object metadata of the data object to be deleted as a free flag to delete the object metadata of the data object to be deleted.

[0072] Each logical disk can be divided into multiple data blocks. The object metadata area can include multiple contiguous data blocks (e.g., 1024 contiguous blocks). The currently processing logical disk includes a metadata bitmap area, which is used to store metadata bitmaps. The metadata bitmap area can occupy at least one data block. For example, the metadata bitmap area occupies one data block, and the object metadata area occupies 1024 contiguous blocks. The metadata bitmap area can be contiguous with the object metadata area. For instance, in the currently processing logical disk, the first block of 1025 contiguous blocks is the metadata bitmap area, and the remaining 1024 contiguous blocks are the object metadata area. If the size of each data block is 4KB = 32768 bits, then the 1024 blocks are divided into 32768 sub-areas, each sub-area being 128 bytes in size.

[0073] For example, the object index area of ​​the currently processed logical disk stores object index information. This object index information includes the index information of each data object on the currently processed logical disk. The index information is used to identify the sub-area occupied by the object metadata of the data object in the object metadata area. Therefore, the sub-area occupied by the object metadata of the data object to be deleted can be determined based on the index information of the data object to be deleted. The object index area can store the object index information in the form of a B+ tree. Therefore, the object index information can be an object B+ tree. Each node in the object B+ tree corresponds to a data object, and each node in the object B+ tree includes the index information of the data object. Using this index information, the corresponding object metadata can be found in the object metadata area.

[0074] In this embodiment, by centrally modifying bits in the metadata bitmap, it is not necessary to read from the disk (i.e., physical disk) to the cache every time a bit is modified. Furthermore, after the centralized modification, only one disk write operation is required, thereby further reducing the frequency of disk access.

[0075] In an exemplary embodiment, the object index area of ​​the current processing logical disk stores object index information, which includes index information for each data object on the current processing logical disk. The index information is used to identify the sub-area occupied by the object metadata of the data object in the object metadata area. Reading the data block interval information corresponding to the data object to be deleted includes: reading the object metadata of the data object to be deleted from the object metadata area based on the index information of the data object to be deleted, wherein the object metadata includes identification information of the data block interval information; and reading the data block interval information from the current processing logical disk based on the identification information of the data block interval information. The method further includes: determining the index information of the data object to be deleted from the object index information based on the object information of the data object to be deleted, and deleting the index information of the data object to be deleted from the object index information.

[0076] The identifier for the data block interval information can be the root node of an extB+ tree (interval B+ tree). Each data object can correspond to a separate extB+ tree.

[0077] For example, the object index information of the currently processed logical disk is read from the cache or the current physical disk, and the index information of the data object to be deleted is read from the object index information based on the object information of the data object to be deleted.

[0078] For example, if the object index information is not in the cache, the object index information is read into the cache, and then the index information of the data object to be deleted is deleted from the object index information to obtain the updated object index information. Then, the updated object index information can be written to disk (i.e., written to the physical disk).

[0079] In this embodiment, data block range information can be quickly read based on object metadata, and the index information of the data object to be deleted can be removed from the object index information, which can ensure the integrity of data deletion.

[0080] In this application, the deletion of each data object to be deleted recorded in the object deletion area of ​​the currently processed logical disk can be implemented using a synchronous deletion method. For example... Figure 4 As shown, a scheme for synchronously deleting data objects using the synchronous deletion method is provided, including:

[0081] 1. Read the object B+ tree and obtain the object metadata of the data object to be deleted based on the index information in the object B+ tree.

[0082] 2. Read the extB+ tree of the data object to be deleted based on the object's metadata to obtain the data block range information of the data object to be deleted.

[0083] 3. Mark the location occupied by the data block range information of the data object to be deleted as free (i.e., free space).

[0084] 4. Mark the space occupied by the object's metadata as free (i.e., free space).

[0085] 5. Delete the index information of the data object to be deleted in the object B+ tree.

[0086] 6. Record logs and trigger cache refresh.

[0087] For example, the current physical disk is one of multiple physical disks on the storage node. The storage node can periodically (driven by a timer) or periodically traverse these multiple physical disks to perform data object deletion, achieving batch and fast deletion. Specifically, as... Figure 5 As shown, for the current physical disk being traversed (i.e., the current physical disk to be processed), the current logical disk with the largest amount of data to be deleted (i.e., the total amount of data) is selected from the deletion queue of the current physical disk. The object metadata in the object metadata area of ​​the current logical disk is pre-read into the cache. The object information of the data objects to be deleted is sequentially obtained from the object deletion area of ​​the current logical disk. Synchronous deletion is performed according to the object information (i.e., based on the object information, each data object to be deleted recorded in the object deletion area of ​​the current logical disk is deleted). It is determined whether the object deletion area of ​​the current logical disk has been completely deleted. If not, the step of sequentially obtaining the object information of the data objects to be deleted from the object deletion area of ​​the current logical disk is returned. If the deletion has been completed, it is determined whether the physical disk has been traversed. If not, the traversal continues.

[0088] Related technologies have failed to effectively address the core challenges of data deletion in distributed storage systems: first, the lack of a dynamic aggregation mechanism targeting deletion operation characteristics prevents a significant reduction in disk I / O operations; second, the absence of a collaborative optimization strategy between deletion operations and cache management results in generally low cache utilization; and third, a lack of fine-grained balance between deletion efficiency and business impact leads to either sacrificing response speed or wasting storage space. Figure 4 As can be seen, the synchronous object deletion scheme first locates the object's ext range B+ tree (i.e., extB+ tree), releases the data blocks occupied by each ext range, then releases the disk space occupied by the object's metadata, and finally deletes the object's index from the logical disk's object B+ tree. The entire process requires modifying the logical disk metadata in different locations, including logical disk space usage, the object's ext range B+ tree, and the object's B+ tree index structure. When these metadata pages are not cached, disk reads are required (e.g., reading an entire 4KB page into the cache). After modifying the logical disk metadata, the new data also needs to be flushed from the cache to the disk. If the deleted objects are scattered across various logical disks on a single physical disk, the entire deletion process will involve frequent disk read / write operations, significantly impacting business operations.

[0089] The data object deletion method provided in this application effectively controls the duration of the impact of deletion on the business by introducing two layers of aggregation: memory array aggregation and disk deletion area aggregation. By combining logical disk aggregation and background deletion, it transforms unpredictable discrete deletion requests from users into efficient batch deletion, making full use of caching (such as memory or buffer) characteristics and reducing the number of disk collisions.

[0090] When a user performs file deletion, there will be a large number of data object deletion requests during this period. In the case of synchronous deletion, deletions will continue throughout the entire timeline, and the impact on business will continue indefinitely. There may be deletion actions for 40 seconds within a minute. This application can reduce the impact time on business by caching user deletion requests and aggregating and processing them, so that there are only 10 seconds of deletion actions within a minute.

[0091] In synchronous deletion scenarios, user deletion requests may be scattered across different logical drives, resulting in low cache page utilization and frequent cache page reclamation and cache flushing, especially for small object deletions where the benefit of each deletion is minimal. This application addresses this by aggregating deletion requests by logical drive. During backend deletion, metadata for each logical drive is read into the cache all at once. Since simultaneous access and modification only affects the metadata page of the current logical drive, the cache does not reclaim these pages. Furthermore, a single page flush can carry more object modifications, reducing write amplification during deletion and achieving improved efficiency through collaboration with caching features.

[0092] Thanks to the efficiency improvements provided by caching, the correlation between the amount of data deleted and the number of disk access attempts is effectively reduced, eliminating the traditional situation where large data deletions also have a significant impact on business operations. This application enables faster deletion speeds when deleting large amounts of data, while maintaining minimal impact on business operations.

[0093] It should be understood that although the steps in the flowcharts of the embodiments described above are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the flowcharts of the embodiments described above may include multiple steps or multiple stages. These steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least some of the steps or stages in other steps. It is understood that the steps in different embodiments can be freely combined as needed, and all non-contradictory solutions formed by such combinations are within the scope of protection of this application.

[0094] Based on the same inventive concept, this application also provides a data object deletion apparatus for implementing the data object deletion method described above. The solution provided by this apparatus is similar to the implementation described in the above method; therefore, the specific limitations in one or more data object deletion apparatus embodiments provided below can be found in the limitations of the data object deletion method described above, and will not be repeated here.

[0095] In one exemplary embodiment, such as Figure 6 As shown, a data object deletion device is provided, including: a logical disk determination module 602, a data volume determination module 604, a logical disk selection module 606, and an object deletion module 608, wherein:

[0096] The logical disk determination module 602 is used to determine the current physical disk to be deleted and to determine each mounted logical disk that has been mounted to the logical disk buffer corresponding to the current physical disk. The mounted logical disk is the logical disk of the current physical disk.

[0097] The data volume determination module 604 is used to determine the total data volume of each data object to be deleted recorded in the object to be deleted area of ​​the mounted logical disk. The data objects to be deleted are recorded in the object to be deleted area in response to the deletion request for the data objects to be deleted. The data objects to be deleted are data objects on the mounted logical disk.

[0098] The logical disk selection module 606 is used to select the currently processed logical disk from the mounted logical disks that have been mounted to the logical disk buffer according to the total amount of data.

[0099] The object deletion module 608 is used to delete each data object to be deleted recorded in the object deletion area of ​​the currently processed logical disk.

[0100] In some embodiments, the object to be deleted area contains object information of the data object to be deleted. The method further includes a deletion request processing module, which is used to receive a deletion request for the data object to be deleted on the target logical disk of the current physical disk. The deletion request contains object information of the data object to be deleted. The object information of the data object to be deleted is added to the object buffer corresponding to the target logical disk. If the object buffer is full, the object information in the object buffer is transferred to the object to be deleted area of ​​the target logical disk.

[0101] In an exemplary embodiment, the deletion request processing module is further configured to determine whether the data object to be deleted meets the fast deletion condition based on at least one of the following: the data volume of the data object to be deleted, the total data volume of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current space usage of the physical disk, and the space usage of the object metadata area of ​​the target logical disk. The object metadata area is used to store the object metadata of the data object to be deleted recorded on the object deletion area of ​​the target logical disk. If it is determined that the data object to be deleted meets the fast deletion condition, the object information of the data object to be deleted is added to the object buffer corresponding to the target logical disk.

[0102] In an exemplary embodiment, the object metadata area of ​​the current processing logical disk is used to store the object metadata of each data object on the current processing logical disk. Each sub-area of ​​the object metadata area is used to store one object metadata. The current processing logical disk stores a metadata bitmap corresponding to the object metadata area. Each bit in the metadata bitmap corresponds to a sub-area in the object metadata area, and each sub-area is used to store one object metadata. The object deletion module is further used to read the metadata record corresponding to the current processing logical disk from the object metadata area of ​​the current processing logical disk. The metadata record contains the object metadata of each data object on the current processing logical disk. The module determines the sub-area occupied by the object metadata of the data object to be deleted. The module sets the bit in the metadata bitmap corresponding to the sub-area occupied by the object metadata of the data object to be deleted to a free flag to delete the object metadata of the data object to be deleted.

[0103] In an exemplary embodiment, the object index area of ​​the current processing logical disk stores object index information, which includes index information for each data object on the current processing logical disk. The index information is used to identify the sub-area occupied by the object metadata of the data object in the object metadata area. The object deletion module is further used to read the object metadata of the data object to be deleted from the object metadata area based on the index information of the data object to be deleted. The object metadata includes identification information of data block interval information. Based on the identification information of the data block interval information, the module reads the data block interval information from the current processing logical disk. Based on the object information of the data object to be deleted, the module determines the index information of the data object to be deleted from the object index information and deletes the index information of the data object to be deleted from the object index information.

[0104] Each module in the aforementioned data object deletion device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device, or stored in the memory of a computer device as software, so that the processor can invoke and execute the operations corresponding to each module.

[0105] In one exemplary embodiment, a computer device is provided, which may be a server, and its internal structure diagram may be as follows: Figure 7 As shown, the computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The database stores at least a portion of the data involved in the data object deletion method. The I / O interfaces are used for exchanging information between the processor and external devices. The communication interface is used for communicating with external terminals via a network connection. When the computer program is executed by the processor, it implements a data object deletion method.

[0106] In one exemplary embodiment, a computer device is provided, which may be a terminal, and its internal structure diagram may be as follows: Figure 8As shown, the computer device includes a processor, memory, input / output interfaces, a communication interface, a display unit, and an input device. The processor, memory, and input / output interfaces are connected via a system bus, and the communication interface, display unit, and input device are also connected to the system bus via the input / output interfaces. The processor provides computing and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs stored in the non-volatile storage media. The input / output interfaces are used for exchanging information between the processor and external devices. The communication interface is used for wired or wireless communication with external terminals; wireless communication can be achieved through Wi-Fi, mobile cellular networks, Near Field Communication (NFC), or other technologies. When executed by the processor, the computer program implements a data object deletion method. The display unit is used to form a visually visible image and can be a display screen, a projection device, or a virtual reality imaging device. The display screen can be an LCD screen or an e-ink screen. The input device of the computer device can be a touch layer covering the display screen, or buttons, trackballs, or touchpads set on the casing of the computer device, or external keyboards, touchpads, or mice, etc.

[0107] Those skilled in the art will understand that Figure 7 and Figure 8 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0108] In one exemplary embodiment, a computer device is provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0109] In one embodiment, a computer-readable storage medium is provided having a computer program stored thereon, which, when executed by a processor, implements the steps in the above method embodiments.

[0110] In one embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above method embodiments.

[0111] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of the relevant data must comply with relevant regulations.

[0112] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile memory and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM). The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, artificial intelligence (AI) processors, etc., and are not limited to these.

[0113] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this application.

[0114] The embodiments described above are merely illustrative of several implementation methods of this application, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of this patent application. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of this application, and these all fall within the protection scope of this application. Therefore, the protection scope of this application should be determined by the appended claims.

Claims

1. A method for deleting a data object, characterized in that, The method includes: Determine the current physical disk to be deleted, and determine each mounted logical disk that has been mounted to the logical disk buffer corresponding to the current physical disk, wherein the mounted logical disk is the logical disk of the current physical disk; Determine the total amount of data of each data object to be deleted recorded in the object deletion area of ​​the mounted logical disk. The data objects to be deleted are recorded in the object deletion area in response to a deletion request for the data objects to be deleted. The data objects to be deleted are data objects on the mounted logical disk. The current processing logical disk is selected from each of the mounted logical disks that have been mounted to the logical disk buffer according to the total data volume; Delete each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk.

2. The method according to claim 1, characterized in that, The object to be deleted area contains object information of the data object to be deleted, and the method further includes: Receive a deletion request for a data object to be deleted on a target logical disk of the current physical disk, wherein the deletion request contains object information of the data object to be deleted; Add the object information of the data object to be deleted to the object buffer corresponding to the target logical disk; If the object buffer is full, the object information in the object buffer is transferred to the object deletion area of ​​the target logical disk.

3. The method according to claim 2, characterized in that, Adding the object information of the data object to be deleted to the object buffer corresponding to the target logical disk includes: Based on at least one of the following: the data volume of the data object to be deleted, the total data volume of each data object to be deleted recorded on the object deletion area of ​​the target logical disk, the current space usage of the physical disk, and the space usage of the object metadata area of ​​the target logical disk, determine whether the data object to be deleted meets the fast deletion condition; If it is determined that the data object to be deleted meets the fast deletion condition, the object information of the data object to be deleted is added to the object buffer corresponding to the target logical disk.

4. The method according to any one of claims 1 to 3, characterized in that, The data objects on the current processing logical disk are stored in the data object area of ​​the current processing logical disk, and the data block bitmap area of ​​the current processing logical disk is used to store the data block bitmap. Each data block in the data object area has a corresponding bit in the data block bitmap. The deletion of each data object to be deleted recorded in the object deletion area of ​​the currently processed logical disk includes: For each data object to be deleted recorded in the object deletion area of ​​the current processing logical disk, read the data block interval information corresponding to the data object to be deleted. The data block interval information is used to identify the data block interval occupied by the data object to be deleted in the data object area. Based on the data block interval information, the bits corresponding to each data block occupied by the data object to be deleted are located from the data block bitmap, and the bits corresponding to each data block occupied by the data object to be deleted are set as free markers to delete the data object to be deleted.

5. The method according to claim 4, characterized in that, The object metadata area of ​​the current processing logical disk is used to store the object metadata of each data object on the current processing logical disk. Each sub-area of ​​the object metadata area is used to store one object metadata. The current processing logical disk stores a metadata bitmap corresponding to the object metadata area. Each bit in the metadata bitmap corresponds to a sub-area in the object metadata area, and each sub-area is used to store one object metadata. The method further includes: Read the metadata record corresponding to the current processing logical disk from the object metadata area of ​​the current processing logical disk. The metadata record contains the object metadata of each data object on the current processing logical disk. Determine the sub-area occupied by the object metadata of the data object to be deleted; Set the bit corresponding to the sub-area occupied by the object metadata of the data object to be deleted in the metadata bitmap to a free flag, so as to delete the object metadata of the data object to be deleted.

6. The method according to claim 4, characterized in that, The object index area of ​​the currently processed logical disk stores object index information, which includes the index information of each data object on the currently processed logical disk. The index information is used to identify the sub-area occupied by the object metadata of the data object in the object metadata area. Reading the data block interval information corresponding to the data object to be deleted includes: Based on the index information of the data object to be deleted, the object metadata of the data object to be deleted is read from the object metadata area, and the object metadata includes the identification information of the data block interval information; Based on the identifier information of the data block interval information, the data block interval information is read from the current processing logical disk; The method further includes: Based on the object information of the data object to be deleted, the index information of the data object to be deleted is determined from the object index information, and the index information of the data object to be deleted is deleted from the object index information.

7. A data object deletion device, characterized in that, The device includes: The logical disk determination module is used to determine the current physical disk to be deleted, and to determine each mounted logical disk that has been mounted to the logical disk buffer corresponding to the current physical disk, wherein the mounted logical disk is the logical disk of the current physical disk; The data volume determination module is used to determine the total data volume of each data object to be deleted recorded in the object to be deleted area of ​​the mounted logical disk. The data objects to be deleted are recorded in the object to be deleted area in response to a deletion request for the data objects to be deleted. The data objects to be deleted are data objects on the mounted logical disk. The logical disk selection module is used to select the currently processed logical disk from each of the mounted logical disks that have been mounted to the logical disk buffer according to the total amount of data. The object deletion module is used to delete each data object to be deleted recorded in the object deletion area of ​​the currently processed logical disk.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, characterized in that, When the processor executes the computer program, it implements the steps of the method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1 to 6.

Images