CN111552667B

CN111552667B - Data deleting method and device and electronic equipment

Info

Publication number: CN111552667B
Application number: CN202010353937.2A
Authority: CN
Inventors: 胡文飞
Original assignee: Hangzhou Hikvision System Technology Co Ltd
Current assignee: Hangzhou Hikvision System Technology Co Ltd
Priority date: 2020-04-29
Filing date: 2020-04-29
Publication date: 2023-11-03
Anticipated expiration: 2040-04-29
Also published as: CN111552667A

Abstract

The embodiment of the invention provides a data deleting method and device and electronic equipment. The method is applied to a management server and comprises the following steps: obtaining an auxiliary information table; wherein each information entry in the auxiliary information table includes: the key information is used for determining all index entries of target data corresponding to the information entries in the index information table; screening target information items with storage time meeting preset screening conditions from the information items of the auxiliary information table; and deleting all index entries matched with the key information included in each target information entry in the index information table, and sending time point information to the storage node so that the storage node deletes the data with the storage time not later than the target time point in the stored data. Compared with the prior art, the scheme provided by the embodiment of the invention can improve the speed of deleting the expired data in the storage node, and further improve the release speed of the storage space in the storage node.

Description

Data deleting method and device and electronic equipment

Technical Field

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

Background

Currently, data storage systems are increasingly applied to various fields due to advantages of high storage efficiency, low operation cost and the like, and when storing data, the data storage systems can adopt various storage modes. Such as object storage, streaming storage, etc.

Wherein the so-called object store is also called object-based store, each object belongs to the same level of flat address space of the storage pool, and one object does not belong to the next level of another object. In addition, each object is assigned a unique identifier that allows the object to be retrieved based on the identifier without having to know the physical address of the storage location of the object in the storage pool.

When the storage mode adopted by the data storage system is object storage, the data storage system comprises a management server and a storage node. Taking a cloud storage system as an example, a CVS (Cloud Video Slave, cloud storage data node) is a storage node, a CVM (Cloud Video Master, cloud storage management server) is a management server, and an index information table constructed using index information of data stored in the CVS is stored.

Further, to free up storage space in the storage node, stale data in the storage node needs to be deleted. In the related art, the method for deleting the expiration data stored in the storage node is as follows: firstly, screening out index entries of the expiration data to be deleted from an index information table according to a preset screening strategy. Further, in the storage node, searching data corresponding to the screened index entry, deleting the searched data, and deleting the index entry of the data to be deleted from the index information table.

However, in the above-described related art, the filtering of the index entry, the determination of the data to be deleted, and the deletion of the data are sequentially performed, and the latter step needs to be implemented depending on the result of the former step. Thus, during the stale data deletion process, the stale data is deleted at a slower rate, resulting in a slower release of storage space in the storage node. Especially when there are more index entries contained in the index information table, the time for filtering the index entries is longer, thereby further slowing down the data of the stale data deletion.

Disclosure of Invention

The embodiment of the invention aims to provide a data deleting method for improving the speed of deleting the expired data in a storage node, and further improving the release speed of the storage space in the storage node. The specific technical scheme is as follows:

in a first aspect, an embodiment of the present invention provides a data deletion method, applied to a management server, where the method includes:

obtaining an auxiliary information table corresponding to the index information table to be deleted; wherein each information item in the auxiliary information table includes: the key information is used for determining all index entries of the target data corresponding to the information entries in the index information table, and the storage time is as follows: the time of storing the target data last time from the current system time;

Screening target information items which contain storage time meeting preset screening conditions from the information items of the auxiliary information table, wherein the preset screening conditions are as follows: the time interval between the current system time and the current system time is not smaller than a preset storage period;

deleting all index entries matched with key information included in each target information entry in the index information table, and sending time point information to a storage node so that the storage node deletes data with storage time not later than a target time point in stored data;

wherein, the time point information is: information characterizing the target point in time; the target time point is: and the time difference between the current system time and the current system time is the time point of the preset storage period.

