CN113297009B - Information backup method, equipment, platform and storage medium - Google Patents

Information backup method, equipment, platform and storage medium Download PDF

Info

Publication number
CN113297009B
CN113297009B CN202110572288.XA CN202110572288A CN113297009B CN 113297009 B CN113297009 B CN 113297009B CN 202110572288 A CN202110572288 A CN 202110572288A CN 113297009 B CN113297009 B CN 113297009B
Authority
CN
China
Prior art keywords
backup
determining
data
read
time
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110572288.XA
Other languages
Chinese (zh)
Other versions
CN113297009A (en
Inventor
梁梓锋
胡盼盼
卢道和
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
WeBank Co Ltd
Original Assignee
WeBank Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by WeBank Co Ltd filed Critical WeBank Co Ltd
Priority to CN202110572288.XA priority Critical patent/CN113297009B/en
Publication of CN113297009A publication Critical patent/CN113297009A/en
Priority to PCT/CN2021/136338 priority patent/WO2022247219A1/en
Application granted granted Critical
Publication of CN113297009B publication Critical patent/CN113297009B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1448Management of the data involved in backup or backup restore
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1458Management of the backup or restore process
    • G06F11/1464Management of the backup or restore process for networked environments
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/14Error detection or correction of the data by redundancy in operation
    • G06F11/1402Saving, restoring, recovering or retrying
    • G06F11/1446Point-in-time backing up or restoration of persistent data
    • G06F11/1458Management of the backup or restore process
    • G06F11/1469Backup restoration techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the application discloses an information backup method, which comprises the following steps: determining the current recovery efficiency of the information backup node for backing up and recovering the data currently; determining a current first read-write flow of a shared storage area corresponding to an instance to be backed up based on the current recovery efficiency; the first read-write flow is required when the target backup data of the instance to be backed up is backed up to the shared storage area; determining backup time for backing up the target backup data based on the first read-write flow; and backing up the target backup data to the shared storage area at the moment corresponding to the backup time. The embodiment of the application also discloses an information backup device, a platform and a storage medium.

Description

Information backup method, equipment, platform and storage medium
Technical Field
The present disclosure relates to the field of computer applications, and in particular, to an information backup method, an information backup device, an information backup platform, and a storage medium.
Background
With the rapid development of computer technology, more and more technologies are applied in the financial field, and the traditional financial industry is gradually changed to the financial technology (Fintech), but due to the requirements of safety and real-time performance of the financial industry, higher requirements are also put on the technologies. The information backup becomes an indispensable application in each application field of the computer, and the information is backed up, so that when the computer system or the application breaks down and crashes, the information can be quickly restored according to the backed up information, and various losses are effectively reduced. At present, with the wide application of database examples, if manual backup operation is adopted, the working efficiency is lower in the backup and recovery processes, so that a backup scheduling system is provided, and the client device is controlled to complete unified backup by uniformly configuring a backup strategy through the server device. Wherein the server device typically uses a pattern of a constant number of concurrent copies (e.g., a maximum of 10 concurrent backup processes at the same time) to limit the concurrent copies.
However, using a constant concurrency number may cause a situation that, for example, when the concurrency number is too high, the read-write flow is too large, so that the shared storage is not dead, or the concurrency number is adjusted too small, so that the shared storage resources cannot be reasonably utilized, the resource utilization rate is low, the backup efficiency is low, and the backup timeliness cannot be satisfied.
Content of the application
In order to solve the technical problems, the embodiment of the application expects to provide an information backup method, device, platform and storage medium, which solve the problem that the backup efficiency is low in the concurrent backup process of limiting the concurrent number by using a constant concurrent number in the current backup system, can fully utilize backup resources, improve the backup efficiency and effectively meet the backup aging.
The technical scheme of the application is realized as follows:
in a first aspect, an information backup method, the method being applied to an information backup node, the method comprising:
determining the current recovery efficiency of the information backup node for backing up and recovering the data currently;
determining a current first read-write flow of a shared storage area corresponding to an instance to be backed up based on the current recovery efficiency; the first read-write flow is required when the target backup data of the instance to be backed up is backed up to the shared storage area;
Determining backup time for backing up the target backup data based on the first read-write flow;
and backing up the target backup data to the shared storage area at the moment corresponding to the backup time.
In a second aspect, an information backup apparatus, the apparatus comprising: memory, processor, and communication bus; wherein:
the memory is used for storing executable instructions;
the communication bus is used for realizing communication connection between the processor and the memory;
the processor is configured to execute the information backup program stored in the memory, and implement the steps of the information backup method according to any one of the foregoing claims.
In a third aspect, an information backup platform, the platform comprising: at least one running node and a shared storage area; wherein:
determining an information backup node from at least one operation node;
implementing, by the information backup node, the steps of the information backup method according to any one of the above;
and the shared storage area is used for storing the target backup data backed up by the information backup node.
In a fourth aspect, a storage medium has stored thereon an information backup program that, when executed by a processor, implements the steps of the information backup method as set forth in any one of the preceding claims.
In the embodiment of the application, after the information backup node determines the current recovery efficiency of backing up and recovering the data, based on the current recovery efficiency, the current first read-write flow of the shared storage area corresponding to the instance to be backed up is determined, and based on the first read-write flow, after the backup time of the backup target backup data is determined, the backup target backup data is started to the shared storage area at the moment corresponding to the backup time, so that the backup time of the target backup data is dynamically determined according to the current first read-write flow of the shared storage area, the problem that the backup efficiency is lower in the concurrent backup process of limiting the current concurrent number by using the constant backup system is solved, the backup resources can be fully utilized, the backup efficiency is improved, and the backup time is effectively met.
Drawings
Fig. 1 is a schematic flow chart of an information backup method provided in an embodiment of the present application;
fig. 2 is a flow chart of another information backup method according to an embodiment of the present application;
fig. 3 is a flow chart of another information backup method according to an embodiment of the present application;
fig. 4 is a flowchart of an information backup method according to another embodiment of the present application;
FIG. 5 is a flowchart illustrating another information backup method according to another embodiment of the present disclosure;
FIG. 6 is a flowchart illustrating another information backup method according to another embodiment of the present disclosure;
FIG. 7 is a diagram of a system architecture according to an embodiment of the present application;
fig. 8 is a flowchart of an information backup method according to another embodiment of the present application;
FIG. 9 is a schematic diagram of an operational cycle provided in an embodiment of the present application;
fig. 10 is a schematic structural diagram of an information backup device according to an embodiment of the present application;
fig. 11 is a schematic structural diagram of an information backup platform according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application.
An embodiment of the present application provides an information backup method, referring to fig. 1, where the method is applied to an information backup node, the method includes the following steps:
and step 101, determining the current recovery efficiency of the information backup node for carrying out backup recovery on the data currently.
In this embodiment of the present application, the information backup node is one node of a plurality of running database instance nodes included in the information backup platform, where the information backup node may perform management control on other nodes in the information backup platform, and when the information backup node fails, the information backup platform may continue to select one node from the other nodes to serve as the information backup node, so as to ensure high availability in the management control process. The current recovery efficiency of the information backup node for performing backup recovery on the data is expected recovery efficiency when the information backup node performs backup recovery on the lost data.
Step 102, determining a current first read-write flow of the shared storage area corresponding to the instance to be backed up based on the current recovery efficiency.
The first read-write flow is required when backing up target backup data of an instance to be backed up to the shared storage area.
In the embodiment of the application, the shared storage area may be a shared storage cluster for implementing shared storage. The instance to be backed up may be the next instance, of the plurality of instances to be backed up, that is adjacent to the instance currently being backed up. Analyzing the current recovery efficiency, and determining the current first read-write flow of the shared storage area corresponding to the instance to be backed up when the current recovery efficiency meets a certain condition, wherein the first read-write flow is used for representing the maximum read-write flow which may be occupied when the target backup data of the instance to be backed up is written when other data are currently being read and written in the shared storage area.
Step 103, determining the backup time of the backup target backup data based on the first read-write flow.
In the embodiment of the present application, the first read-write flow is analyzed, and the backup time for backing up the target backup data corresponding to the first read-write flow is determined.
And 104, backing up the target backup data to the shared storage area at the moment corresponding to the backup time.
In the embodiment of the application, the target backup data is backed up to the shared storage area at the moment corresponding to the determined backup time, so that the dynamic backup process of the backup data is realized, and the situation that the shared storage is not available due to the fact that the read-write flow of the shared storage area does not accord with the first read-write flow when the target backup data is backed up at the fixed moment is effectively avoided.
In the embodiment of the application, after the information backup node determines the current recovery efficiency of backing up and recovering the data, based on the current recovery efficiency, the current first read-write flow of the shared storage area corresponding to the instance to be backed up is determined, and based on the first read-write flow, after the backup time of the backup target backup data is determined, the backup target backup data is started to the shared storage area at the moment corresponding to the backup time, so that the backup time of the target backup data is dynamically determined according to the current first read-write flow of the shared storage area, the problem that the backup efficiency is lower in the concurrent backup process of limiting the current concurrent number by using the constant backup system is solved, the backup resources can be fully utilized, the backup efficiency is improved, and the backup time is effectively met.
Based on the foregoing embodiments, an embodiment of the present application provides an information backup method, referring to fig. 2, where the method is applied to an information backup node, the method includes the following steps:
step 201, obtaining the data change quantity of the instance to be backed up at the current moment.
In this embodiment of the present application, the data variable amount of the current time of the to-be-backed-up instance refers to new data generated during the operation of the to-be-backed-up instance from the last time of the latest time of the to-be-backed-up instance to the current time. The time when the data change amount of the current time of the to-be-backed-up instance is obtained may be determined according to backup configuration information configured in advance for the to-be-backed-up instance, where the backup initiation time of backing up the earliest to-be-backed-up instance is set in the backup configuration information. However, in some application scenarios, a period for acquiring the data variable amount may be set in the backup configuration information, that is, the data variable amount of the instance to be backed up is periodically detected, so as to perform subsequent analysis, so as to implement a dynamic backup process.
Step 202, counting the interval duration from the last backup end to the current moment for the instance to be backed up.
In this embodiment of the present application, since the backup status is recorded for each backup of the instance to be backed up, the time when the last backup of the instance to be backed up is ended can be determined according to the backup status of the last backup of the instance to be backed up, and thus, the obtained interval duration can be determined according to the time when the last backup of the instance to be backed up is ended and the current time. In general, the time when the last backup of the instance to be backed up ends refers to the time when the last backup of the instance to be backed up ends successfully.
Step 203, determining the current recovery efficiency based on the data variation and the interval duration.
In the embodiment of the application, the data change amount and the interval duration are calculated by adopting a preset algorithm, and the current recovery efficiency of the information backup node is determined.
Step 204, determining a current first read-write flow for the shared storage area corresponding to the instance to be backed up based on the current recovery efficiency.
The first read-write flow is required when backing up target backup data of an instance to be backed up to the shared storage area.
In the embodiment of the application, under the condition that the current recovery efficiency of the information backup node meets a certain condition, the information backup node determines the current first read-write flow of the shared storage area corresponding to the instance to be backed up; otherwise, when the current recovery efficiency of the information backup node does not meet a certain condition, the first read-write flow is not required to be determined, and the steps 205-206 are not required to be executed, so that the resource consumption of the information backup node is effectively reduced, and the working efficiency of the information backup node is improved.
Step 205, determining the backup time of the backup target backup data based on the first read-write flow.
In this embodiment of the present application, the backup time of the backup target backup data is determined according to whether the first read-write flow meets the condition of the read-write flow of the shared storage area.
And 206, backing up the target backup data to the shared storage area at the moment corresponding to the backup time.
In this embodiment of the present application, the information backup node backs up the target backup data of the instance to be backed up to the shared storage area at a time corresponding to the backup time.
Based on the foregoing embodiments, in other embodiments of the present application, step 203 may be implemented by steps 203a to 203 f:
step 203a, determining recovery aging parameters and backup aging parameters.
The recovery aging parameters are aging parameters required when the target recovery type is adopted to recover the to-be-backed-up instance, and the backup aging parameters have an association relation with the target recovery type.
In the embodiment of the present application, the target recovery type may be determined by a test result of an actual recovery test performed on an instance to be backed up, that is, actual recovery tests of different recovery types are performed on the instance to be backed up to obtain recovery aging parameters and backup aging parameters corresponding to different recovery types, and since the smaller the recovery aging parameters and the backup aging parameters are, the faster the recovery is indicated, so that the recovery type with the largest recovery aging parameters and backup aging parameters can be determined as the target recovery type.
Illustratively, the recovery types include at least the following three types: full backup restore type, incremental backup restore type, and binary log (Binlog) backup restore type. In general, because the recovery aging parameters and the backup aging parameters required by the Binlog backup recovery type are both longer, if the information backup node still can meet the recovery requirement when recovering the instance to be backed up by adopting the Binlog backup recovery type, the recovery requirement can be certainly met when recovering by adopting other recovery types, so that the target recovery type can be generally determined as the Binlog backup recovery type.
And 203b, determining the ratio of the data change amount to the recovery aging parameter to obtain the recovery time length.
In the present embodiment, recovery time length=data change amount/recovery aging parameter.
Step 203c, determining a reaction time required for artificially initiating recovery of the data.
In the examples of the present application, the reaction time period required to initiate recovery of data is considered to be typically an empirical value obtained from a number of experiments.
And 203d, determining the ratio of the data change amount to the backup aging parameter to obtain a first backup duration.
In the embodiment of the present application, the first backup time period=the data change amount/the backup aging parameter.
Step 203e, determining the target number of times of faults in the interval duration.
In the embodiment of the present application, the target number of times of occurrence of the fault in the interval duration is an empirical value obtained according to a large number of experiments, and the target number of times is generally a positive integer greater than or equal to 1.
Step 203f, determining the current recovery efficiency based on the recovery time, the reaction time, the first backup time, the target number of times, the data change amount and the interval time.
In the embodiment of the application, a preset algorithm is adopted to calculate the recovery time length, the reaction time length, the first backup time length, the target times, the data change amount and the interval time length, so that the current recovery efficiency is obtained.
In this way, the reasonable backup time is determined by determining the current recovery efficiency in real time, so that the possibility that the time-consuming binary log is required to be used for data recovery when a major disaster occurs is effectively reduced.
Based on the foregoing embodiments, in other embodiments of the present application, step 203f may be implemented by steps a11 to a 16:
step a11, determining a first sum value of the interval duration and the first backup duration.
In the embodiment of the present application, the first sum value=interval duration+first backup duration.
Step a12, determining a first product of the negative target number of times and the first sum.
In the embodiment of the present application, the first product= - (target number of times) first sum value.
Step a13, determining the difference of the first product power of 1 and e.
In the present embodiment, the difference = 1-e is the first product to the power.
Step a14, determining a second product of the difference value and the data variation.
In the embodiment of the present application, the second product=the data change amount×difference value.
Step a15, determining a second sum of the recovery time and the reaction time.
In the present embodiment, the second sum=recovery period+reaction period.
And a16, determining the ratio of the second product to the second sum value to obtain the current recovery efficiency.
In the present embodiment, the current recovery efficiency=second product/second sum value. Can adopt the formula
Figure BDA0003083170380000081
Wherein V denotes the current recovery efficiency, C denotes the data change amount, n denotes the target number of times, to denotes the interval duration, tb denotes the first backup duration, tr denotes the recovery duration, tp denotes the reaction duration, and the time units between To, tb, tr and Tp are uniform, and may be, for example, seconds(s), minutes (min), or hours (h).
Therefore, the current recovery efficiency is accurately calculated through the algorithm, so that the elastic backup time can be accurately determined later, and the backup recovery efficiency is improved.
Based on the foregoing embodiments, in other embodiments of the present application, step 204 may be implemented by steps 204 a-204 b:
step 204a, obtaining a preset recovery efficiency.
In the embodiment of the present application, the preset recovery efficiency may be an empirical value obtained by a large number of experiments, or may be an empirical value obtained by determining according to different examples. In some application scenarios, the preset recovery efficiencies corresponding to different examples may be the same or different.
Step 204b, if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining the first read-write flow.
In the embodiment of the application, when the current recovery efficiency is greater than or equal to the preset recovery efficiency, the first read-write flow is determined to carry out backup processing on the target backup data of the instance to be backed up, so that when a disaster occurs, the disaster can be quickly recovered according to the data backed up in advance due to the fact that the corresponding data is backed up in advance, and loss caused by the disaster is effectively reduced.
Based on the foregoing embodiments, in other embodiments of the present application, step 204b may be implemented by steps b11 to b 14:
and b11, if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining a second backup duration of the previous backup to-be-backed up instance.
In this embodiment of the present application, the second backup duration of the previous backup to-be-backed up instance refers to a backup duration that is spent for backing up the to-be-backed up instance last time from the current time. The second backup time length can be determined according to the backup start time of the previous backup to-be-backed-up instance and the backup end time of the previous backup to-be-backed-up instance.
Step b12, determining the data size of the target backup data of the instance to be backed up.
And b13, determining a second read-write flow of the current storage read-write of the shared storage area.
In this embodiment of the present application, the second read-write flow may be a read-write flow occupied by the shared memory area currently storing read-write, and at different moments, the second read-write flow of the shared memory area is different because the read-write contents of the shared memory area are different.
And step b14, determining the sum of the ratio of the data size to the second backup time length and the second read-write flow to obtain the first read-write flow.
In the embodiment of the present application, the first read-write flow=data size/second backup period+second read-write flow. Therefore, the more accurate first read-write flow is effectively estimated through the algorithm, so that the accurate backup time can be determined according to the first read-write flow, and the backup efficiency is improved.
Based on the foregoing embodiments, in other embodiments of the present application, step 205 may be implemented by steps 205a to 205 j:
step 205a, determining a first maximum write flow allowed by the shared memory area at the current time.
In this embodiment of the present application, the first maximum write flow allowed by the shared storage area at the current time may be determined according to a storage device included in the shared storage area, including the following implementation procedures: determining the current allowable maximum write flow of each storage device included in the shared storage area, and accumulating the current allowable maximum write flow of all the storage devices included in the shared storage area to obtain a first maximum write flow.
Step 205b, determining a preset duty cycle.
In the embodiment of the application, the preset duty ratio is an empirical value which allows maximum reading and writing and is obtained according to a large number of experiments, so that a certain redundancy amount of a reading and writing channel is ensured, the situation that the reading and writing channel is blocked completely and the reading and writing are crashed due to sudden increase of the read and writing data is prevented, and the reading and writing efficiency can be improved.
Step 205c, determining a third product of the first maximum write flow and the preset duty cycle.
In the embodiment of the present application, the third product=the first maximum write flow rate is a preset duty cycle. For example, the empirical value of the preset duty cycle may take 80%.
After the information backup node executes step 205c, step 205d, or steps 205e to 205j may be selectively executed; wherein, if the first read/write flow is less than or equal to the third product, step 205d may be selectively performed, and if the first read/write flow is greater than the third product, steps 205 e-205 j may be selectively performed:
step 205d, if the first read-write flow is less than or equal to the third product, determining the backup time as the current time.
In this embodiment of the present application, the first read-write flow is smaller than or equal to the third product, which indicates that the target backup data of the instance to be backed up can be backed up at the current time, so that the backup time can be determined as the current time.
Step 205e, if the first read-write flow is greater than the third product, determining a third read-write flow of the storage read-write of the shared storage area after the interval is preset for a period of time.
In this embodiment of the present application, the preset duration is an empirical value of duration obtained according to a large number of experiments, for example, may be 5 minutes. If the first read-write flow is greater than the third product, it indicates that the remaining read-write flow of the shared memory area at the current moment is smaller, and if the target backup data is backed up at the current moment, there is a risk of backup crash, so after a preset time interval is needed, the third read-write flow of the shared memory area is redetermined, and the implementation process is the same as that of step b13, and detailed description thereof is omitted.
And step 205f, determining the sum of the ratio of the data size to the second backup time length and the third read-write flow to obtain a fourth read-write flow.
Step 205g, determining a second maximum write flow of the shared storage area when the current time interval is preset.
In the embodiment of the present application, the implementation process is the same as the implementation process of step 205a, and will not be described in detail here.
Step 205h, determining a fourth product of the second maximum write flow and the preset duty cycle.
Step 205i, if the fourth read-write flow is smaller than or equal to the fourth product, determining that the backup time is a time corresponding to the preset time interval after the current time.
Step 205j, if the fourth read-write flow is greater than the fourth product, determining a fifth read-write flow of the storage read-write of the shared storage area after a preset time interval of 2 times, and repeating the execution until a moment that the backup time is n times of the preset time interval after the corresponding current moment when the sixth read-write flow is less than or equal to the fifth product is determined; wherein n is an integer greater than or equal to 2.
In the embodiment of the application, the cyclic repetition operation is performed according to the preset time length until the backup time is determined to be obtained, wherein the backup time is n times of the preset time length after the current time. For example, assuming that the preset time period is 5min, when the current time is 11 hours, 4 minutes and 10 seconds, when the preset time period is 2 times of the current time period, namely, 11 hours, 14 minutes and 10 seconds, it is determined that the fifth read-write flow is smaller than or equal to the fifth product, and the backup time is 11 hours, 14 minutes and 10 seconds.
Therefore, the accurate time for carrying out backup is determined by circularly and repeatedly executing the judging operation, so that quick and effective backup is realized, and the backup efficiency is improved.
Based on the foregoing embodiments, in other embodiments of the present application, step 206 may be implemented by steps 206 a-206 b:
and 206a, compressing the target backup data by adopting a target compression mode at the moment corresponding to the backup time to obtain compressed data.
In the embodiment of the present application, the target compression mode may be a preset compression mode, for example, may be an LZ4 compression mode in which dictionary technology is applied to the field of general data compression.
Step 206b, backing up the compressed data to the shared storage area.
In the embodiment of the application, after the target backup data is compressed in the target compression mode to obtain the compressed data, the compressed data is backed up to the shared storage area, so that the storage space of the shared storage area can be effectively saved.
Based on the foregoing embodiments, in other embodiments of the present application, referring to fig. 3, after the information backup node performs step 206, the information backup node may be further configured to perform steps 207 to 208:
step 207, determining backup status information of the target backup data of the instance to be backed up.
In this embodiment of the present application, the backup status information of the target backup data of the instance to be backed up at least includes the following information: backup start time, backup end time, backup success/failure.
Step 208, record the backup status information of the instance to be backed up in the backup record.
The backup record is used for counting backup state information of all backup examples.
In the embodiment of the application, the backup state information of the instance to be backed up is recorded, so that the subsequent backup process of the instance to be backed up is correspondingly analyzed according to the backup record, for example, the determination of the backup time for the next backup of the instance to be backed up is determined according to the backup record, and the accuracy of the backup time determined in the next backup is ensured due to the higher accuracy of the backup record.
Based on the foregoing embodiments, in other embodiments of the present application, referring to fig. 4, after the information backup node performs step 206, the information backup node may be further configured to perform steps 209 to 211:
step 209, detecting backup status information of each backup instance in the backup record.
The backup record is used for counting backup state information of all backup examples.
Step 210, if the backup status information is detected to be the first reference backup instance with failed backup, backing up the first reference backup data of the first reference backup instance again to the shared storage area, and obtaining the backup status information of the first reference backup instance.
Step 211, record the backup status information of the first reference backup instance into the backup record.
In the embodiment of the application, the information backup device automatically backs up the target backup data of the instance to be backed up, which is failed to backup, again after a certain time interval according to the backup record, thereby effectively improving the backup efficiency of the instance to be backed up.
It should be noted that, steps 209 to 211 may be performed before any one of steps 206, and the execution order of steps 209 to 211 may be determined according to the actual application scenario. In some application scenarios, steps 209-211 may also be performed as a separate embodiment.
Based on the foregoing embodiments, in other embodiments of the present application, referring to fig. 5, after the information backup node performs step 206, the information backup node may be further configured to perform steps 212 to 213:
step 212, counting the backup status information of the second reference backup instance from the backup record as the counted number of backup failures.
And 213, if the counted number of times is greater than or equal to the preset number of times, generating alarm prompt information based on the second reference backup instance.
The alarm prompt information is used for indicating that the backup data of the second reference backup example is not successfully backed up.
In this embodiment of the present application, after the information backup device performs multiple times of backup on the backup data of the second reference backup instance, the information backup device may generate alarm prompt information to prompt the operation and maintenance personnel that the backup data of the second reference backup instance is not successfully backed up, so that the operation and maintenance personnel perform subsequent operations, for example, the operation and maintenance personnel manually performs backup processing on the backup data of the second reference backup instance, so as to reduce loss caused by not backing up the second reference backup instance when a disaster occurs.
It should be noted that, steps 212 to 213 may be performed before any step before step 206, or may be performed as a separate embodiment.
Based on the foregoing embodiments, in other embodiments of the present application, referring to fig. 6, after the information backup node performs step 206, the information backup node may be further configured to perform steps 214 to 215:
Step 214, determining a preset retention period for each backup data of the third reference backup instance.
Step 215, if the current retention time length of the second reference backup data of the third reference backup instance is detected to be greater than or equal to the preset retention time length, deleting the second reference backup data.
In the embodiment of the present application, when the retention time is preset, an empirical value of the retention time is determined according to each backup instance, and in different application scenarios, the preset retention time of each backup instance may be different. The information backup node can detect the retention time of the backup data stored in the shared storage area according to the preset cleaning period, and delete the corresponding backup data when the retention time of the backup data exceeds the corresponding preset retention time so as to save the storage capacity of the shared storage area.
It should be noted that, steps 214 to 215 may be performed before any step before step 206, or may be performed as a separate embodiment.
Based on the foregoing embodiment, in other embodiments of the present application, step 215 may be implemented by deleting the second reference backup data in a target deletion manner according to the jitter state of the preset input and output if the current retention time length of the second reference backup data of the third reference backup instance is detected to be greater than or equal to the preset retention time length.
In the embodiment of the present application, the target deletion mode may be a smooth deletion mode or some other deletion mode that does not cause large Input/Output (IO) jitter. The preset jitter state of input and output can be that the ratio of the average rate of the current 10 seconds of the IO flow to the average rate before 10 seconds is calculated to be <1.3, and the global maximum use percentage of IO is smaller than 30%. Therefore, the information backup node traverses the catalogue of each layer of the second reference backup data to delete the small file level, the deleting rate can be adjusted according to the preset jitter state of input and output, smooth deletion is realized, and the jitter of input and output is effectively reduced.
It should be noted that, different steps in fig. 2 to 6 can be selectively executed according to actual situations, so that the closed loop backup management processes of automatic efficient backup, automatic alarm, automatic retry and automatic cleaning are realized, and a great deal of maintenance cost is saved.
Based on the foregoing embodiments, the present embodiment provides a system architecture diagram for implementing an information backup method, and referring to fig. 7, an information backup node 31, a shared storage cluster 32, a data information base 33, and an alarm module 34 are shown; wherein:
The information backup node 31 may be a node in a reliable coordination system service ZooKeeper cluster with a distributed system, where the information backup node is determined by adopting a preemptive locking mechanism from the ZooKeeper cluster, that is, each node in the ZooKeeper cluster performs voting on other nodes, and the node with the highest voting score is obtained as the information backup node.
Based on the system architecture diagram shown in fig. 7, the implementation flow of the information backup node 31 may refer to fig. 8, which includes:
step 41, start.
Step 42, the information backup node 31 calculates the current recovery efficiency.
The information backup node obtains a current data variable quantity C of an instance To be backed up, an interval duration To from the last backup To the current moment, and obtains a recovery aging reference table shown in a reference table 1 and a backup aging reference table shown in a reference table 2, wherein the recovery aging reference table is obtained by testing the instance To be backed up in advance.
TABLE 1
Data volume Backup type Fastest recovery aging
1G Full standby 12 seconds
1G Increase and prepare 60 seconds
1G Binlog 300 seconds
TABLE 2
Data volume Backup type Fastest backup aging
1G Full standby 10 seconds
1G Increase and prepare 20 seconds
1G Binlog 200 seconds
Thus, the recovery aging parameter corresponding to the Binlog backup recovery type is determined to be 300s from the table 1, the backup aging parameter corresponding to the Binlog backup recovery type is determined to be 200s from the table 2, the target number of times is 1 time assuming that the reaction time is 5min, and thus, the recovery aging parameter can be determined to be obtained by a formula
Figure BDA0003083170380000151
Wherein, the time units are all unified as hours. The full back-up in tables 1 and 2 is an abbreviation for full back-up, the incremental back-up is an abbreviation for incremental back-up, and 1G refers to 1 gigabit. />
Step 43, the information backup node 31 determines whether the current recovery efficiency is greater than a preset recovery efficiency, if so, step 44 is executed, otherwise, step 410 is executed.
Wherein, the preset recovery efficiency is assumed to be 10 gigabits (G)/h.
Step 44, the information backup node 31 determines a first read-write flow of the shared storage cluster.
The information backup node may read the backup configuration information stored in the data information base 33 according to a time period to determine the current first read-write flow of the shared storage cluster, where the backup configuration information may be represented by a table as shown in table 3, and table 3 includes an instance name of a backup, a time of initiating the backup, a full backup strategy of the backup, a retention time of the backup, and a recovery time target (Recovery Time Objective, RTO); the backup record may be represented by a backup case table as shown in table 4, including an instance name of a backup, a backup task, a backup initiation time, a backup end time, a backup state, a backup path, a backup size, and the like. The backup initiation time t1 and the backup end time t2 of the to-be-backed-up instance can be obtained from table 4, so that the first backup duration can be determined to be t2-t1, the data size of the target backup data corresponding to the to-be-backed-up instance is assumed to be Bsize, and the determined second read-write flow of the shared storage cluster is io_cur, so that the first read-write flow can be determined to be io_cur+bsize/(t 2-t 1).
Step 45, the information backup node 31 determines a first maximum write traffic i0_max of the shared storage cluster.
Step 46, the information backup node 31 determines whether the first read-write flow is greater than i0_max by 80%, if the first read-write flow is greater than i0_max by 80%, step 47 is executed, otherwise, step 44 is executed after a predetermined interval period of time, for example, 5 min.
Step 47, the information backup node 31 backs up the target backup data to the shared storage cluster.
Step 48, the information backup node 31 determines whether the backup is successful, if so, step 49 is executed, otherwise, step 47 is executed.
Step 49, the information backup node 31 generates a backup record and stores the backup record in the data information base.
Step 410, end.
In other embodiments of the present application, when the information backup node 31 backs up the target backup data, LZ4 compression may be performed through a pipeline, so as to save storage space. After the information backup node 31 performs the backup task, the backup condition is written into the backup record in the database, so that the information backup node can retry the backup according to whether the backup state in the backup record is successful or not according to a certain period.
In some application scenarios, the information backup node 31 may also perform cleaning of the backup data, for example, weekly according to the backup retention time, so as to ensure that the storage capacity of the shared storage cluster is sufficient. When the expired backup is deleted every week, a primary tool of a high-consumption IO and a central processing unit (Central Process Unit, CPU) such as a delete (remove, rm) can be not directly used, a backup list is read through a less-consumed delete program, the directory of each layer is traversed, small file level deletion is performed, the average rate of the IO flow within 10 seconds is calculated, the ratio of the average rate to the average rate before 10 seconds is less than 1.3, the jitter condition of the IO of which the global maximum use percentage of the IO cannot exceed 30 percent is automatically adjusted, and the deletion rate is smoothly deleted.
As an example, a schematic diagram of an operation Cycle of an information backup node backup is provided, referring To fig. 9, the aforesaid time interval To is from the end time of the backup process 1 To the start time of the backup process 2, where Tb is the backup duration spent by the backup process 2, and a corresponding operation Cycle (Run Cycle, RC) for the backup process 2 includes To and Tb.
It should be noted that, in this embodiment, the descriptions of the same steps and the same content as those in other embodiments may refer to the descriptions in other embodiments, and are not repeated here.
In the embodiment of the application, after the information backup node determines the current recovery efficiency of backing up and recovering the data, based on the current recovery efficiency, the current first read-write flow of the shared storage area corresponding to the instance to be backed up is determined, and based on the first read-write flow, after the backup time of the backup target backup data is determined, the backup target backup data is started to the shared storage area at the moment corresponding to the backup time, so that the backup time of the target backup data is dynamically determined according to the current first read-write flow of the shared storage area, the problem that the backup efficiency is lower in the concurrent backup process of limiting the current concurrent number by using the constant backup system is solved, the backup resources can be fully utilized, the backup efficiency is improved, and the backup time is effectively met.
Based on the foregoing embodiments, embodiments of the present application provide an information backup apparatus, as shown with reference to fig. 10, the information backup apparatus 5 may include: a processor 51, a memory 52 and a communication bus 53, wherein:
a memory 52 for storing executable instructions;
a communication bus 53 for implementing a communication connection between the processor 51 and the memory 52;
a processor 51 for executing an information backup program stored in a memory 52 to realize the steps of:
determining the current recovery efficiency of the information backup node for carrying out backup recovery on the data currently;
determining a current first read-write flow of a shared storage area corresponding to an instance to be backed up based on the current recovery efficiency; the first read-write flow is required when backing up target backup data of an instance to be backed up to the shared storage area;
determining backup time of backup target backup data based on the first read-write flow;
and at the moment corresponding to the backup time, backing up the target backup data to the shared storage area.
In other embodiments of the present application, when the processor performs the step of determining the current recovery efficiency of the information backup node for currently recovering data, the method may be implemented by the following steps:
Acquiring the data variation of the instance to be backed up at the current moment;
counting the interval time from the last backup end to the current moment of the instance to be backed up;
and determining the current recovery efficiency based on the data variation and the interval duration.
In other embodiments of the present application, the processor executing steps to determine the current recovery efficiency based on the data variance and the interval duration may be implemented by:
determining recovery aging parameters and backup aging parameters; the recovery aging parameters are aging parameters required when the target recovery type is adopted to recover the instance to be backed up, and the backup aging parameters have an association relationship with the target recovery type;
determining the ratio of the data variation to the recovery aging parameter to obtain the recovery time length;
determining the reaction time required by the artificial initiation of the recovery of the data;
determining the ratio of the data variable quantity to the backup ageing parameter to obtain a first backup duration;
determining the target times of faults in the interval time;
and determining the current recovery efficiency based on the recovery time, the reaction time, the first backup time, the target times, the data change amount and the interval time.
In other embodiments of the present application, the processor executing step may be implemented when determining the current recovery efficiency based on the recovery time, the reaction time, the first backup time, the target number of times, the data change amount, and the interval time, by:
Determining a first sum of the interval duration and the first backup duration;
determining a first product of the negative target number of times and the first sum;
determining a difference of the first product power of 1 and e;
determining a second product of the difference value and the data variation;
determining a second sum of the recovery time and the reaction time;
and determining the ratio of the second product to the second sum value to obtain the current recovery efficiency.
In other embodiments of the present application, the processor executing step may be implemented by determining, based on the current recovery efficiency, a current first read-write flow for a shared storage area corresponding to an instance to be backed up, by:
acquiring preset recovery efficiency;
and if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining the first read-write flow.
In other embodiments of the present application, the processor executing the step may be implemented by the following steps when determining the first read/write flow if the current recovery efficiency is greater than or equal to the preset recovery efficiency:
if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining a second backup duration of the previous backup to-be-backed up instance;
determining the data size of target backup data of an instance to be backed up;
determining a second read-write flow of the current storage read-write of the shared storage area;
And determining the sum of the ratio of the data size to the second backup time length and the second read-write flow to obtain the first read-write flow.
In other embodiments of the present application, when the processor executes the step of determining the backup time for backing up the target backup data based on the first read-write flow, the method may be implemented by:
determining a first maximum write flow allowed by the shared storage area at the current moment;
determining a preset duty cycle;
determining a third product of the first maximum write flow and a preset duty cycle;
if the first read-write flow is smaller than or equal to the third product, determining the backup time as the current time.
In other embodiments of the present application, the processor is further configured to perform the steps of:
if the first read-write flow is larger than the third product, determining the third read-write flow of the storage read-write of the shared storage area after the interval preset time length;
determining the sum of the ratio of the data size to the second backup time length and the third read-write flow to obtain a fourth read-write flow;
determining a second maximum write flow of the shared storage area at the current time interval for a preset time period;
determining a fourth product of the second maximum write flow and a preset duty cycle;
if the fourth read-write flow is smaller than or equal to the fourth product, determining that the backup time is the time corresponding to the preset time interval after the current time;
If the fourth read-write flow is greater than the fourth product, determining a fifth read-write flow of the storage read-write of the shared storage area after a preset time interval of 2 times, and repeating the steps until a moment of n times of preset time interval after the corresponding current moment when the sixth read-write flow is smaller than or equal to the fifth product is determined to be obtained as the backup time; wherein n is an integer greater than or equal to 2.
In other embodiments of the present application, when the processor executes the step to backup the target backup data to the shared storage area at the time corresponding to the backup time, the step may be implemented by:
at the moment corresponding to the backup time, compressing the target backup data by adopting a target compression mode to obtain compressed data;
and backing up the compressed data to the shared storage area.
In other embodiments of the present application, the step of executing the step of backing up the target backup data to the shared storage area at the time corresponding to the backup time is further performed by:
determining backup state information of target backup data of an instance to be backed up;
recording backup state information of an instance to be backed up into a backup record; the backup record is used for counting backup state information of all backup examples.
In other embodiments of the present application, the processor is further configured to perform the steps of:
detecting backup state information of each backup instance in the backup record; the backup record is used for counting backup state information of all backup examples;
if the backup state information is detected to be the first reference backup instance with failed backup, the first reference backup data of the first reference backup instance is backed up again to the shared storage area to obtain the backup state information of the first reference backup instance;
and recording the backup state information of the first reference backup instance into the backup record.
In other embodiments of the present application, the processor is further configured to perform the steps of:
counting backup state information of a second reference backup instance from backup records as the counting times of backup failure;
if the counted times is greater than or equal to the preset times, generating alarm prompt information based on the second reference backup example; the alarm prompt information is used for indicating that the backup data of the second reference backup example is not successfully backed up.
In other embodiments of the present application, the processor is further configured to perform the steps of:
determining a preset retention time length of each piece of backup data of the third reference backup instance;
And if the current retention time length of the second reference backup data of the third reference backup example is detected to be longer than or equal to the preset retention time length, deleting the second reference backup data.
In other embodiments of the present application, the processor executing step may be implemented by the following steps if it detects that the current retention time length of the second reference backup data of the third reference backup instance is greater than or equal to the preset retention time length, and deleting the second reference backup data:
if the current retention time length of the second reference backup data of the third reference backup example is detected to be longer than or equal to the preset retention time length, deleting the second reference backup data in a target deleting mode according to the jitter state of the preset input and output.
It should be noted that, in the embodiments of the present application, one or more programs may be explained by steps of one or more processors, and the implementation process of the method provided by the corresponding embodiments of fig. 1 to 6 may be referred to, which is not repeated herein.
In the embodiment of the application, after the information backup node determines the current recovery efficiency of backing up and recovering the data, based on the current recovery efficiency, the current first read-write flow of the shared storage area corresponding to the instance to be backed up is determined, and based on the first read-write flow, after the backup time of the backup target backup data is determined, the backup target backup data is started to the shared storage area at the moment corresponding to the backup time, so that the backup time of the target backup data is dynamically determined according to the current first read-write flow of the shared storage area, the problem that the backup efficiency is lower in the concurrent backup process of limiting the current concurrent number by using the constant backup system is solved, the backup resources can be fully utilized, the backup efficiency is improved, and the backup time is effectively met.
Based on the foregoing embodiments, embodiments of the present application provide an information backup platform, referring to fig. 11, the information backup platform 6 may include: at least one running node 61 and a shared memory area 62; wherein:
determining an information backup node from at least one operation node;
the method for determining the information backup node from at least one operation node may be implemented by adopting a lock mechanism, and specifically, reference may be made to the foregoing description process, which is not described in detail herein. Wherein the running node may be simply referred to as a node.
The implementation process of the method provided in the embodiments corresponding to fig. 1 to 6 is implemented through the information backup node, and is not described herein again;
and the shared storage area is used for storing target backup data backed up by the information backup node.
Based on the foregoing embodiments, embodiments of the present application provide a computer readable storage medium, simply referred to as a storage medium, where one or more programs are stored, and the one or more programs may be executed by one or more processors, so as to implement an information backup method implementation process provided in the corresponding embodiments of fig. 1 to 6, which is not described herein again.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the present application.

Claims (12)

1. An information backup method, wherein the method is applied to an information backup node, and the method comprises:
determining the current recovery efficiency of the information backup node for backing up and recovering the data currently;
Determining a current first read-write flow of a shared storage area corresponding to an instance to be backed up based on the current recovery efficiency; the first read-write flow is required when the target backup data of the instance to be backed up is backed up to the shared storage area;
determining backup time for backing up the target backup data based on the first read-write flow;
backing up the target backup data to the shared storage area at the moment corresponding to the backup time;
the determining the current recovery efficiency of the information backup node for currently carrying out backup recovery on the data comprises the following steps:
acquiring the data variation of the instance to be backed up at the current moment;
counting the interval time from the last backup end to the current moment of the instance to be backed up;
determining the current recovery efficiency based on the data variation and the interval duration;
wherein the determining the current recovery efficiency based on the data variance and the interval duration includes:
determining recovery aging parameters and backup aging parameters; the recovery aging parameters are corresponding aging parameters when the target recovery type is adopted to recover the instance to be backed up, and the backup aging parameters have an association relation with the target recovery type;
Determining the ratio of the data variation to the recovery aging parameter to obtain recovery time length;
determining the reaction time required by the artificial initiation of the recovery of the data;
determining the ratio of the data variation to the backup aging parameter to obtain a first backup duration;
determining the target times of faults in the interval time;
and determining the current recovery efficiency based on the recovery time, the reaction time, the first backup time, the target times, the data change amount and the interval time.
2. The method of claim 1, wherein the determining the current restoration efficiency based on the restoration time period, the reaction time period, the first backup time period, the target number of times, the data change amount, and the interval time period comprises:
determining a first sum of the interval duration and the first backup duration;
determining a first product of the target number of times negative and the first sum;
determining a difference of the first product power of 1 and e;
determining a second product of the difference and the amount of change in the data;
determining a second sum of the recovery time period and the reaction time period;
And determining the ratio of the second product to the second sum value to obtain the current recovery efficiency.
3. The method according to any one of claims 1 to 2, wherein determining, based on the current recovery efficiency, a current first read-write flow for the shared storage area corresponding to the instance to be backed up includes:
acquiring preset recovery efficiency;
and if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining the first read-write flow.
4. The method of claim 3, wherein determining the first read-write flow if the current recovery efficiency is greater than or equal to the preset recovery efficiency comprises:
if the current recovery efficiency is greater than or equal to the preset recovery efficiency, determining a second backup duration of the instance to be backed up in the previous backup;
determining the data size of the target backup data of the instance to be backed up;
determining a second read-write flow of the current storage read-write of the shared storage area;
determining a reference ratio of the data size to the second backup duration;
and determining the sum of the reference ratio and the second read-write flow to obtain the first read-write flow.
5. The method of claim 4, wherein determining a backup time for backing up the target backup data based on the first read-write traffic comprises:
determining a first maximum write flow allowed by the shared storage area at the current moment;
determining a preset duty cycle;
determining a third product of the first maximum write flow and the preset duty cycle;
and if the first read-write flow is smaller than or equal to the third product, determining the backup time as the current time.
6. The method of claim 5, wherein the method further comprises:
if the first read-write flow is larger than the third product, determining a third read-write flow of the storage read-write of the shared storage area after a preset time interval;
determining the sum of the reference ratio and the third read-write flow to obtain a fourth read-write flow;
determining a second maximum write flow of the shared storage area when the preset duration is separated from the current time;
determining a fourth product of the second maximum write flow and the preset duty cycle;
if the fourth read-write flow is smaller than or equal to the fourth product, determining that the backup time is a time corresponding to the preset duration at intervals after the current time;
If the fourth read-write flow is greater than the fourth product, determining a fifth read-write flow of the storage read-write of the shared storage area after the preset time interval of 2 times, and repeating the execution until the moment that the preset time interval is n times after the current moment corresponding to the moment that the sixth read-write flow is less than or equal to the fifth product is determined to be obtained; wherein n is an integer greater than or equal to 2.
7. The method of claim 1, wherein after backing up the target backup data to the shared storage area at the time corresponding to the backup time, the method further comprises:
determining backup state information of the target backup data of the instance to be backed up;
recording the backup state information of the instance to be backed up into a backup record; and the backup record is used for counting backup state information of all backup examples.
8. The method according to claim 1, wherein the method further comprises:
detecting backup state information of each backup instance in the backup record; the backup record is used for counting backup state information of all backup examples;
If the backup state information is detected to be a first reference backup instance with failed backup, backing up the first reference backup data of the first reference backup instance again to the shared storage area to obtain the backup state information of the first reference backup instance;
and recording the backup state information of the first reference backup instance into the backup record.
9. The method according to claim 1, wherein the method further comprises:
counting backup state information of a second reference backup instance from backup records as the counting times of backup failure;
if the counted times are greater than or equal to preset times, generating alarm prompt information based on the second reference backup example; the alarm prompt information is used for indicating that the backup data of the second reference backup example is not successfully backed up.
10. The method according to claim 1, wherein the method further comprises:
determining a preset retention time length of each piece of backup data of the third reference backup instance;
and if the current retention time length of the second reference backup data of the third reference backup example is detected to be longer than or equal to the preset retention time length, deleting the second reference backup data in a target deleting mode according to the jitter state of the preset input and output.
11. An information backup apparatus, characterized in that the apparatus comprises: memory, processor, and communication bus; wherein:
the memory is used for storing executable instructions;
the communication bus is used for realizing communication connection between the processor and the memory;
the processor is configured to execute an information backup program stored in the memory, and implement the steps of the information backup method according to any one of claims 1 to 10.
12. An information backup platform, the platform comprising: at least one running node and a shared storage area; wherein:
determining an information backup node from at least one operation node;
implementing the steps of the information backup method according to any one of claims 1 to 10 by the information backup node;
and the shared storage area is used for storing the target backup data backed up by the information backup node.
CN202110572288.XA 2021-05-25 2021-05-25 Information backup method, equipment, platform and storage medium Active CN113297009B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202110572288.XA CN113297009B (en) 2021-05-25 2021-05-25 Information backup method, equipment, platform and storage medium
PCT/CN2021/136338 WO2022247219A1 (en) 2021-05-25 2021-12-08 Information backup method, device, and platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110572288.XA CN113297009B (en) 2021-05-25 2021-05-25 Information backup method, equipment, platform and storage medium

Publications (2)

Publication Number Publication Date
CN113297009A CN113297009A (en) 2021-08-24
CN113297009B true CN113297009B (en) 2023-05-02

Family

ID=77324765

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110572288.XA Active CN113297009B (en) 2021-05-25 2021-05-25 Information backup method, equipment, platform and storage medium

Country Status (2)

Country Link
CN (1) CN113297009B (en)
WO (1) WO2022247219A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113297009B (en) * 2021-05-25 2023-05-02 深圳前海微众银行股份有限公司 Information backup method, equipment, platform and storage medium
CN116795602B (en) * 2023-08-17 2023-11-10 北京星云医学检验实验室有限公司 Method and device for constructing biological sample information database

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111949438A (en) * 2019-05-14 2020-11-17 浙江宇视科技有限公司 Multimedia data backup method, device, server and medium

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000137636A (en) * 1998-10-30 2000-05-16 Hitachi Ltd Backup device
CN106776113B (en) * 2016-02-18 2021-03-02 新华三技术有限公司 Virtual machine backup method and device
CN107329853A (en) * 2017-06-13 2017-11-07 上海微烛信息技术有限公司 Backup method, standby system and the electronic equipment of data-base cluster
CN112685224A (en) * 2019-10-17 2021-04-20 伊姆西Ip控股有限责任公司 Method, apparatus and computer program product for task management
CN112685170B (en) * 2019-10-18 2023-12-08 伊姆西Ip控股有限责任公司 Dynamic optimization of backup strategies
CN111966449B (en) * 2020-07-17 2022-05-31 苏州浪潮智能科技有限公司 Virtual machine backup management method, system, terminal and storage medium
CN112527559B (en) * 2020-12-09 2021-10-08 广州技象科技有限公司 Internet of things data backup method and device
CN113297009B (en) * 2021-05-25 2023-05-02 深圳前海微众银行股份有限公司 Information backup method, equipment, platform and storage medium

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111949438A (en) * 2019-05-14 2020-11-17 浙江宇视科技有限公司 Multimedia data backup method, device, server and medium

Also Published As

Publication number Publication date
WO2022247219A1 (en) 2022-12-01
CN113297009A (en) 2021-08-24

Similar Documents

Publication Publication Date Title
CN113297009B (en) Information backup method, equipment, platform and storage medium
CN106547635B (en) Operation retry method and device for operation
EP3399692B1 (en) Method and apparatus for upgrading distributed storage system
CN112346829A (en) Method and equipment for task scheduling
CN105573859A (en) Data recovery method and device of database
CN113051104B (en) Method and related device for recovering data between disks based on erasure codes
CN114564284B (en) Data backup method of virtual machine, computer equipment and storage medium
US20090157767A1 (en) Circular log amnesia detection
JP2004038516A (en) Work processing system, operation management method and program for performing operation management
CN106815094B (en) Method and equipment for realizing transaction submission in master-slave synchronization mode
CN109684130B (en) Method and device for backing up data of computer room
CN110825758B (en) Transaction processing method and device
CN107908370B (en) Data storage method and device
CN116069765A (en) Data migration method, device, electronic equipment and storage medium
CN112000521B (en) Full backup method and device for distributed database system and computer readable storage medium
CN113886342A (en) File format conversion method and device, storage medium and processor
CN113900856A (en) Data processing method and related equipment
US10102052B2 (en) Dumping resources
CN112035322A (en) JVM monitoring method and device
CN110908821A (en) Method, device, equipment and storage medium for task failure management
CN113206891B (en) Scheduling method, storage system, scheduling device and storage medium for metadata reporting
CN112650447B (en) Backup method, system and device for ceph distributed block storage
CN115001998B (en) Disaster recovery method and device for message service
CN117112152A (en) Distributed scheduling method, apparatus, electronic device and computer program product
CN114579353A (en) Data backup method, data recovery method, system, device and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant