Method, electronic device and computer program product for storage management

By obtaining the data change rate of the data source and the recovery ability of the backup system, dynamically adjusting the backup strategy, solving the problem that traditional backup strategies cannot meet the recovery time objectives and storage space optimization, and achieving more efficient backup management.

CN115202924BActive Publication Date: 2025-08-19EMC IP HLDG CO LLC
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202110387812.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-04-09
Publication Date
2025-08-19
Estimated Expiration
2041-04-09

AI Technical Summary

Technical Problem

In traditional storage management methods, backup strategies are difficult to dynamically adjust according to the data change rate and recovery capabilities of different data sources, resulting in the inability to meet the recovery time objectives and optimization requirements of storage space.

Method used

By obtaining the data change rate of the data source and the recovery capability of the backup system, dynamically determine the backup strategy, including the timing of full and incremental backups, to meet the recovery time objectives and save storage space.

Benefits of technology

It improves the efficiency of the backup system, meets the optimization needs of recovery time goals and storage space, and improves the user experience.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115202924B_ABST
    Figure CN115202924B_ABST
Patent Text Reader

Abstract

Embodiments of the present disclosure relate to methods, electronic devices, and computer program products for storage management. According to an exemplary implementation of the present disclosure, a storage management method includes: obtaining a data change rate of a data source, where the data change rate indicates the rate at which data to be backed up appears in the data source; obtaining a recovery capability of a backup system for restoring the backed-up data; and determining a backup policy for backing up the data to be backed up based on the data change rate and the recovery capability. This improves backup performance.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] Embodiments of the present disclosure relate generally to storage management, and more particularly to methods, electronic devices, and computer program products for storage management. Background Art

[0002] Backup policies are created to automatically perform backup operations using a backup system. A backup policy can specify the storage location of the backup data and the frequency of performing backup operations. In addition, the backup type can be specified in the backup policy. There are different backup types, such as full backups and non-full backups (such as differential backups and incremental backups). Different backup types have different advantages and disadvantages. From the perspective of the backup data producer, full backups require longer backup times and larger backup space, while non-full backups require shorter backup times and less backup space. From the perspective of the backup data user, full backups have a shorter recovery time objective (RTO) than non-full backups. However, backup policies created by traditional storage management methods are inefficient. Summary of the Invention

[0003] Embodiments of the present disclosure provide methods, electronic devices, and computer program products for storage management.

[0004] In a first aspect of the present disclosure, a method for storage management is provided. The method includes: obtaining a data change rate of a data source, the data change rate indicating a rate at which data to be backed up appears in the data source; obtaining a recovery capability of a backup system for recovering the backed-up data; and determining a backup policy for backing up the data to be backed up based on the data change rate and the recovery capability.

[0005] In a second aspect of the present disclosure, an electronic device is provided. The device includes at least one processing unit and at least one memory. The at least one memory is coupled to the at least one processing unit and stores instructions for execution by the at least one processing unit. When executed by the at least one processing unit, the instructions cause the device to perform actions, including: obtaining a data change rate of a data source, the data change rate indicating a rate at which data to be backed up appears in the data source; obtaining a recovery capability of a backup system for restoring the backed-up data; and determining a backup policy for backing up the data to be backed up based on the data change rate and the recovery capability.

[0006] In a third aspect of the present disclosure, a computer program product is provided, which is tangibly stored on a non-transitory computer-readable medium and includes machine-executable instructions that, when executed, cause a machine to implement any step of the method described according to the first aspect of the present disclosure.

[0007] This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the disclosure, nor is it intended to limit the scope of the disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] The above and other objects, features and advantages of the present disclosure will become more apparent through a more detailed description of exemplary embodiments of the present disclosure with reference to the accompanying drawings, wherein like reference numerals generally represent like components throughout the exemplary embodiments of the present disclosure.

[0009] Figures 1A-1C shows a fixed backup strategy under different data change rates according to some embodiments of the present disclosure;

[0010] Figure 2 A schematic diagram illustrating an example of a storage management environment in which some embodiments of the present disclosure can be implemented;

[0011] Figures 3A-3C A schematic diagram illustrating examples of full backup, differential backup, and incremental backup according to some embodiments of the present disclosure;

[0012] Figure 4 A flowchart illustrating an example of a method for storage management according to some embodiments of the present disclosure;