Optionally, in a specific implementation manner, the generating manner of each information item in the auxiliary information table includes:

receiving the synchronous storage time of the data and key information in an index entry of the data after the storage of any data by the storage node is completed;

searching whether an information item comprising the received key information exists in the auxiliary information table;

If so, updating the storage time included in the searched information item to the received storage time;

otherwise, an information entry including the received key information and the storage time is added to the auxiliary information table.

receiving the index entry and the storage time of the data synchronized by the storage node after any data is stored, and extracting key information from the received index entry;

otherwise, an information entry including the extracted key information and the received storage time is added to the auxiliary information table.

In a second aspect, an embodiment of the present invention provides a data deletion method, applied to a storage node, where the method includes:

acquiring time point information sent by a management server;

determining a target time point represented by the time point information; wherein the target time point is: before the current system time, the time difference between the current system time and the current system time is a time point of a preset storage period;

And deleting the data with the storage time not later than the target time point from the stored data.

Optionally, in a specific implementation manner, the step of deleting the data stored in the stored data, where the storage time is not later than the target time point includes:

searching data with storage time not later than the target time point from the stored data;

if the searched data is not in the locking state, deleting the searched data;

wherein, the locking state is: and setting when the storage time of the stored data is not later than the target time point but the storage period of the stored data is larger than the preset storage period.

In a third aspect, an embodiment of the present invention provides a data deleting apparatus, applied to a management server, including:

the information table obtaining module is used for obtaining an auxiliary information table corresponding to the index information table to be deleted; wherein each information item in the auxiliary information table includes: the key information is used for determining all index entries of the target data corresponding to the information entries in the index information table, and the storage time is as follows: the time of storing the target data last time from the current system time;

The information item screening module is used for screening target information items with storage time meeting preset screening conditions from the information items of the auxiliary information table, wherein the preset screening conditions are as follows: the time interval between the current system time and the current system time is not smaller than a preset storage period;

the first data deleting module is used for deleting all index entries matched with key information included in each target information entry in the index information table, and sending time point information to a storage node so that the storage node deletes data with storage time not later than a target time point in the stored data;

Optionally, in a specific implementation manner, the apparatus further includes: an information item generation module for generating each information item in the auxiliary information table;

the information item generation module is specifically configured to: receiving the synchronous storage time of the data and key information in an index entry of the data after the storage of any data by the storage node is completed; searching whether an information item comprising the received key information exists in the auxiliary information table; if so, updating the storage time included in the searched information item to the received storage time; otherwise, an information entry including the received key information and the storage time is added to the auxiliary information table.

the information item generation module is specifically configured to: receiving the index entry and the storage time of the data synchronized by the storage node after any data is stored, and extracting key information from the received index entry; searching whether an information item comprising the received key information exists in the auxiliary information table; if so, updating the storage time included in the searched information item to the received storage time; otherwise, an information entry including the extracted key information and the received storage time is added to the auxiliary information table.

In a fourth aspect, an embodiment of the present invention provides a data deleting apparatus, applied to a storage node, including:

the time point information acquisition module is used for acquiring time point information sent by the management server;

the time point determining module is used for determining a target time point represented by the time point information;

and the second data deleting module is used for deleting the data with the storage time not later than the target time point from the stored data.

Optionally, in a specific implementation manner, the second data deleting module is specifically configured to:

searching data with storage time not later than the target time point from the stored data; if the searched data is not in the locking state, deleting the searched data;

In a fifth aspect, an embodiment of the present invention provides a management server, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;

a memory for storing a computer program;

and a processor, configured to implement the steps of any one of the data deletion methods provided in the first aspect when executing the program stored in the memory.

In a sixth aspect, an embodiment of the present invention provides a storage node, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete communication with each other through the communication bus;

A memory for storing a computer program;

and a processor for implementing any one of the data deletion methods provided in the second aspect when executing the program stored in the memory.

In a seventh aspect, an embodiment of the present invention provides a computer readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of any of the data deletion methods provided in the first aspect above.

