WO2020020170A1

WO2020020170A1 - Data deleting method and device

Info

Publication number: WO2020020170A1
Application number: PCT/CN2019/097320
Authority: WO
Inventors: 李冰杰; 王辉
Original assignee: 杭州海康威视数字技术股份有限公司
Priority date: 2018-07-26
Filing date: 2019-07-23
Publication date: 2020-01-30
Also published as: CN110765081A

Abstract

Provided by the present application are a data deleting method and device. The method comprises: dividing logical data blocks, and configuring a time period label and a time validity period for the logical data blocks, and then original data is saved in a storage space of a corresponding logical data block according to matching conditions between a time stamp of the original data and the time period label of the logical data block. Therefore, it is possible to determine whether original data saved in the corresponding storage space of a logical data block is outdated by determining whether the logical data block is outdated, thereby reducing the time taken for detecting whether data is outdated. According to the embodiments of the present application, the time spent on detection does not increase along with an increase in data on the premise of the number of logical data blocks remaining fixed. In addition, the validity period of data may be conveniently modified when required by means of modifying the time validity period of the logical data block in which the data is located.

Description

Data deletion method and device

Technical field

The present application relates to the field of data storage, and in particular, to a method and a device for deleting data.

Background technique

In the process of data storage, there may be some invalid data. These invalid data will occupy a part of the storage resources and will interfere with the valid data, which will affect the use of data resources in the database and interfere with the results of data analysis. Therefore, the deletion of invalid data becomes crucial.

Summary of the Invention

In view of this, the present application provides a data deletion method and device to improve the efficiency of deleting invalid data and reduce the risk of misoperation.

According to a first aspect of the embodiments of the present application, a data deletion method is provided. The method is applied to a storage system, and a plurality of logical data blocks are divided in the storage system. The method includes:

Traverse the plurality of logical data blocks that have been divided, and detect whether the logical data block has expired according to a time period label and a time period set in advance for each logical data block; the original saved in the storage space corresponding to each logical data block Data meets: The timestamp of the original data falls within the time period identified by the time period label of the logical data block, and the time validity period of each logical data block is used to indicate the survival time of the logical data block;

For the detected overdue logical data block, delete the overdue logical data block and the original data stored in the storage space corresponding to the overdue logical data block.

According to a second aspect of the embodiments of the present application, a data deletion device is provided. The device is applied to a storage system, and the storage system is divided into a plurality of logical data blocks. The device has a function of implementing the method provided by the first aspect. The functions may be implemented by hardware, and may also be implemented by hardware executing corresponding software. The hardware or software includes one or more modules or units corresponding to the functions described above.

In an implementation manner, the apparatus may include:

An overdue detection module is used to traverse the multiple logical data blocks that have been divided, and detect whether the logical data block has expired according to a preset time period label and a time validity period for each logical data block; each logical data block corresponds to The original data stored in the storage space satisfies: the timestamp of the original data falls within the time period identified by the time period label of the logical data block, and the time validity period of each logical data block is used to indicate the survival time of the logical data block ;

The data deletion module is configured to delete the overdue logical data block and the original data stored in the storage space corresponding to the overdue logical data block for the overdue logical data block detected.

In another implementation manner, the apparatus may include a processor, a memory, and a bus, and the processor and the memory are connected to each other through a bus; the memory stores machine-readable instructions, and the processor calls The machine-readable instructions execute the method provided by the first aspect of the embodiments of the present application.

In the embodiment of the present application, the logical data block is divided, a time period label and a time validity period are set for the logical data block, and then the original data is saved to the corresponding logical data according to the matching between the time stamp of the original data and the time period label of the logical data block. In this way, the purpose of judging whether the original data stored in the corresponding storage space of the logical data block is expired can be achieved by judging whether the logical data block is expired, thereby reducing the time consumed for detecting whether the data expires. On the premise that the number of logical data blocks remains constant, the time consumed by the embodiments of the present application for detection does not increase with the increase of data. And, when the validity period of the data needs to be modified, it can be conveniently implemented by modifying the time validity period of the logical data block where the data is located.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an operation flowchart of a data deletion method according to an embodiment of the present application; FIG.