[0013] Figures 5A-5C shows a dynamic backup strategy under different data change rates according to some embodiments of the present disclosure; and

[0014] Figure 6 A schematic block diagram of an example device that may be used to implement embodiments of the present disclosure is shown.

[0015] In the various drawings, the same or corresponding reference numerals denote the same or corresponding parts. DETAILED DESCRIPTION

[0016] The preferred embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although preferred embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. Rather, these embodiments are provided to make the present disclosure more thorough and complete, and to fully convey the scope of the present disclosure to those skilled in the art.

[0017] As used herein, the term "including" and its variations represent open inclusion, i.e., "including but not limited to." Unless otherwise stated, the term "or" means "and / or." The term "based on" means "based at least in part on." The terms "an example embodiment" and "an embodiment" mean "at least one example embodiment." The term "another embodiment" means "at least one additional embodiment." The terms "first," "second," etc. may refer to different or the same objects. Other explicit and implicit definitions may also be included below.

[0018] As described above, backup policies are created to automate backup operations using a backup system. Comprehensive backup policies need to be defined to meet recovery requirements within specific storage space constraints. Multiple backup types should be configured within a backup policy using separate schedules. Typically, schedules are configured with predetermined recurrences, such as hourly, daily, or weekly. A backup policy can include a combination of schedules, such as daily full backups and hourly incremental backups. Because most backups are incremental, which consume little storage space, such a backup policy can meet storage space requirements. Furthermore, the backup policy must consider the time required to restore the backed-up data. Some data sources can be offline for days without significant consequences. However, some data sources, such as high-priority servers, can tolerate only a few seconds of downtime without causing user dissatisfaction and negatively impacting the business. In these situations, it can be difficult for backup administrators to determine the appropriate schedule (e.g., frequency or interval) for each backup type, making it difficult to create an appropriate backup policy to meet the recovery time objectives for critical business data sources.

[0019] Specifically, in production environments, there are numerous protected data sources with backup requirements. These data sources have different data change rates and recovery time objectives. However, traditionally, a fixed backup strategy is simply used to back up these different data sources.

[0020] Figures 1A-1C FIG. 1 shows fixed backup strategies 100A-100C at different data change rates according to some embodiments of the present disclosure. Figure 1A As shown, in the time period t0-t17, the data change rate of data source 1 gradually decreases. Figure 1B As mentioned above, the data change rate of data source 2 is relatively stable. Figure 1C As shown, the data change rate of data source 3 gradually increases. However, for these data sources with different data change rates, full backups are triggered regularly at times t0, t7, and t14 at a fixed frequency or interval, and incremental backups are also triggered regularly at a fixed frequency or interval at other times.

[0021] Comparing the data changes between the intervals t0-t7 and t7-t14, we can see that data source 1 has decreased, while data source 3 has increased. In this case, the time required to perform an incremental backup and the time required to restore an incremental backup will also vary. This is because restoring an incremental backup requires sequentially restoring the most recent full backup and the intermediate incremental backups between that full backup and that incremental backup. Therefore, a series of backups must be restored to ensure that the backup data is recovered. Restoring later incremental backups (e.g., the incremental backups at times t6 and t13) will take longer.

[0022] For Data Source 1, since the incremental backups from time t1 to t5 are large, restoring these incremental backups takes a long time. This can cause the incremental backup at time t6 to fail to meet the RTO. In other words, the time required to restore the incremental backup at time t6 may exceed the RTO.

[0023] For data source 3, since the incremental backups at time t1-t6 are small, from the perspective of meeting the recovery time objective and saving storage space, more incremental backups should be performed before time t7 when the full backup is performed.

[0024] For Data Source 2, the backup strategy should be determined based on its data change rate, rather than manually determining a fixed backup strategy. However, traditionally, backup strategies rely entirely on the backup administrator's experience or guesswork. In a dynamically changing backup environment, such manually determined fixed backup strategies struggle to meet various service level requirements, such as recovery time objectives and storage space conservation.

[0025] It can be seen that a fixed backup strategy should not be used simply to back up data to be backed up from different data sources.

[0026] According to example embodiments of the present disclosure, an improved storage management solution is proposed. In this solution, the data change rate of a data source can be obtained. The data change rate indicates the rate at which data to be backed up appears in the data source. Furthermore, the recovery capability of the backup system for restoring the backed-up data can be obtained. Consequently, a backup strategy for backing up the data to be backed up can be determined based on the data change rate and the recovery capability.