In an eighth aspect, an embodiment of the present invention provides a computer readable storage medium having stored therein a computer program which, when executed by a processor, implements the steps of any of the data deletion methods provided in the second aspect above.

As can be seen from the above, by applying the scheme provided by the embodiment of the present invention, an auxiliary information table corresponding to the index information table may be constructed at the management server, where each information entry in the auxiliary information table may include key information for determining all index entries of the target data corresponding to the information entry in the index information table and a storage time for storing the target data last time from the current system time. That is, each information entry in the auxiliary information table may correspond to all index entries in the index information table for the same data. Thus, when the management server screens the index information of the data to be deleted, the management server can screen target information items, which are contained in the auxiliary information table and have storage time meeting the preset screening conditions, from the information items of the auxiliary information table, and further delete all index items, which are matched with key information contained in the target information items, in the index information table. Meanwhile, the management server can send the time point information to the storage node, so that the storage node can delete the data which is not later than the target time point in the stored data, and the deletion of the expired data stored in the storage node is completed.

Based on the above, by applying the scheme provided by the embodiment of the invention, the management server can send the target time information to the storage node while deleting the index entry of the expired data, so that the storage node deletes the data with the storage time not later than the target time point. Therefore, when the expiration data is deleted, the index entry obtained by screening is not needed to be relied on to determine the expiration data to be deleted, the index information of the expiration data and the expiration data are synchronously deleted, and all the expiration data are deleted at one time according to the target time point by the storage node. Therefore, by applying the scheme provided by the embodiment of the invention, the deleting speed of the expired data in the storage node can be improved, and further, the releasing speed of the storage space in the storage node is improved.

In addition, by applying the scheme provided by the embodiment of the invention, the whole index information table does not need to be scanned, so that the time consumption caused by scanning the whole index information table in the process of deleting the outdated data can be reduced, and the processing pressure of a data storage system and the influence on normal operation of other businesses are reduced.

Drawings

In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a flow chart of a data deleting method applied to a management server according to an embodiment of the present invention;

fig. 2 is a flow chart of a data deleting method applied to a storage node according to an embodiment of the present invention;

fig. 3 is a flowchart of another data deleting method applied to a storage node according to an embodiment of the present invention

Fig. 4 is a schematic structural diagram of a data deleting device applied to a management server according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of a data deleting device applied to a storage node according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of a management server according to an embodiment of the present invention;

fig. 7 is a schematic structural diagram of a storage node according to an embodiment of the present invention.

Detailed Description

The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

In the related art, when deleting the outdated data in the storage node, the filtering of the index entry, the determining of the data to be deleted and the deleting of the data are sequentially performed, and the latter step needs to be implemented depending on the result of the former step. Thus, during the stale data deletion process, the stale data is deleted at a slower rate, resulting in a slower release of storage space in the storage node. Especially when there are more index entries contained in the index information table, the time for filtering the index entries is longer, thereby further slowing down the data of the stale data deletion. In order to solve the technical problems described above, embodiments of the present invention provide a data deletion method applied to a management server and a data deletion method applied to a storage node.

Next, first, a data deleting method applied to a management server provided in an embodiment of the present invention will be described.

Fig. 1 is a schematic diagram of an electronic device, such as a notebook computer, a desktop computer, or the like, which is used in any data storage system to manage data stored in a storage node and store an index information table constructed by using index information of the data stored in the storage node, and in this embodiment of the present invention, the management server is not particularly limited.

As shown in fig. 1, a data deleting method applied to a management server according to an embodiment of the present invention may include the following steps:

s101: obtaining an auxiliary information table corresponding to the index information table to be deleted;

wherein each information entry in the auxiliary information table includes: the key information is used for determining all index entries of target data corresponding to the information entries in the index information table, and the storage time is as follows: the time of storing the target data last time from the current system time;

s102: screening target information items which contain storage time meeting a predetermined screening condition from the information items of the auxiliary information table,

wherein, the predetermined screening conditions are: the time interval between the current system time and the current system time is not smaller than a preset storage period;

s103: deleting all index entries matched with key information included in each target information entry in the index information table, and sending time point information to a storage node so that the storage node deletes data with the storage time not later than the target time point in the stored data;

wherein, the time point information is: information characterizing a target point in time; the target time points are: the time difference between the current system time and the current system time is the time point of the preset storage period.

As can be seen from the above, by applying the scheme provided by the embodiment of the present invention, an auxiliary information table corresponding to the index information table may be constructed at the management server, where each information entry in the auxiliary information table may include key information for determining all index entries of the target data corresponding to the information entry in the index information table and a storage time for storing the target data last time from the current system time. That is, each information entry in the auxiliary information table may correspond to all index entries in the index information table for the same data. . Thus, when the management server screens the index information of the data to be deleted, the management server can screen target information items, which are contained in the auxiliary information table and have storage time meeting the preset screening conditions, from the information items of the auxiliary information table, and further delete all index items, which are matched with key information contained in the target information items, in the index information table. Meanwhile, the management server can send the time point information to the storage node, so that the storage node can delete the data which is not later than the target time point in the stored data, and the deletion of the expired data stored in the storage node is completed.

In the data deleting method provided by the embodiment of the invention, in order to reduce time consumption caused by scanning the whole index information table in the data deleting process, and reduce the processing pressure of a data storage system and the influence on other normal operation, an auxiliary information table corresponding to the stored index information table to be deleted can be constructed in the management server.

The user can update the data stored in the storage node for a plurality of times, and the updated data can be stored again after the data is updated so as to realize the modified content of the updated data. In this way, an index information item on the data can be regenerated in the index information table, and the regenerated index information item includes a storage time that is a time to store the updated data after the update of the data is completed. At this point, it can be seen that the data is again restored to the storage node.

That is, for the data stored in the storage node, a plurality of pieces of index information of the data may be included in the index information table, wherein the index information including the earliest storage time is the time when the data is first stored in the storage node, and the storage time in each piece of index information is the time when the updated data is stored after each update of the data.

Based on this, each information item in the auxiliary information table may correspond to a data stored in the storage node, where the data may be the target data corresponding to the information item, and further, the key information included in the information item is information of all index items of the determined index information table, and further, the storage time is the time for storing the target data last time from the current system time.

That is, by the key information in each information item, all index items of the target data corresponding to the information item can be determined in the index information table.

Obviously, for the storage time included in the information item, when the data stored in the storage node is not updated, the storage time in the information item corresponding to the index item of the data is the time for storing the data; when the data is updated, the storage time in the information entry corresponding to the index entry related to the data is the time when the updated data is stored after the data is updated last time.

That is, by the storage time in each information item, the last storage time of the target data corresponding to the information item in the storage node can be determined.

The data stored in the storage node may be any type of data such as video data, audio data, document data, etc., and the index entry of the data may include basic information and location information of the following data. Specifically, the basic information of the data may include the following types of information: socket (virtual resource pool), key (file name), version_id (Version number), object_type (Type), insert_time (Insert Time), last_time (Last update Time), and Size Object Size (Size); the location information of the data includes: is_backup (Backup identification), dev_id (Block device Id), block_id (Block number), seg_id (segment number), size (segment Size), stime (segment start time), etime (segment end time).

Further, the key information in the index entry may include at least the following types of information: socket (virtual resource pool), key (file name), and version_id (Version number), and the Key information included in all pieces of information for all pieces of index information of the same stored data are the same.

Accordingly, since the key information included in each information entry in the auxiliary information table is used to determine all index entries of the target data corresponding to the information entry in the index information table, the key information included in the information entry may be the key information included in all corresponding index entries.

Further, since the auxiliary information table corresponds to the index information table, the information entry included in the auxiliary information table is updated with the update of the index information table. Each entry in the auxiliary information table may be generated in various manners, which is not specifically limited in this embodiment of the present invention.

after the storage of any data is completed, the storage node receives the synchronous storage time of the data and key information in an index entry of the data;