2 is a schematic diagram of a logical data block provided by an embodiment of the present application;

3 is a flowchart of a method for deleting expired data according to an embodiment of the present application;

FIG. 4 is a flowchart of a method for deleting overcapacity data according to an embodiment of the present application; FIG.

FIG. 5 is a block diagram of a device module according to an embodiment of the present application.

detailed description

In order to make the objectives, technical solutions, and advantages of the present invention clearer, the following describes the present invention in detail with reference to the accompanying drawings and specific embodiments.

In one embodiment, the invalid data can be filtered manually and the filtered invalid data can be deleted. In this case, the efficiency is relatively low and there is a risk of misoperation. In order to improve the efficiency of deleting invalid data and reduce the risk of misoperation, the embodiment of the present application provides a data deletion scheme. The data deletion solution provided in the embodiments of the present application can be applied to storage systems, including centralized storage systems and distributed storage systems. The centralized storage system refers to a system that stores data on a single device, such as a personal computer (PC); the distributed storage system refers to a system that stores data on multiple independent devices, such as HDFS (Hadoop Distributed File System (Hadoop distributed file system). With the increase of data, distributed storage systems featuring high performance and high capacity will gradually become mainstream storage systems.

Referring to FIG. 1, in one embodiment, the overall operation flow of the data deletion method provided by the embodiment of the present application may include the following steps:

Step 101: The storage system divides a plurality of logical data blocks locally.

Here, dividing the logical data block is to allocate corresponding storage space for the created logical data block. In the embodiment of the present application, the logical data block is a data storage unit in the storage system, and each logical data block corresponds to a segment of real storage space with continuous or discontinuous addresses. Different logical data blocks do not share the same storage space. During the operation of the system, you can increase the storage space for logical data blocks according to requirements, but it should be noted that the storage space that has been allocated to a logical data block cannot be allocated to other logical data blocks.

Step 102: The storage system sets a time period label and a data content label for the divided logical data blocks.

In the embodiment of the present application, the time period label of the logical data block may be used to indicate to which logical data block the storage space corresponding to the logical data block is stored by the storage system. The so-called raw data refers to the data imported into the storage system for the first time. The original data stored in the storage space corresponding to each logical data block satisfies: the timestamp of the original data falls within the time period identified by the time period label of the logical data block. The embodiment of the present application does not limit the interval length of the time period identified by the time period label. For example, the time period label can be set to 2017-2018, January 2018-June 2018, and January 1, 2018. 00:00 to 23:59 on January 1, 2018.

Similarly, the data content label can also be used to indicate to which logical data block the storage space corresponding to the storage system stores the received data. The original data stored in the storage space corresponding to each logical data block also satisfies: the data content of the original data is consistent with the data content label of the logical data block. The data content label can be set in advance according to the content of the data that the storage system will receive. For example, the storage system will receive the camera information of the four communities A, B, C, and D. You can set the corresponding logical data block in advance as follows Data content tags: A cell camera information, B cell camera information, C cell camera information, and D cell camera information.

Refer to FIG. 2, which is a schematic diagram of the logical data blocks divided in the storage system. It can be seen from the figure that the data content labels of logical data blocks with the same time period label are different from each other, and the time periods of the logical data blocks with the same data content label The labels are different from each other.

Step 103: The storage system sets a time validity period for each of the divided logical data blocks, and sets a storage capacity limit for each group of logical data blocks having the same content label.

In the embodiment of the present application, the time validity period of each logical data block is used to indicate the survival time of the logical data block, and is a basis for judging whether the original data has expired. The storage capacity limit of each group of logical data blocks is used to limit the size of the original data that the corresponding storage space of the group of logical data blocks can hold, and is the basis for judging whether the original data is overcapacity.

Step 104: The storage system sets associated location information for each of the divided logical data blocks.

After the original data is stored and processed, analysis data or other derived data related to the original data will be obtained. These analysis data or derived data are collectively referred to as the associated data of the original data. For example, when a certain raw data is the consumption record of a company in January 2018, the consumption quota of each department of the company obtained in January 2018 by analyzing the consumption record is the related data of the original data.

The related location information is used to indicate the storage location of the related data related to the original data. For example, the related location information may be a pointer to a storage location of the related data, a directory name of a directory where the related data is located, or a file name of a file where the related data is located.

After the above steps 101-104, the division and setting of the logical data block can be completed. After that, the storage system can save the received original data to the corresponding logical data block in the following ways: When the original data is received, according to the timestamp and data content of the received original data, the divided logical data block Search for a matching logical data block; the timestamp of the received original data falls within the time period identified by the time period label of the matching logical data block, and the data content of the received original data and the data of the matching logical data block The content tags are consistent; finally, the received original data is saved to the corresponding storage space of the found matching logical data block.

The storage system stores the received original data on the one hand, and on the other hand deletes a part of the old original data to release the storage capacity.

Step 105: The storage system detects whether the original data stored in the corresponding storage space of the logical data block exceeds the time validity period or exceeds the storage capacity limit; if yes, execute step 106; if not, execute step 107.

Here, the storage system may trigger the detection of the original data according to a fixed frequency, and / or may also immediately trigger the detection of the original data according to a detection instruction input externally.

During detection, the storage system can start two tasks, one task is used to detect whether the original data exceeds the time validity period, and one task is used to detect whether the original data exceeds the storage capacity limit. The two tasks do not interfere with each other. When the storage system triggers detection of the original data at a fixed frequency, the detection frequency of these two tasks may be the same or different. As for how to detect whether the original data is overdue and overcapacity will be described below, it will not be described in detail here.

Step 106: The storage system performs deletion processing on the original data that exceeds the time validity period or exceeds the storage capacity limit, and proceeds to step 107.

Step 107: The storage system detects whether the time validity period and the storage capacity limit set for the logical data block are deleted; if it is, the process ends; if not, the process returns to step 105.

Next, an implementation manner of detecting whether the original data exceeds the time validity period in the foregoing

steps

105 and 106 will be described with reference to FIG. 3:

Step 301: The storage system traverses the divided logical data blocks, and detects whether the logical data block has expired according to a time period label and a time validity period preset for each logical data block.

In the embodiment of the present application, the storage system stores the original data in the storage space of the corresponding logical data block according to the timestamp of the original data. The original data stored in the storage space corresponding to each logical data block satisfies the following: Timestamp falls within the time period identified by the time period label of the logical data block. For example, when the time period label of a logical data block is 2018.1-2018.6, it means that the original data stored in the corresponding storage space of the logical data block was generated between January 2018 and June 2018. Therefore, the storage system can determine whether the logical data block has expired to achieve the purpose of determining whether the original data stored in the corresponding storage space of the logical data block has expired.

In one example, the following steps can be used to detect whether a logical data block has expired: For each logical data block, according to a time period label preset for the logical data block, determine the maximum time of the time period identified by the time period label; Calculate the time interval between the current system time and the maximum time; determine whether the time interval is greater than the time validity period preset for the logical data block; if yes, determine that the logical data block has expired; if not, determine that the logical data block has not expired Expired.

For example, if the time period label of a logical data block is 2017.1-2018.1, the maximum time of the time period identified by the time period label is January 2018; if the current system time is July 2018, it is the logical data block in advance. The set time validity period is one year. Because the current system time differs from the maximum time by six months and less than one year, it can be considered that the logical data block has not expired.

Step 302: The storage system deletes the expired logical data block and the original data stored in the storage space corresponding to the expired logical data block for the detected expired logical data block.

Here, deleting the overdue logical data block will release the storage space allocated to the overdue logical data block, so that the storage space can be reallocated to other logical data blocks for use.

In addition, before or after deleting the original data stored in the storage space corresponding to the overdue logical data block, according to the associated position information set for the overdue logical data block in advance in step 104, the storage space corresponding to the overdue logical data block can be found. Associated data related to the saved raw data and deleted. This can remove relatively useless or stale data from the storage system as much as possible.

In an embodiment, in step 302, the storage system may first notify the administrator of the detected out-of-date logical data block through an email alert, etc. The administrator may choose to extend the validity period of the out-of-date logical data block, for example, by extending the time The validity period is extended from 1 year to 2 years. You can also choose not to extend the validity period of the expired logical data block. If the storage system does not receive an instruction to extend the time validity period of the overdue logical data block within the set time, the overdue logical data block, the original data stored in the corresponding storage space of the overdue logical data block, and related associations are deleted. data.

Hereinafter, an embodiment of detecting whether the original data exceeds the storage capacity limit in the foregoing

steps

105 and 106 will be described with reference to FIG. 4. The storage system traverses the divided logical data blocks and performs the following operations on each group of logical data blocks with the same data content label:

Step 401: The storage system counts the total size of the original data stored in the storage space corresponding to the set of logical data blocks.

In the embodiment of the present application, each group of logical data blocks is composed of at least one logical data block having the same data content label. For example, the data content label of a certain group of logical data blocks is the consumption record of company A, then the storage space of the group of logical data blocks can store the consumption records of company A in each month.

Step 402: The storage system judges whether the total size of the original data obtained by the statistics is greater than a preset storage capacity limit for the group of logical data blocks; if yes, step 403 is performed to execute the deletion process; if not, no deletion process is performed.

Step 403: When the size of the obtained raw data is larger than the preset storage capacity limit for the set of logical data blocks, the storage system filters out N logical data blocks from the set of logical data blocks, deletes the N logical data blocks and The N logical data blocks correspond to the original data stored in the storage space, so that after the deletion is completed, the total size of the original data stored in the corresponding logical space of the group of logical data blocks is less than the preset storage capacity limit for the group of logical data blocks.

In an example, in step 403, N logical data blocks with the minimum time ranking in the first N bits can be filtered according to the minimum time of the time period identified by the time period label of each logical data block in the set of logical data blocks.

For example, suppose a set of logical data blocks includes 3 logical data blocks, the time period label of logical data block 1 is January 2017-April 2017, and the time period label of logical data block 2 is May 2017-2017. In August, the time period label of logical data block 3 is September 2017 to December 2017; then the minimum time of the time period identified by the time period label of logical data block 1 is January 2017, and logical data block 2 is In May 2017, logical data block 3 was September 2017. The storage system can first delete the logical data block 1 which is ranked first in the minimum time and the original data generated from January 2017 to April 2017, and then determine whether the size of the original data corresponding to the set of logical data blocks is low. Based on the set storage capacity limit, if it is, end the deletion process; if not, continue to delete the logical data block 2 that is ranked second at the smallest moment and the original data generated from May 2017 to August 2017, and repeat this operation Until the size of the original data corresponding to the set of logical data blocks is less than the set storage capacity limit.

In addition, before or after deleting the original data stored in the storage space corresponding to the oversized logical data block, the corresponding corresponding to the oversized logical data block may be found according to the associated position information set for the oversized logical data block in step 104 in advance. Associated data related to the original data stored in the storage space and deleted. This can remove relatively useless or stale data from the storage system as much as possible.

In one embodiment, the storage system may notify the administrator of the overcapacity logical data block by performing an email alert before performing step 403. The administrator may choose to perform the storage capacity limit of the overcapacity logical data block. Increase, for example, increase the storage capacity limit from 1G to 2G, or you can choose not to extend the storage capacity limit of the overcapacity logical data block. If the storage system does not receive an instruction to increase the storage capacity limit of the over-capacity logical data block within the set time, then delete the over-capacity logical data block and the original stored in the corresponding storage space of the over-capacity logical data block. Data and related associated data.

So far, the processes shown in FIGS. 1, 3 and 4 are completed.

As can be seen from the above process, the embodiment of the present application divides the logical data block, sets a time period label and a time validity period for the logical data block, and then matches the original data time stamp and the logical data block time period label to match the original data. The data is stored in the storage space of the corresponding logical data block; in this way, the purpose of judging whether the original data stored in the corresponding storage space of the logical data block is expired can be achieved by judging whether the logical data block is expired, which reduces the detection of whether the data expires Elapsed time. On the premise that the number of logical data blocks remains constant, the time consumed by the embodiments of the present application for detection does not increase with the increase of data. And, when the validity period of the data needs to be modified, it can be conveniently implemented by modifying the time validity period of the logical data block where the data is located.

Further, because the data not only needs to be deleted when its validity period expires, but also old data needs to be deleted due to insufficient system storage capacity, the embodiment of the present application also sets one for each group of logical data blocks with the same data content label. A common storage capacity limit. When the original data in the set of logical data blocks exceeds the storage capacity limit, the old data within the earliest time range is deleted to free up storage space.

Further, the embodiments of the present application also support deleting related data related to the original data while deleting the original data.

The methods provided in the embodiments of the present application have been described above. The device provided in the embodiments of the present application is described below.

Referring to FIG. 5, FIG. 5 is a functional module diagram of a data deletion device provided by an embodiment of the present application. The device can be applied to a storage system, where a plurality of logical data blocks are divided. As shown in Figure 5, the device includes:

An overdue detection module 501 is configured to traverse the multiple logical data blocks that have been divided, and detect whether the logical data block has expired according to a preset time period label and a time validity period for each logical data block; each logical data block corresponds to The original data stored in the storage space of the memory satisfies: the time stamp of the original data falls within the time period identified by the time period label of the logical data block, and the time validity period of each logical data block is used to indicate the survival of the logical data block duration;

The data deletion module 502 is configured to delete the overdue logical data block and the original data stored in the storage space corresponding to the overdue logical data block for the overdue logical data block detected.

In one embodiment, the overdue detection module 501 is configured to determine, for each logical data block, a maximum time of a time period identified by the time period label according to a time period label preset for the logical data block. Calculate the time interval between the current system time and the maximum time; determine whether the time interval is greater than the time validity period preset for the logical data block; if yes, determine that the logical data block has expired; if not, determine the logical data block Not expired.

In one implementation manner, each logical data block is further preset with a data content tag; the device may further include:

A receiving module for receiving raw data;

A data saving module, configured to find a matching logical data block among the divided logical data blocks according to the time stamp and data content of the received original data; the time stamp of the received original data falls on the matching logical data block In the time period identified by the time period label, and the data content of the received original data is consistent with the data content label of the matching logical data block; the received original data is stored in the corresponding storage space of the found matching logical data block .

In one embodiment, the device may further include an overcapacity detection module;

The overcapacity detection module is configured to traverse the plurality of logical data blocks that have been divided, and perform the following operations on each group of logical data blocks with the same data content label: Count the number of logical data blocks stored in the corresponding storage space. The sum of the size of the original data; judging whether the sum of the size of the raw data obtained by the statistics is greater than the preset storage capacity limit for the set of logical data blocks; if so, filtering out N logical data blocks from the set of logical data blocks;

Correspondingly, the data deletion module 502 is further configured to delete the N logical data blocks and the original data stored in the storage space corresponding to the N logical data blocks, so that after the deletion is completed, the corresponding logical data blocks are stored in the corresponding storage space. The total size of the original data is less than the preset storage capacity limit for this set of logical data blocks.

In one implementation manner, the overcapacity detection module is configured to filter out the smallest moment in the top N based on the smallest moment of the time period identified by the time period label of each logical data block in the set of logical data blocks. N logical blocks of bits.

In one of the implementation manners, the data deletion module 502 is further configured to, for the detected overdue logical data block, find corresponding storage corresponding to the overdue logical data block according to the associated position information set for the overdue logical data block in advance. The associated data related to the original data stored in the space is deleted, and the associated location information is used to indicate a storage location of the associated data.

It should be noted that the division of the modules in the embodiments of the present application is schematic, and is only a logical function division. In actual implementation, there may be another division manner. The functional modules in the embodiments of the present application may be integrated into one processing module, or each module may exist separately physically, or two or more modules may be integrated into one module. The above integrated modules may be implemented in the form of hardware or software functional modules.

The implementation process of the functions and functions of each module in the above device is described in detail in the implementation process of the corresponding steps in the above method, and is not repeated here.

So far, the description of the device shown in FIG. 5 is completed.

An embodiment of the present application further provides a data deletion device, which is applied to a storage system and includes a processor, a memory, and a bus. The processor and the memory are connected to each other through a bus. The memory stores machine-readable instructions. The processor calls the machine-readable instructions to implement the methods shown in FIG. 1, FIG. 3, and FIG. 4.

In addition, an embodiment of the present application further provides a machine-readable storage medium that stores machine-readable instructions. When the machine-readable instructions are called and executed by a processor, the machine may Executing instructions causes the processor to implement the methods shown in FIG. 1, FIG. 2, and FIG.

The above are only preferred embodiments of this application, and are not intended to limit this application. Any modification, equivalent replacement, or improvement made within the spirit and principles of this application shall be included in this application Within the scope of protection.

Claims

A data deletion method. The method is applied to a storage system, and a plurality of logical data blocks are divided in the storage system. The method includes:

Traversing the divided logical data blocks,

Detect whether the logical data block has expired according to the preset time period label and time validity period for each logical data block; the original data stored in the storage space corresponding to each logical data block satisfies: the time stamp of the original data falls in the logic Within the time period identified by the time period label of the data block, the time validity period of each logical data block is used to indicate the survival time of the logical data block;

For the detected overdue logical data block, delete the overdue logical data block and the original data stored in the storage space corresponding to the overdue logical data block.
The method according to claim 1, wherein the detecting whether the logical data block has expired according to a time period label and a time validity period preset for each logical data block comprises:

For each logical data block, determine the maximum time of the time period identified by the time period label according to the time period label preset for the logical data block;

Calculate the time interval between the current system time and the maximum time;

Judging whether the time interval is greater than the time validity period preset for the logical data block;

If the time interval is greater than the time validity period, determining that the logical data block has expired;

If the time interval is less than or equal to the time validity period, it is determined that the logical data block has not expired.
The method according to claim 1, wherein each logical data block is further preset with a data content label; the method further comprises:

Receive raw data;

According to the timestamp and data content of the received original data, find the matching logical data block in the divided logical data blocks; the timestamp of the received original data falls on the time period label identified by the matching logical data block Within the time period, and the data content of the received original data is consistent with the data content label of the matching logical data block;

The received original data is stored in the corresponding storage space of the found matching logical data block.
The method of claim 3, further comprising: traversing the plurality of logical data blocks that have been divided, and performing the following operations on each group of logical data blocks having the same data content label:

Count the total size of the original data stored in the corresponding storage space of the group of logical data blocks;

Judging whether the total size of the raw data obtained by the statistics is greater than the preset storage capacity limit for the set of logical data blocks;

If the sum of the size of the original data is greater than the storage capacity limit, then

N logical data blocks are selected from the group of logical data blocks, and the original data stored in the storage space corresponding to the N logical data blocks and the N logical data blocks is deleted, so that after the deletion is completed, the corresponding logical data block corresponds to the storage space. The total size of the original data stored in the internal data block is less than the storage capacity limit set for the logical data block set in advance.
The method according to claim 4, wherein filtering N logical data blocks from the set of logical data blocks comprises:

According to the minimum time of the time period identified by the time period label of each logical data block in the set of logical data blocks, N logical data blocks whose minimum time is ranked in the first N bits are filtered out.
The method of claim 1, further comprising:

For the detected out-of-date logical data block, according to the associated location information set for the out-of-date logical data block in advance, find and delete the associated data related to the original data stored in the storage space corresponding to the out-of-date logical data block; the associated position information Used to indicate where the associated data is stored.
The method of claim 4, further comprising:

For each logical data block of the N logical data blocks, according to the associated position information set in advance for the logical data block, find related data related to the original data stored in the corresponding storage space of the logical data block and Delete; wherein the associated location information is used to indicate a storage location of the associated data.
A data deleting device is applied to a storage system, and a plurality of logical data blocks are divided in the storage system. The device includes:

An overdue detection module is used to traverse the multiple logical data blocks that have been divided, and detect whether the logical data block has expired according to a preset time period label and a time validity period for each logical data block; each logical data block corresponds to The original data stored in the storage space satisfies: the timestamp of the original data falls within the time period identified by the time period label of the logical data block, and the time validity period of each logical data block is used to indicate the survival time of the logical data block ;

The data deletion module is configured to delete the overdue logical data block and the original data stored in the storage space corresponding to the overdue logical data block for the overdue logical data block detected.
The apparatus according to claim 8, wherein:

The overdue detection module is configured to determine, for each logical data block, a maximum time of the time period identified by the time period label according to a time period label preset for the logical data block; and calculate the current system time and the maximum time. Time interval; determine whether the time interval is greater than the time validity period preset for the logical data block; if the time interval is greater than the time validity period, determine that the logical data block has expired; if the time interval is less than or equal to the If the time is valid, it is determined that the logical data block has not expired.
The device according to claim 8, wherein each logical data block is further provided with a data content label in advance; the device further comprises:

A receiving module for receiving raw data;

A data saving module, configured to find a matching logical data block among the divided logical data blocks according to the time stamp and data content of the received original data; the time stamp of the received original data falls on the matching logical data block In the time period identified by the time period label, and the data content of the received original data is consistent with the data content label of the matching logical data block; the received original data is stored in the corresponding storage space of the found matching logical data block .
The device according to claim 10, wherein the device further comprises an overcapacity detection module;

The overcapacity detection module is configured to traverse the plurality of logical data blocks that have been divided, and perform the following operations on each group of logical data blocks with the same data content label: Count the number of logical data blocks stored in the corresponding storage space. The sum of the size of the original data; judging whether the sum of the size of the raw data obtained by the statistics is greater than the preset storage capacity limit for the set of logical data blocks; if the sum of the size of the original data is greater than the storage capacity limit, filtering from the set of logical data blocks Output N logical data blocks;

The data deletion module is further configured to delete the N logical data blocks and the original data stored in the storage space corresponding to the N logical data blocks, so that the size of the original data stored in the storage space corresponding to the set of logical data blocks after the deletion is completed The sum is less than the preset storage capacity limit for this set of logical data blocks.
The device according to claim 11, wherein:

The overcapacity detection module is configured to filter out N logical data blocks whose minimum time is in the top N bits according to the minimum time of the time period identified by the time period label of each logical data block in the set of logical data blocks.
The apparatus according to claim 8, wherein:

The data deletion module is further configured to find an association with the original data stored in the storage space corresponding to the expired logical data block according to the associated position information set for the expired logical data block in advance for the detected expired logical data block. Data and delete; the associated location information is used to indicate the storage location of the associated data.
The device according to claim 11, wherein:

The data deletion module is further configured to find, for each logical data block of the N logical data blocks, a storage space corresponding to the logical data block according to the associated position information set in advance for the logical data block. The associated original data related to the saved original data is deleted, and the associated location information is used to indicate a storage location of the associated data.
A data deletion device, which is characterized in that it is applied to a storage system and includes a processor, a memory, and a bus, wherein the processor and the memory are connected to each other through the bus;

Machine-readable instructions are stored in the memory, and the processor executes the method according to any one of claims 1 to 7 by calling the machine-readable instructions.
A machine-readable storage medium, characterized in that the machine-readable storage medium stores machine-readable instructions, and when the machine-readable instructions are called and executed by a processor, the machine-readable instructions cause the machine-readable instructions to The processor implements the method according to any one of claims 1 to 7.