[0027] In this way, the present solution can dynamically and intelligently determine a backup strategy while taking into account the data change rate of the data source and the recovery capability of the backup system, thereby improving the backup efficiency of the backup system and enhancing the user experience. The following will describe embodiments of the present disclosure in detail with reference to the accompanying drawings.

[0028] Figure 2A schematic diagram illustrates an example of a storage management environment 200 in which some embodiments of the present disclosure can be implemented. Storage management environment 200 includes a computing device 210, a data source 220, and a backup system 230. By way of example, computing device 210 can be any device with computing capabilities, such as a personal computer, a tablet computer, a wearable device, a cloud server, a mainframe, a distributed computing system, etc. Data source 220 can be any source from which data to be backed up originates, such as a bank information system, a school filing system, an information technology company database, etc. Backup system 230 can be any system with backup capabilities, such as a backup database, a distributed storage system, or the cloud.

[0029] The data to be backed up from the data source 220 can be backed up in the backup system 230. Different types of backups can be performed on the data to be backed up, such as full backup, differential backup, and incremental backup. Differential backup and incremental backup are sometimes also collectively referred to as non-full backups. Figures 3A-3C A schematic diagram illustrating examples of a full backup 300A, a differential backup 300B, and an incremental backup 300C according to some embodiments of the present disclosure is shown.

[0030] like Figure 3A As shown in , in a full backup, all data to be backed up is backed up each time. Figure 3B As shown in FIG, in differential backup, in a backup cycle, all the data to be backed up are backed up only in the first backup, and in subsequent backups, only the parts of the data to be backed up that are different from those in the first backup are backed up. Figure 3C As shown, in incremental backup, in one backup cycle, all the data to be backed up are backed up only in the first backup, and in subsequent backups, only the parts of the data to be backed up that are different from those in the previous backup are backed up.

[0031] The backup operation may be performed according to the backup policy. The computing device 210 may perform storage management operations to determine the backup policy for backing up the data to be backed up. Figure 4 The storage management operations performed by the computing device 210 are described in detail.

[0032] Figure 4 FIG. 4 is a flow chart showing a method 400 for storage management according to some embodiments of the present disclosure. The method 400 may be performed by: Figure 2 Alternatively, method 400 may be implemented by other entities besides computing device 210. It should be understood that method 400 may further include additional steps not shown and / or may omit steps shown, and the scope of the present disclosure is not limited in this respect.

[0033] At 410 , the computing device 210 obtains a data change rate of the data source 220 . The data change rate indicates a rate at which data to be backed up appears in the data source 220 .

[0034] The data change rate can be obtained in various ways. In some embodiments, the data change rate provided by the backup administrator based on their experience can be obtained. Alternatively, the data change rate can be predicted based on historical data change rates. To this end, in some embodiments, the computing device 210 can obtain the historical data change rate of the data source 220. The historical data change rate can indicate the occurrence rate of historical backup data in the data source 220. Thus, the computing device 210 can determine the data change rate based on the historical data change rate.

[0035] The historical data change rate can be obtained in various ways. In some embodiments, the computing device 210 can directly obtain the historical data change rate from the backup system 230 .

[0036] Alternatively, a backup operation in the backup system 230 may be referred to as a job. The job may include the size of the historical backup data and the time when the historical backup data was backed up. Thus, the computing device 210 may obtain the size of the historical backup data and the time when the historical backup data was backed up. The computing device 210 may then determine the historical data change rate based on the size of the historical backup data and the time when the historical backup data was backed up.

[0037] The computing device 210 can generate a data change rate model based on the historical data change rate, or based on the size of the historical backup data and the time when the historical backup data was backed up. For example, methods for generating the model include, but are not limited to, least squares polynomial fitting, simple linear regression, multivariate linear regression, nonlinear methods, trend extrapolation, decomposition analysis methods, exponential smoothing, state space models, Markov prediction methods, data mining, neural networks, etc. Thus, the computing device 210 can predict the data change rate based on the data change rate model.

[0038] At 420 , computing device 210 acquires the recovery capability of backup system 230 for restoring the backed-up data. For example, the recovery capability may include the recovery capability of the storage or network of backup system 230 .