After each data is stored, the storage node generates an index entry of the data and synchronizes the index entry to the management server so that the management server can update the stored index information table. Based on this, after any data storage or update is completed, the storage node may synchronize the storage time of the data and the key information in the index entry of the data to the management server while synchronizing the index entry to the management server. Thus, the management server can search the auxiliary information table for whether the information item comprising the received key information exists after receiving the storage time of the data and the key information in the index item of the data.

In this way, if found, it is explained that the data is not stored in the storage node for the first time, but stored in the storage node again after being updated, and there is already an information entry for the data in the auxiliary information table, that is, the found information entry is an information entry corresponding to the index entry for the data. Further, the management server can update the storage time included in the existing information item to the received storage time, thereby obtaining an updated information item.

Accordingly, if not found, the data is first stored in the storage node when the data is described, and no information item about the data exists in the auxiliary information table. Furthermore, the management server may add a new information entry to the auxiliary information table, and the key information and the storage time included in the new information entry may be the received key information and the storage time.

Optionally, in another specific implementation manner, the generating manner of each information item in the auxiliary information table includes:

receiving an index entry and storage time of the data synchronized by a storage node after any data is stored, and extracting key information from the received index entry;

After each data is stored, the storage node generates an index entry of the data and synchronizes the index entry to the management server so that the management server can update the stored index information table. Based on this, after any data storage or update is completed, the storage node may synchronize the storage time of the data to the management server while synchronizing the index entry to the management server after generating the index entry of the data. Thus, the management server can extract the key information from the index entry of the data after receiving the storage time of the data and the index entry of the data, and further searches the auxiliary information table for whether the information entry comprising the received key information exists.

Accordingly, if not found, the data is first stored in the storage node when the data is described, and no information item about the data exists in the auxiliary information table. Further, the management server may add a new information entry to the auxiliary information table, and the key information and the storage time included in the new information entry may be the extracted key information and the received storage time.

It may be understood that, when the management server performs data deletion, the index entry of the data and the data may be deleted synchronously, and in the embodiment of the present invention, the index entry to be deleted may be determined according to the auxiliary information table, so the management server may first obtain the auxiliary information table corresponding to the index information table to be deleted. Further, after the auxiliary information table is obtained, the management server can screen the target information items included in the auxiliary information table, the storage time of which meets a predetermined screening condition, from among the information items of the auxiliary information table.

Specifically, for each information item in the auxiliary information table, the management server may determine whether the storage time included in the information item meets a predetermined filtering condition.

Wherein, since the management server finally deletes the index entry of the data to be deleted, and the data to be deleted may be the outdated data, that is, the index entry to be deleted by the management server is the index entry of the data with the storage time longer than the preset storage period, when determining whether the storage time contained in the information entry meets the preset screening condition, the management server determines that: the information item includes whether the time interval between the storage time and the current system time is not less than a preset storage period.

Obviously, when the time interval between the storage time contained in the information item and the current system time is not smaller than the preset storage period, the storage duration of the data corresponding to the information item is equal to or greater than the preset storage period, and further, the data corresponding to the information item is the data to be deleted. Further, the management server may determine the information item as a target information item containing a storage time meeting a predetermined filtering condition. That is, the target information items obtained by the management server from the auxiliary information table are: the time interval between the storage time and the current system time is not less than the information item of the preset storage period.

Because the data corresponding to the target information items obtained by screening is the data to be deleted, the management server can delete all index items of which the index information table is matched with the key information included in each target information item.

Specifically, the management server may first determine, from the index information table, all index entries matching the key information included in each target information entry as index entries of the data to be deleted, and then the management server may delete the determined index entries of each data to be deleted.

Optionally, the manner of determining, by the management server, all index entries matching the key information included in each target information entry from the index information table may be:

for each target information item, all index entries including the key information included in the target information item are determined from the index information table as all index entries matching the key information included in the target information item.

The management server may transmit time point information characterizing the target time point to the storage node while the management server deletes the respective index entries.

The target time point is before the current system time, and the time difference between the target time point and the current system time is a time point of a preset storage period, so that for each data stored in the storage node, when the storage time of the data is later than the target time point, the storage time of the data in the storage node is smaller than the preset storage period, and further, the storage time of the data can be indicated to not reach the preset storage period, and therefore, the data is not the expiration data to be deleted.

Correspondingly, when the storage time of the data is equal to or earlier than the target time point, the storage time of the data in the storage node is equal to or longer than a preset storage period. Further, it may be explained that the storage period of the data reaches the preset storage period, and thus, the data may be data to be deleted.

Based on the above, the storage node can determine the target time point corresponding to the time point information after receiving the time point information sent by the management server, and then delete the data with the storage time not later than the target time point from the stored data.

The time point information may be represented in various manners, for example, the time point information may be a specific time point, where the specific time point is a time point before the current system time and a time difference between the specific time point and the current system time is a preset storage period; the time point information can also be a time period, and the time period is a preset storage period; this is reasonable. The embodiment of the present invention is not particularly limited in this regard.

The following describes a data deleting method applied to a storage node according to an embodiment of the present invention.

Fig. 2 is a schematic diagram of a data deleting method applied to a storage node, where the storage node may be any electronic device used for storing various data in a data storage system, for example, a notebook computer, a desktop computer, etc., and the embodiment of the present invention is not limited in particular, and is hereinafter referred to as a storage node.

As shown in fig. 2, a data deleting method applied to a storage node according to an embodiment of the present invention may include the following steps:

s201: acquiring time point information sent by a management server;

s202: determining a target time point represented by the time point information;

wherein, the target time point is: the time difference between the current system time and the current system time is the time point of the preset storage period.

S203: and deleting the data with the storage time not later than the target time point from the stored data.

After the storage node acquires the time point information sent by the management server, the storage node can determine a target time point represented by the time point information, wherein the target time point is: the time difference between the current system time and the current system time is the time point of the preset storage period.

Furthermore, since the target time point is before the current system time and the time difference between the target time point and the current system time is the time point of the preset storage period, when the storage time of each piece of data stored in the storage node is later than the target time point, the storage time of the piece of data in the storage node is smaller than the preset storage period, and further, the storage time of the piece of data can be indicated to not reach the preset storage period, so that the piece of data is not the expiration data to be deleted.

Based on this, the storage node can delete the data stored at a time not later than the target time point from the stored data.

The above can be seen that, by applying the scheme provided by the embodiment of the invention, the storage node can delete all the expiration data at one time according to the target time point, and does not need to rely on the index entry obtained by screening to determine the expiration data to be deleted and then delete the expiration data. Based on the above, the scheme provided by the embodiment of the invention can improve the deleting speed of the expired data in the storage node, and further improve the releasing speed of the storage space in the storage node.

It will be appreciated that, among the data stored by the storage node, there may be data having a storage period greater than the above-mentioned preset storage period. The data deleted in the step S203 is: the storage time is no later than the time before the current system time, and the time difference between the storage time and the current system time is the data of the time point of the preset storage period, namely the deleted data is: in order to accurately delete the expired data, the method for deleting the data with the time interval between the stored time and the current system time not less than the preset storage period but with the storage period greater than the preset storage period, and causing erroneous deletion, optionally, in a specific implementation manner, as shown in fig. 3, the method for deleting the data with the storage time not later than the target time point in the stored data by the storage node may include the following steps:

S301: searching data with storage time not later than a target time point from the stored data;

s302: if the searched data is not in the locking state, deleting the searched data;

In this implementation, after determining the target time point, the storage node may search the stored data for each data with a storage time not later than the target time point.

The target time point is a time point before the current system time and a time difference from the current system time is a time point of a preset storage period, so that for each data stored in the storage node, when the storage time of the data is later than the target time point, the storage time of the data in the storage node is smaller than the preset storage period. Further, it may be explained that the storage period of the data has not reached the preset storage period, and therefore, the data is not data to be deleted.