[0039] The recovery capability can be obtained in various ways. In some embodiments, the computing device 210 can obtain the recovery capability directly from the backup system 230. Alternatively, in some embodiments, the computing device 210 can obtain the recovery rate and target recovery time for recovering the backed-up data. As an example, the recovery rate can represent the recovery capability per unit time, such as network bandwidth or available storage resources. In addition, the target recovery time can be the time that meets the recovery time target, such as 1 hour or 12 hours. Based on the recovery rate and the recovery time target, the computing device 210 can determine the amount of data that can be recovered during the target recovery time as the recovery capability. Since the target recovery time is the time that meets the recovery time target, the determined recovery capability also meets the recovery time target. More specifically, the determined recovery capability can be the maximum recovery capability that meets the recovery time target.

[0040] For example, the recovery capacity can be determined by the following equation (1):

[0041] s max =A*T (1),

[0042] where s max represents the recovery capability, A represents the recovery rate, and T represents the target recovery time.

[0043] At 430, computing device 210 determines a backup strategy for backing up the data to be backed up based on the data change rate and the recovery capability. In some embodiments, computing device 210 may determine a backup time for backing up the data to be backed up based on the data change rate and the recovery capability, where the amount of data to be backed up between the completion of the last backup and the backup time does not exceed the amount of data corresponding to the recovery capability. Thus, computing device 210 may determine a backup strategy based on the backup time.

[0044] For example, the amount of data to be backed up that occurs between the last backup completion and the backup time can be determined by the following equation (2):

[0045]

[0046] Among them F (t) Indicates the amount of data to be backed up from the completion of the last backup to the backup time. (t) represents the data change rate, t0 represents the time when the last backup was completed, and t represents the backup time.

[0047] Therefore, based on the above equations (1) and (2), the following equation (3) can be obtained:

[0048]

[0049] Where A represents the recovery rate, T represents the target recovery time, and f (t) represents the data change rate, t0 represents the time when the last backup was completed, and t represents the backup time.

[0050] Equation (3) above yields the backup time t, which ensures that the amount of data to be backed up accumulated from the completion of the last backup to the backup time does not exceed the amount corresponding to the recovery capability. As described above, since the recovery capability satisfies the recovery time objective, if the amount of data to be backed up does not exceed the amount corresponding to the recovery capability, the time required to restore the accumulated amount of data to be backed up after the backup is completed should also meet the recovery time objective.

[0051] Furthermore, in some embodiments, to save storage space while meeting recovery time objectives, full backups can be combined with incomplete backups. For example, incremental backups can be performed between two full backups. In this case, the determined backup time is the time of the next full backup. Furthermore, computing device 210 can determine the time of incremental backups between the time the previous backup is completed and the time of the next full backup. Thus, computing device 210 can determine a backup strategy based on the time of full backups and the time of incremental backups.

[0052] To this end, in some embodiments, in order to determine the backup strategy, the computing device 210 determines the time for incremental backup from the completion of the last backup to the backup time based on the backup time, and determines the backup strategy based on the incremental backup time.

[0053] Figures 5A-5C 500A-500C are shown for dynamic backup strategies at different data change rates according to some embodiments of the present disclosure. Figures 1A-1C ,exist Figures 5A-5C In the time period t0-t17, the data change rate of data source 1 gradually becomes lower, the data change rate of data source 2 is relatively stable, and the data change rate of data source 3 gradually becomes higher.

[0054] However, unlike Figures 1A-1C In the fixed backup strategy, full backups are performed at t0, t7, and t14 for all data sources. Figures 5A-5C FIG2 shows a dynamic backup strategy determined according to an embodiment of the present disclosure. This dynamic backup strategy is determined individually for each data source. Furthermore, even for the same data source, the interval between two full backups may vary due to changes in the data change rate.

[0055] Specifically, for data source 1, since the data change rate is high in the early stage, the second full backup can be advanced from t7 to t5. In addition, since the data change rate is low in the later stage, the third full backup can be delayed from t7 to t17.

[0056] For data source 3, since the data change rate is low in the early stage, more incremental backups can be performed before the second full backup. Therefore, the second full backup can be delayed from t7 to t11. In addition, since the data change rate is high in the later stage, the third full backup should be performed no later than t13.

[0057] For Data Source 2, the interval between full backups depends on its data change rate and recovery time objective. If the recovery time objective changes, the interval between full backups can be adjusted accordingly. If the recovery time objective is met, more incremental backups can be performed to reduce storage costs.