Correspondingly, when the storage time of the data is equal to or earlier than the target time point, the storage time of the data in the storage node is equal to or longer than a preset storage period. Furthermore, it can be explained that the storage duration of the data reaches the preset storage period. When the storage period of the data is not greater than the preset storage period, the data is the data to be deleted, and when the storage period of the data is greater than the preset storage period, the data is not the data to be deleted. Based on this, the storage node needs to further determine whether the data is in a locked state after determining that the storage duration of the data reaches the preset storage period.

Based on this, the storage node can further determine, for each piece of data for which the storage time is not later than the above-described target time point, whether the data is in a locked state.

The lock state is set when the storage node determines that the storage time of the stored data is not later than the target time point, but the storage period of the stored data is greater than the preset storage period, so if the searched data is not in the lock state, the storage period of the data is not greater than the preset storage period. Thus, the data is to be deleted, and the storage node can delete the data.

When the management server is a CVM and the storage node is a CVS, the CVS may be completed by calling a VFS (Virtual File System ) for assisting in managing the underlying disk medium when deleting the data to be deleted.

In this embodiment, the storage node may determine and delete the data to be deleted according to the storage time and the size relationship between the storage period and the preset storage period of the stored data, so as to improve the deletion speed, and further improve the efficiency of the storage node in releasing the storage space.

Corresponding to the data deleting method applied to the management server provided by the embodiment of the invention, the embodiment of the invention also provides a data deleting device applied to the management server.

Fig. 4 is a schematic structural diagram of a data deleting device applied to a management server according to an embodiment of the present invention. As shown in fig. 4, the data deleting apparatus applied to the management server may include the following modules:

an information table obtaining module 410, configured to obtain an auxiliary information table corresponding to the index information table to be deleted; wherein each information item in the auxiliary information table includes: the key information is used for determining all index entries of the target data corresponding to the information entries in the index information table, and the storage time is as follows: the time of storing the target data last time from the current system time;

an information item screening module 420, configured to screen, from each information item in the auxiliary information table, a target information item that includes a storage time that meets a predetermined screening condition, where the predetermined screening condition is: the time interval between the current system time and the current system time is not smaller than a preset storage period;

A first data deleting module 430, configured to delete all index entries in the index information table, where the index entries match key information included in each target information entry, and send time point information to a storage node, so that the storage node deletes data in the stored data, where the storage time is no later than a target time point;

Optionally, in a specific implementation manner, the data deleting device applied to the management server may further include: an information item generation module for generating each information item in the auxiliary information table;

Fig. 5 is a schematic structural diagram of a data deleting device applied to a storage node according to an embodiment of the present invention. As shown in fig. 5, the data deleting apparatus applied to the storage node may include the following modules:

a time point information obtaining module 510, configured to obtain time point information sent by the management server;

a time point determining module 520, configured to determine a target time point represented by the time point information; wherein the target time point is: before the current system time, the time difference between the current system time and the current system time is a time point of a preset storage period;

and a second data deleting module 530, configured to delete data with a storage time not later than the target time point from the stored data.

Alternatively, in one specific implementation, the second data deleting module 630 may be specifically configured to: searching data with storage time not later than the target time point from the stored data; if the searched data is not in the locking state, deleting the searched data; wherein, the locking state is: and setting when the storage time of the stored data is not later than the target time point but the storage period of the stored data is larger than the preset storage period.

Corresponding to the data deleting method applied to the management server provided in the above embodiment of the present invention, the embodiment of the present invention further provides a management server, as shown in fig. 6, including a processor 601, a communication interface 602, a memory 603, and a communication bus 604, where the processor 601, the communication interface 602, and the memory 603 complete communication with each other through the communication bus 604,

a memory 603 for storing a computer program;

the processor 601 is configured to implement the data deletion method applied to the management server provided in the embodiment of the present invention when executing the program stored in the memory 603.

Specifically, the data deleting method applied to the management server includes:

It should be noted that, other implementation manners of the data deleting method applied to the management server, which are implemented by the processor 601 executing the program stored in the memory 603, are the same as the embodiments of the data deleting method applied to the management server provided in the foregoing method embodiment, and are not repeated herein.