[0058] In this way, this solution can dynamically and intelligently predict the time to perform full and / or incomplete backups based on statistical methods, taking into account the data change rate of the data source and the recovery capabilities of the backup system, to determine the backup strategy. Furthermore, the backup strategy thus determined can also meet the recovery time objective. This significantly improves the backup system's backup efficiency and enhances the user experience.

[0059] Figure 6 1 shows a schematic block diagram of an example device 600 that can be used to implement embodiments of the present disclosure. Figure 2 The computing device 210 shown can be implemented by device 600. As shown, device 600 includes a central processing unit (CPU) 610, which can perform various appropriate actions and processes according to computer program instructions stored in a read-only memory (ROM) 620 or loaded from a storage unit 680 into a random access memory (RAM) 630. Various programs and data required for the operation of device 600 can also be stored in RAM 630. CPU 610, ROM 620, and RAM 630 are connected to each other via a bus 640. An input / output (I / O) interface 650 is also connected to bus 640.

[0060] Multiple components in device 600 are connected to I / O interface 650, including an input unit 660, such as a keyboard, mouse, etc.; an output unit 670, such as various types of displays, speakers, etc.; a storage unit 680, such as a magnetic disk, optical disk, etc.; and a communication unit 690, such as a network card, modem, wireless communication transceiver, etc. The communication unit 690 allows device 600 to exchange information / data with other devices via a computer network such as the Internet and / or various telecommunication networks.

[0061] The various processes and processing described above, such as process 400, may be performed by processing unit 610. For example, in some embodiments, process 400 may be implemented as a computer software program that is tangibly embodied in a machine-readable medium, such as storage unit 680. In some embodiments, part or all of the computer program may be loaded and / or installed onto device 600 via ROM 620 and / or communication unit 690. When the computer program is loaded into RAM 630 and executed by CPU 610, one or more actions of process 400 described above may be performed.

[0062] The present disclosure may be a method, an apparatus, a system and / or a computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for executing various aspects of the present disclosure.

[0063] A computer-readable storage medium can be a tangible device that can hold and store instructions for use by an instruction execution device. A computer-readable storage medium can be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination thereof. More specific examples (a non-exhaustive list) of computer-readable storage media include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a raised structure in a groove on which instructions are stored, and any suitable combination thereof. As used herein, a computer-readable storage medium is not to be construed as a transient signal per se, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., a light pulse through a fiber optic cable), or an electrical signal transmitted through an electrical wire.

[0064] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to each computing / processing device, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter card or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions to be stored in the computer-readable storage medium in each computing / processing device.

[0065] The computer program instructions for performing the operations of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" language or similar programming languages. Computer-readable program instructions may be executed entirely on a user's computer, partially on a user's computer, as an independent software package, partially on a user's computer, partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., utilizing an Internet service provider to connect via the Internet). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), may be personalized by utilizing the state information of the computer-readable program instructions. The electronic circuit may execute the computer-readable program instructions, thereby realizing various aspects of the present disclosure.

[0066] Various aspects of the present disclosure are described herein with reference to flowcharts and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present disclosure. It should be understood that each block of the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer-readable program instructions.

[0067] These computer-readable program instructions can be provided to a processing unit of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine such that when these instructions are executed by the processing unit of the computer or other programmable data processing device, a device is generated that implements the functions / actions specified in one or more blocks in the flowchart and / or block diagram. These computer-readable program instructions can also be stored in a computer-readable storage medium, where these instructions cause the computer, programmable data processing device, and / or other device to operate in a specific manner. Thus, the computer-readable medium storing the instructions comprises an article of manufacture that includes instructions for implementing various aspects of the functions / actions specified in one or more blocks in the flowchart and / or block diagram.

[0068] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device so that a series of operational steps are performed on the computer, other programmable data processing apparatus, or other device to produce a computer-implemented process, thereby causing the instructions executed on the computer, other programmable data processing apparatus, or other device to implement the functions / actions specified in one or more blocks in the flowchart and / or block diagram.

[0069] The flow charts and block diagrams in the accompanying drawings show the possible architecture, functions and operations of the systems, methods and computer program products according to multiple embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a part of a module, program segment or instruction, and the part of the module, program segment or instruction contains one or more executable instructions for realizing the prescribed logical function. In some alternative implementations, the functions marked in the box can also occur in a sequence different from that marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented by a dedicated hardware-based system that performs the prescribed function or action, or can be implemented by a combination of dedicated hardware and computer instructions.