Corresponding to the data deleting method applied to the storage node provided in the above embodiment of the present invention, the embodiment of the present invention further provides a storage node, as shown in fig. 7, including a processor 701, a communication interface 702, a memory 703 and a communication bus 704, where the processor 701, the communication interface 702 and the memory 703 complete communication with each other through the communication bus 704,

A memory 703 for storing a computer program;

the processor 701 is configured to implement the data deletion method applied to the storage node provided in the above embodiment of the present invention when executing the program stored in the memory 703.

Specifically, the data deleting method applied to the storage node includes:

acquiring time point information sent by a management server;

It should be noted that, other implementation manners of the data deleting method applied to the storage node, which are implemented by the processor 701 executing the program stored in the memory 703, are the same as the embodiments of the data deleting method applied to the storage node provided in the foregoing method embodiment, and are not repeated herein.

The communication buses mentioned above for the management server and the storage node may be peripheral component interconnect standard (Peripheral Component Interconnect, PCI) buses or extended industry standard architecture (Extended Industry Standard Architecture, EISA) buses, etc. The communication bus may be classified as an address bus, a data bus, a control bus, or the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.

The communication interface is used for communication between the management server and the storage node and other devices.

The Memory may include random access Memory (Random Access Memory, RAM) or may include Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the aforementioned processor.

The processor may be a general-purpose processor, including a central processing unit (Central Processing Unit, CPU), a network processor (Network Processor, NP), etc.; but also digital signal processors (Digital Signal Processing, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

Corresponding to the data deleting method applied to the management server provided by the embodiment of the invention, the embodiment of the invention also provides a computer readable storage medium, and the computer program realizes the data deleting method applied to the management server provided by the embodiment of the invention when being executed by a processor.

Corresponding to the data deleting method applied to the storage node provided by the embodiment of the invention, the embodiment of the invention also provides a computer readable storage medium, and the computer program is executed by the processor to realize the data deleting method applied to the storage node provided by the embodiment of the invention.

It is noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

In this specification, each embodiment is described in a related manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for the apparatus embodiment, the management server embodiment, the storage node embodiment, the computer readable storage medium embodiment, since they are substantially similar to the method embodiment, the description is relatively simple, and the relevant points are referred to in the partial description of the method embodiment.

The foregoing description is only of the preferred embodiments of the present invention and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention are included in the protection scope of the present invention.

Claims

1. A data deletion method, applied to a management server, comprising:

2. The method of claim 1, wherein the manner in which each information entry in the auxiliary information table is generated comprises:

3. The method of claim 1, wherein the manner in which each information entry in the auxiliary information table is generated comprises:

4. A method of deleting data, applied to a storage node, the method comprising:

acquiring time point information sent by a management server;

Deleting data with storage time not later than the target time point from the stored data;

the step of deleting the data stored in the storage device, wherein the storage time of the data is not later than the target time point, comprises the following steps:

if the searched data is not in the locking state, deleting the searched data;

5. A data deletion apparatus for application to a management server, the apparatus comprising:

6. The apparatus of claim 5, wherein the apparatus further comprises: an information item generation module for generating each information item in the auxiliary information table;

7. The apparatus of claim 5, wherein the apparatus further comprises: an information item generation module for generating each information item in the auxiliary information table;

8. A data deletion apparatus for application to a storage node, the apparatus comprising:

the time point determining module is used for determining a target time point represented by the time point information; wherein the target time point is: before the current system time, the time difference between the current system time and the current system time is a time point of a preset storage period;

The second data deleting module is used for deleting data with the storage time not later than the target time point from the stored data;

the second data deleting module is specifically configured to:

9. The management server is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;

a memory for storing a computer program;

a processor for carrying out the method steps of any one of claims 1-3 when executing a program stored on a memory.

10. The storage node is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory are communicated with each other through the communication bus;

A memory for storing a computer program;

a processor for implementing the method steps of claim 4 when executing a program stored on a memory.

11. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of any of claims 1-3.

12. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program which, when executed by a processor, implements the method steps of claim 4.