[0070] While various embodiments of the present disclosure have been described above, the foregoing description is intended to be illustrative, non-exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is selected to best explain the principles of the embodiments, their practical applications, or technical improvements to existing technologies, or to enable others skilled in the art to understand the embodiments disclosed herein.

Claims

1. A method for storage management, comprising: Acquire a data change rate of a data source, where the data change rate indicates an occurrence rate of data to be backed up in the data source, wherein acquiring the data change rate comprises: Acquiring a historical data change rate of the data source, where the historical data change rate indicates an appearance rate of historical backup data in the data source; and Determining the data change rate based on the historical data change rate; Obtaining a restore capability of the backup system for restoring backed-up data; and Determining a backup strategy for backing up the data to be backed up based on the data change rate and the recovery capability, wherein determining the backup strategy includes: Determine a backup time for backing up the data to be backed up based on the data change rate and the recovery capability, wherein: The amount of data to be backed up that occurs during the period from the completion of the last backup to the backup time does not exceed the amount of data corresponding to the recovery capacity, and The length of the period from the last backup completion to the backup time varies based on the data change rate and the recovery capability, and Determining the backup strategy based on the backup time; and The data is backed up according to the backup policy.

2. The method according to claim 1, wherein obtaining the historical data change rate comprises: Obtaining the size of the historical backup data and the time when the historical backup data was backed up; as well as Based on the size and the time, a rate of change of the historical data is determined.

3. The method according to claim 1, wherein acquiring the recovery capability comprises: Obtaining a recovery rate and a target recovery time for restoring the backed-up data; as well as Based on the recovery rate and the target recovery time, the amount of data that can be recovered during the target recovery time is determined as the recovery capability.

4. The method of claim 1 , wherein the last backup is a full backup, and determining the backup strategy comprises: Based on the backup time, determining a time for performing incremental backups from the completion of the last backup to the backup time; as well as The backup strategy is determined based on the time of the incremental backup.

5. An electronic device comprising: at least one processing unit; at least one memory coupled to the at least one processing unit and storing instructions for execution by the at least one processing unit, the instructions, when executed by the at least one processing unit, causing the apparatus to perform actions comprising: Acquire a data change rate of a data source, where the data change rate indicates an occurrence rate of data to be backed up in the data source, wherein acquiring the data change rate comprises: Acquiring a historical data change rate of the data source, where the historical data change rate indicates an appearance rate of historical backup data in the data source; and Determining the data change rate based on the historical data change rate; Obtaining a restore capability of the backup system for restoring backed-up data; and Determining a backup strategy for backing up the data to be backed up based on the data change rate and the recovery capability, wherein determining the backup strategy includes: Determine a backup time for backing up the data to be backed up based on the data change rate and the recovery capability, wherein: The amount of data to be backed up that occurs during the period from the completion of the last backup to the backup time does not exceed the amount of data corresponding to the recovery capacity, and The length of the period from the last backup completion to the backup time varies based on the data change rate and the recovery capability, and Determining the backup strategy based on the backup time; and The data is backed up according to the backup policy.

6. The device according to claim 5, wherein obtaining the historical data change rate comprises: Obtaining the size of the historical backup data and the time when the historical backup data was backed up; as well as Based on the size and the time, a rate of change of the historical data is determined.

7. The apparatus according to claim 5, wherein acquiring the recovery capability comprises: Obtaining a recovery rate and a target recovery time for restoring the backed-up data; as well as Based on the recovery rate and the target recovery time, the amount of data that can be recovered during the target recovery time is determined as the recovery capability.

8. The apparatus of claim 5, wherein the last backup is a full backup, and determining the backup strategy comprises: Based on the backup time, determining a time for performing incremental backups from the completion of the last backup to the backup time; as well as The backup strategy is determined based on the time of the incremental backup.

9. A computer program product tangibly stored on a non-transitory computer readable medium and comprising machine-executable instructions which, when executed, cause a machine to perform the steps of the method according to any one of claims 1 to 4.

Citation Information

Patent Citations

  • Automated and self-adjusting data protection driven by business and data activity events

    US20120089572A1

  • Intelligent backup escalation system

    US8260750B1