CN102236586A - Local and network multiple incremental data backup and recovery method of computer - Google Patents
Local and network multiple incremental data backup and recovery method of computer Download PDFInfo
- Publication number
- CN102236586A CN102236586A CN2010101536126A CN201010153612A CN102236586A CN 102236586 A CN102236586 A CN 102236586A CN 2010101536126 A CN2010101536126 A CN 2010101536126A CN 201010153612 A CN201010153612 A CN 201010153612A CN 102236586 A CN102236586 A CN 102236586A
- Authority
- CN
- China
- Prior art keywords
- backup
- file
- index
- block
- network
- 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.)
- Pending
Links
Images
Abstract
The invention provides a local and network multiple incremental data backup and recovery method of a computer, belonging to the field of computers. The multiple incremental data backup method comprises the following steps of: step 1, scanning historical backup; step 2, opening all incremental backup files and full backup files, and establishing an index file for reading the files; step 3, establishing an index network according to the index file processed with multiple incremental backup; step 4, reading blocked data block by block from end to end according to the index network, and storing the read blocked data in an internal memory; step 5, comparing the read blocked data with corresponding position of a source file, and generating a new incremental backup index file; step 6, releasing resources, and closing all the opened files. In comparison with the prior art, the method provided by the invention has the following advantages that: before the incremental backup, the data is not needed to be recovered, so that backup speed is greatly improved; and after the incremental backup, the data is not needed to be synthesized, so that operation time is greatly saved and backup space is reduced.
Description
Technical field
The present invention relates to a kind of computing machine this locality and network repeatedly data backup, the restoration methods of increment, belong to computer realm.
Background technology
In current informationization, networked society, computing machine is being played the part of extremely important role in work and life.More and more enterprises, businessman, government bodies and individual obtain information, process information by computing machine, simultaneously the form of most important information with data file are kept in the computing machine.Can imagine,, will cause an enterprise to shut down, even face bankruptcy in case these important data are revealed or lost.Thus, people more and more pay close attention to how to guarantee the intact of data, and wherein data backup is exactly one of most important solution.
Find through literature search prior art, Chinese patent (application) number is 200610001299.8, the patent of " data reconstruction method " by name, the method that the described data of this scheme are recovered, needing to carry out complete file between local and long-range exchanges, will produce a large amount of Network Transmission like this, when having prolonged data release times, also brought transmission security hidden danger, the more important thing is, store the different editions of identical file repeatedly, and the most contents of these different editions all is identical, can cause a large amount of waste of storage space.In this case, only needing the variance data redundancy technique between the backup identical file different editions, will be more welcome.Chinese patent (application) number is 200610116303.5, the patent of " method of file coupling in the computer network data backup " by name, and it generates and transmit an incremental backup when each backup synthesizes to long-range.Be easier to although generate an incremental backup ratio, for increment repeatedly, this technology has three weak points:
(1) in logic, incremental backup is the difference between " file of latest edition backup " and " the current file ", so will generate incremental backup, must at first have this two files, just can calculate difference.But because the mode of incremental backup is not stored the complete source file of each version, therefore " file of latest edition backup " directly do not exist, and this source file must at first be resumed out.This causes, and backup, and at first will do once and recover, and this is a kind of waste of time (with reference to figure 4).
(2) speed in order to guarantee to recover, each backup must be synthesized, and the synthetic backup that just equals later each version has all comprised all historical incremental backup information, still wastes storage space (simultaneously, He Cheng action has also been wasted operation time).In this case, the storage space of waste and at every turn all back up complete file as many.In other words, this is not real repeatedly increment, is a series of single increment (with reference to figure 4, Fig. 5).
(3) if do not synthesize, then recover just extremely slow, as long as what incremental backup versions are arranged in history, will generate the how many times intermediate file, along with the version of backup is many more, recovery can become (with reference to figure 5) more and more slowly.
Summary of the invention
The purpose of this invention is to provide a kind of computing machine this locality and network repeatedly data backup, the restoration methods of increment, described a kind of computing machine this locality and the network repeatedly data back up method of increment comprise the steps:
Step 1, the historical backup of scanning;
Step 2 is opened all incremental backup files and complete backup file, and is set up index file in order to reading;
Step 4, according to the index network, block-by-block is read block data in internal memory from the beginning to the end;
Step 5 is made comparisons the block data read and the correspondence position of source file, and is generated new incremental backup index file;
Step 6 discharges resource, closes all.
Further, described a kind of computing machine this locality and network be the data back up method of increment repeatedly, also comprises following technical characterictic:
Have in the historical backup of the scanning described in the step 1 concrete steps:
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein last backup file, relatively the modification date of this backup file and the source file that needs backup,, then abandon backup, otherwise enter step 3) if the date of last backup file is newer,
3) if this document was never done backup in the past, then this time execute full backup, and finish; Otherwise, enter step 2.
The method of setting up the index network in step 3 has:
1) structure article one index chain is read each the block data block-by-block in the most original index file, and constitute a chained list in order in internal memory,
2) the structure second is pressed from the experienced new remaining index file of sequential read to a last index chain,
3) connect adjacent two chains, for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
For each index file, all wherein block data is configured to a chained list; Simultaneously, match block is pointed to the deposit position in the last complete file, and the piece that do not match points to the deposit position in the increment content file of this index correspondence, and calculates the position of this piece in this version complete file.
In adjacent two chains of described connection,, all need to point to dependence piece corresponding in the old chain for each match block of new chain.
A kind of computing machine this locality and network be the data reconstruction method of increment repeatedly, and this method comprises the steps:
Step 1, the historical backup of scanning;
Step 2 checks whether data type mates, and opens all backup files and sets up index file, in order to reading;
Step 4, according to the index network, block-by-block is read the content of piecemeal in internal memory from the beginning to the end;
Step 5 is whenever read a piecemeal, write recovery files all, and before the read next piecemeal, discharge the shared internal memory of this piecemeal;
Step 6 is recovered file the releasing memory resource.
Further, described a kind of computing machine this locality and network be the data reconstruction method of increment repeatedly, also comprises following technical characterictic:
In step 1, the historical backup of all of scan source file has following steps,
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein backup for the last time, relatively the modification date of this backup file and the source file that needs backup.
In step 2, when setting up index file, check whether data type mates, and at first checks the type of data block, if do not match piece, then directly read the relevant position from the increment content file of correspondence; If match block is then set up and is relied on piece.
In step 3, the method for building up of described index network is:
1) structure article one index chain: each minute block message block-by-block in the most original index file is read, and in internal memory, constituted a chained list in order;
2) the structure second arrives a last index chain: by the index file that is left from experienced new sequential read;
3) connect adjacent two chains: for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
The way of reference of described dependence piece is as follows:
After setting up the index network, from described index network, find the dependence piece of this data block, and read this dependence piece.
The present invention compared with prior art has the following advantages:
(1) before the incremental backup, needn't recover earlier, thereby accelerate backup rate greatly.Incremental backup need compare with the complete source file of the last time backup and new source file, but repeatedly during increment, the last backup be incremental backup file (containing increment content file and index file), rather than complete source file.Prior art is had at first recover a complete source file and is used for the comparison (see figure 4).But the present invention uses repeatedly the increment index file to generate the index network, utilizes the index network, and the source file that can regain one's integrity just can read any content in the complete source file, thereby has avoided this step (see figure 2) of recovery source file.If it is synthetic that prior art is done, then need the time of once recovering this moment when backup; If in backup is not do syntheticly, then the number of times of number of times that need to recover this moment and incremental backup as many.
(2) behind the incremental backup, needn't synthesize, thereby save operation time, minimizing backup space greatly.Prior art need be synthesized (see figure 4), and synthetic operation needs to recover the time of a source file at least; It is synthetic that the present invention has avoided, without any need for the time (see figure 5).The file size that synthesizes is about the summation of all delta files in history, supposes that the content file of each backup is approximately equal, is made as n, backs up k time altogether, and then prior art needs the storage space of k (k+1) n/2 approximately; It is synthetic that the present invention has avoided, and only needs the storage space of kn altogether, only accounts for 2/ (k+1) of prior art requisite space.
When (3) recovering, needn't generate any intermediate file, thereby accelerate resume speed greatly.The recovery of prior art must be based on the complete source file and an incremental backup in a Geju City, for increment repeatedly, n increment for example, prior art has at first recover the 1st intermediate file with the oldest source file and the 1st incremental backup, recover the 2nd intermediate file with the 1st intermediate file and the 2nd incremental backup again, by that analogy, up to obtaining n-1 intermediate file, recover final source file (see figure 5) with n-1 intermediate file and n incremental backup at last.The present invention utilizes the index network can directly locate and read content in the incremental backup of any one version (or the oldest source file backup), has therefore avoided the generation (see figure 3) of any intermediate file fully.Prior art need be recovered the time of n file, and the present invention only need recover the time of 1 file.
Description of drawings
Fig. 1 is the structure and the principle schematic of single incremental backup of the present invention;
Fig. 2 is a repeatedly incremental backup key principle synoptic diagram of the present invention;
Fig. 2 .1 is the present invention repeatedly in the incremental backup process, wherein the synoptic diagram of index network;
Fig. 3 is a repeatedly increment recovery key principle synoptic diagram of the present invention;
Fig. 4 is prior art (synthetic or not synthetic) incremental backup process synoptic diagram;
Fig. 5 is the increment recovery process synoptic diagram of prior art;
Fig. 6 is the repeatedly roughly flow chart of steps of incremental backup, recovery of the present invention.
Specific embodiment
Below in conjunction with accompanying drawing, specify the present invention.
The invention provides a kind of data backup of repeatedly increment, the method for recovery, be primarily aimed at repeatedly increment.Repeatedly increment is organic, the dynamic stack of a plurality of incremental backups.The principle of an incremental backup at first is described below.As shown in Figure 1, after the file of needs backup is modified, just become new source file from old source file.Suppose our the had been friends in the past backup of source file, will obtain changing to the incremental backup of new source file now from old source file.The content of newer, old two source files is during the content that increases newly, deletes, revises when discovery is any, just they borders as piecemeal.After relatively finishing, new, old source file all is divided into a plurality of piecemeals.Every unmodified piece all is the piece of coupling; Every piece that increases, deletes, corrects one's mistakes all is unmatched.A newly-built index file, an increment content file are wherein write down the information of new each piecemeal of source file in the index file, each piecemeal information of the new source file of each that note comprises whether position, length etc. mate.For " position " this information, if the piece of coupling then is recorded in the position in the ancient deed of piecemeal; If unmatched, the content of each piece that do not match is write down in the position of record block in the increment content file then in the increment content file.When recovering, read in index file, according to description, read in the content and write recovery file of piecemeal, if match block then reads in the ancient deed of piecemeal each block message; If do not match piece, then in the increment content file, read, just recovered new file.
As shown in Figure 6, be process flow diagram of the present invention.It has comprised the repeatedly backup and the restoration methods of increment.
(1) the backup method A1 of increment repeatedly,
Step 1, the historical backup of scanning;
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein last backup file, relatively the modification date of this backup file and the source file that needs backup,, then abandon backup, otherwise enter step 3) if the date of last backup file is newer,
3) if this document was never done backup in the past, then this time execute full backup, and finish; Otherwise, enter step 2.
Step 2 is opened the index file and the content file of all incremental backups, and backup file fully, in order to reading;
1) structure article one index chain is read each the block data block-by-block in the most original index file, and constitute a chained list in order in internal memory; Each minute block message block-by-block in the oldest index file is read, and in internal memory, constituted a chained list in order.Wherein match block is pointed to the deposit position in unique complete backup file, and as Fig. 2, Fig. 3 .1, Fig. 3, the match block among the increment index file V1 is pointed to the deposit position in the full backup file; Non-match block is pointed to the deposit position in the increment content file of this index file correspondence, points to increment content file V1, increment content file V2, increment content file V3 respectively as the piece that do not match among the increment index file V1 among Fig. 2, Fig. 3 .1, Fig. 3, increment index file V2, the increment index file V3; And in the process of structure chained list,, obtain the position in the full backup file of this piece by the size of all pieces of front that add up;
2) the structure second is to a last index chain, by the index file that is left from experienced new sequential read.By from experienced new sequential read remaining increment index file V1, increment index file V2, increment index file V3,, all wherein piecemeal information structuring is become a chained list for each index file; Simultaneously, match block is pointed to the deposit position in the last full backup file, the piece that do not match points to the deposit position in the increment content file of this index correspondence, point to increment content file V1 as the piece that do not match among the increment index file V1, the piece that do not match among the increment index file V2 points to increment content file V2, and the piece that do not match among the increment index file V3 points to increment content file V3.By the size of all pieces of front that add up, obtain the position of this piece in the full backup file.
3) connect adjacent two chains, for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
For all two adjacent chains, claim that one of front is an old chain, one of back is new chain.For each match block of new chain, all need to point to dependence piece corresponding in the old chain.Concrete grammar is, by step 2) in the match block that obtains point to deposit position in the last full backup file, search position range (so-called position range in the full backup file of this piece at own version at old chain, be exactly the scope between [reference position, the reference position+block length] of this piece in the complete file of own version) cover this position of new chain.This piece that has covered correspondence position is corresponding dependence piece.So just formed the index network among Fig. 2, Fig. 3.
Step 4, according to the index network, block-by-block is read block data in internal memory from the beginning to the end.Find the dependence piece of this piece by the index network.Read this and rely on piece.If relying on piece is the piece that do not match, then from the increment content file that relies on the piece correspondence, read.If rely on piece is that coupling is determined, and then continues to review to the dependence piece that relies on piece, up to running into the piece that do not match, perhaps runs into the match block in the oldest index file chain.Otherwise carrying out recurrence mates; If the dependence block length that reads does not reach this fast needs, then in the index chain, search the next piece that relies on piece and continue to read, reach the requirement of this piece up to the total length of reading.Like this, just read the content of any one piece.
Step 5 is made comparisons the block data read and the correspondence position of source file, and is generated new incremental backup index file; When obtaining the content of any one piece, set up new increment index file.Then, before read next piecemeal content, discharge the shared internal memory of this piecemeal earlier;
Step 6, later stage work: discharge resource, close the All Files of opening; The buffer memory space that produces in the aforesaid operations process is removed.
(2) the restoration methods A2 of increment repeatedly,
Step 1, the historical backup of scanning;
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein last backup file, relatively the modification date of this backup file and the source file that needs backup,, then abandon backup, otherwise enter step 3) if the date of last backup file is newer,
3) if this document was never done backup in the past, then this time execute full backup, and finish; Otherwise, enter step 2.
Step 2 is opened the index file and the content file of all incremental backups, and backup file fully, in order to reading;
1) structure article one index chain is read each the block data block-by-block in the most original index file, and constitute a chained list in order in internal memory; Each minute block message block-by-block in the oldest index file is read, and in internal memory, constituted a chained list in order.Wherein match block is pointed to the deposit position in unique complete backup file, and as Fig. 2, Fig. 3 .1, Fig. 3, the match block among the increment index file V1 is pointed to the deposit position in the full backup file; Non-match block is pointed to the deposit position in the increment content file of this index file correspondence, points to increment content file V1, increment content file V2, increment content file V3 respectively as the piece that do not match among the increment index file V1 among Fig. 2, Fig. 3 .1, Fig. 3, increment index file V2, the increment index file V3; And in the process of structure chained list,, obtain the position in the full backup file of this piece by the size of all pieces of front that add up;
2) the structure second is to a last index chain, by the index file that is left from experienced new sequential read.By from experienced new sequential read remaining increment index file V1, increment index file V2, increment index file V3,, all wherein piecemeal information structuring is become a chained list for each index file; Simultaneously, match block is pointed to the deposit position in the last full backup file, the piece that do not match points to the deposit position in the increment content file of this index correspondence, point to increment content file V1 as the piece that do not match among the increment index file V1, the piece that do not match among the increment index file V2 points to increment content file V2, and the piece that do not match among the increment index file V3 points to increment content file V3.By the size of all pieces of front that add up, obtain the position of this piece in the full backup file.
3) connect adjacent two chains, for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
For all two adjacent chains, claim that one of front is an old chain, one of back is new chain.For each match block of new chain, all need to point to dependence piece corresponding in the old chain.Concrete grammar is, by step 2) in the match block that obtains point to deposit position in the last full backup file, search position range (so-called position range in the full backup file of this piece at own version at old chain, be exactly the scope between [reference position, the reference position+block length] of this piece in the complete file of own version) cover this position of new chain.This piece that has covered correspondence position is corresponding dependence piece.So just formed the index network among Fig. 2, Fig. 3.
Step 4, according to the index network, block-by-block is read block data in internal memory from the beginning to the end.Find the dependence piece of this piece by the index network.Recover a piece, at first check the type of this piece, if do not match piece, then directly read the relevant position from the increment content file of correspondence; If match block is then read this and is relied on piece.If relying on piece is the piece that do not match, then from the increment content file that relies on the piece correspondence, read.If relying on piece is match block, then continue to review to the dependence piece that relies on piece, up to running into the piece that do not match, perhaps run into the match block in the oldest index file chain.Otherwise carrying out recurrence mates; If the dependence block length that reads does not reach this fast needs, then in the index chain, search the next piece that relies on piece and continue to read, reach the requirement of this piece up to the total length of reading.Like this, just read the content of any one piece.
Step 5 is whenever read a piecemeal, all the write recovery file.And before the read next piecemeal, discharge the internal memory of this piece.
Step 6, later stage work discharges resource, closes the All Files of opening; The buffer memory space that produces in the aforesaid operations process is removed.
Suppose that we have had the backup of ancient deed C: workspace filename, will obtain changing to from ancient deed the incremental backup of new file now.The content of newer, old two files is during the content that increases newly, deletes, revises when discovery is any, just they borders as piecemeal.After relatively finishing, new, ancient deed all is divided into a plurality of piecemeals.Every unmodified piece all is the piece of coupling; Every piece that increases, deletes, corrects one's mistakes all is unmatched.A newly-built index file, an increment content file are wherein write down the information of new each piecemeal of file in the index file, write down the content of each piece that do not match in the increment content file.When recovering, read in index file, read the content of ancient deed C: workspace filename by the index network blocks.According to description to each piece, read in the content of piece and the write recovery file if match block, then ancient deed C: workspace read among the filename; If do not match piece, then in the increment content file, read, just recovered new file.
More than be the description of this invention and non-limiting, based on other embodiment of inventive concept, all among protection scope of the present invention.
Claims (11)
1. computing machine this locality and the network data back up method of increment repeatedly is characterized in that the data back up method of described repeatedly increment comprises the steps:
Step 1, the historical backup of scanning;
Step 2 is opened all incremental backup files and complete backup file, and is set up index file, in order to reading;
Step 3 according to the index file behind the incremental backup repeatedly, is set up the index network;
Step 4, according to the index network, block-by-block is read block data in internal memory from the beginning to the end;
Step 5 is made comparisons the block data read and the correspondence position of source file, and is generated new incremental backup index file;
Step 6 discharges resource, closes the file that all are opened.
2. a kind of computing machine this locality according to claim 1 and network be the data back up method of increment repeatedly, it is characterized in that, the historical backup of the scanning described in the step 1 concrete steps have:
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein last backup file, relatively the modification date of this backup file and the source file that needs backup,, then abandon backup, otherwise enter step 3) if the date of last backup file is newer,
3) if this document was never done backup in the past, then this time execute full backup, and finish; Otherwise, enter step 2.
3. a kind of computing machine this locality according to claim 1 and network be the data back up method of increment repeatedly, it is characterized in that, the method for setting up the index network in the step 3 has:
1) structure article one index chain is read each the block data block-by-block in the most original index file, and constitute a chained list in order in internal memory,
2) the structure second is pressed from the experienced new remaining index file of sequential read to a last index chain,
3) connect adjacent two chains, for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
4. a kind of computing machine this locality according to claim 3 and network be the data back up method of increment repeatedly, it is characterized in that: in article one index chain that constitutes, match block is pointed to the deposit position in the oldest complete backup file, and non-match block is pointed to the deposit position in the increment content file of this index file correspondence; And in the process of structure chained list, calculate the position of each piece in this version complete file;
5. a kind of computing machine this locality according to claim 3 and network be the data back up method of increment repeatedly, it is characterized in that: for each index file, all wherein block data is configured to a chained list; Simultaneously, match block is pointed to the deposit position in the last complete file, and the piece that do not match points to the deposit position in the increment content file of this index correspondence, and calculates the position of this piece in this version complete file;
6. a kind of computing machine this locality according to claim 3 and network be the data back up method of increment repeatedly, it is characterized in that: in adjacent two chains of described connection, for each match block of new chain, all need to point to dependence piece corresponding in the old chain.
7. computing machine this locality and the network data reconstruction method of increment repeatedly is characterized in that the data reconstruction method of described repeatedly increment comprises the steps:
Step 1, the historical backup of scanning;
Step 2 is opened all incremental backup files and complete backup file and is set up index file, in order to reading;
Step 3 according to the index file behind the incremental backup repeatedly, is set up the index network;
Step 4, according to the index network, block-by-block is read the content of piecemeal in internal memory from the beginning to the end;
Step 5 is whenever read a piecemeal, write recovery files all, and before the read next piecemeal, discharge the shared internal memory of this piecemeal;
Step 6 discharges resource, closes the file that all are opened.
8. a kind of computing machine this locality according to claim 7 and network be the data reconstruction method of increment repeatedly, it is characterized in that, in step 1, the historical backup of all of scan source file has following steps:
1) all the historical backup source files under the backup directory are left in scanning in, find this source file initial backup fully and all incremental backups afterwards, and deposit all incremental backups in a chained list,
2) take out wherein backup for the last time, relatively the modification date of this backup file and the source file that needs backup.
9. a kind of computing machine this locality according to claim 7 and network be the data reconstruction method of increment repeatedly, it is characterized in that: in step 2, when setting up index file, check whether data type mates, at first check the type of data block, if do not match piece, then directly read the relevant position from the increment content file of correspondence; If match block is then set up and is relied on piece.
10. a kind of computing machine this locality according to claim 7 and network be the data reconstruction method of increment repeatedly, it is characterized in that, in step 3, the method for building up of described index network is:
1) structure article one index chain: each minute block message block-by-block in the most original index file is read, and in internal memory, constituted a chained list in order;
2) the structure second arrives a last index chain: by the index file that is left from experienced new sequential read;
3) connect adjacent two chains: for all two adjacent chains, claim that one of front is an old chain, one of back is new chain.
11., it is characterized in that the way of reference of described dependence piece is as follows according to claim 9 and 10 described a kind of computing machine this locality and the network data reconstruction method of increment repeatedly:
After setting up the index network, from described index network, find the dependence piece of this data block, and read this dependence piece.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101536126A CN102236586A (en) | 2010-04-21 | 2010-04-21 | Local and network multiple incremental data backup and recovery method of computer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101536126A CN102236586A (en) | 2010-04-21 | 2010-04-21 | Local and network multiple incremental data backup and recovery method of computer |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102236586A true CN102236586A (en) | 2011-11-09 |
Family
ID=44887256
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101536126A Pending CN102236586A (en) | 2010-04-21 | 2010-04-21 | Local and network multiple incremental data backup and recovery method of computer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102236586A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104123280A (en) * | 2013-04-24 | 2014-10-29 | 中国银联股份有限公司 | File comparison method and device |
| CN106681859A (en) * | 2016-11-25 | 2017-05-17 | 青岛海信移动通信技术股份有限公司 | Short message restoration method and device |
| CN107506265A (en) * | 2017-08-30 | 2017-12-22 | 安徽天达网络科技有限公司 | A kind of backup of otherness telefile and recovery system based on internet |
| CN107506260A (en) * | 2017-07-27 | 2017-12-22 | 南京南瑞集团公司 | A kind of dynamic division database incremental backup method |
| CN108132855A (en) * | 2017-12-07 | 2018-06-08 | 重庆邮电大学 | A kind of full service data backup policy in mobile ad-hoc network |
| CN109508254A (en) * | 2017-09-14 | 2019-03-22 | 华为技术有限公司 | A kind of data reconstruction method and device |
| CN110083490A (en) * | 2019-04-29 | 2019-08-02 | 浙江豪联信息科技有限公司 | A kind of database backup method, restoring method and storage medium |
| CN110858123A (en) * | 2018-08-23 | 2020-03-03 | 华为技术有限公司 | Method and device for calculating size of backup file |
| CN117435403A (en) * | 2023-12-21 | 2024-01-23 | 成都云祺科技有限公司 | Processing index merging method, system and invalid data processing method in persistent backup |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6564219B1 (en) * | 1998-11-19 | 2003-05-13 | Emc Corporation | Method and apparatus for obtaining an identifier for a logical unit of data in a database |
| US6631477B1 (en) * | 1998-03-13 | 2003-10-07 | Emc Corporation | Host system for mass storage business continuance volumes |
| CN101051285A (en) * | 2006-09-21 | 2007-10-10 | 上海交通大学 | File matching method in computer network data backup |
| CN101064730A (en) * | 2006-09-21 | 2007-10-31 | 上海交通大学 | Local and remote backup method for computer network data file |
| CN101441582A (en) * | 2007-11-20 | 2009-05-27 | 北京和力记易科技有限公司 | Backup and recovery method of computer data object and system and program product for implementing the same |
| CN101477487A (en) * | 2009-01-22 | 2009-07-08 | 上海交通大学 | Multiple incremental files backup and recovery method |
-
2010
- 2010-04-21 CN CN2010101536126A patent/CN102236586A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6631477B1 (en) * | 1998-03-13 | 2003-10-07 | Emc Corporation | Host system for mass storage business continuance volumes |
| US6564219B1 (en) * | 1998-11-19 | 2003-05-13 | Emc Corporation | Method and apparatus for obtaining an identifier for a logical unit of data in a database |
| CN101051285A (en) * | 2006-09-21 | 2007-10-10 | 上海交通大学 | File matching method in computer network data backup |
| CN101064730A (en) * | 2006-09-21 | 2007-10-31 | 上海交通大学 | Local and remote backup method for computer network data file |
| CN101441582A (en) * | 2007-11-20 | 2009-05-27 | 北京和力记易科技有限公司 | Backup and recovery method of computer data object and system and program product for implementing the same |
| CN101477487A (en) * | 2009-01-22 | 2009-07-08 | 上海交通大学 | Multiple incremental files backup and recovery method |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104123280A (en) * | 2013-04-24 | 2014-10-29 | 中国银联股份有限公司 | File comparison method and device |
| CN104123280B (en) * | 2013-04-24 | 2017-08-25 | 中国银联股份有限公司 | File comparison method and equipment |
| CN106681859A (en) * | 2016-11-25 | 2017-05-17 | 青岛海信移动通信技术股份有限公司 | Short message restoration method and device |
| CN106681859B (en) * | 2016-11-25 | 2021-01-22 | 青岛海信移动通信技术股份有限公司 | Short message recovery method and device |
| CN107506260B (en) * | 2017-07-27 | 2019-11-05 | 南京南瑞集团公司 | A kind of dynamic division database incremental backup method |
| CN107506260A (en) * | 2017-07-27 | 2017-12-22 | 南京南瑞集团公司 | A kind of dynamic division database incremental backup method |
| CN107506265A (en) * | 2017-08-30 | 2017-12-22 | 安徽天达网络科技有限公司 | A kind of backup of otherness telefile and recovery system based on internet |
| CN109508254A (en) * | 2017-09-14 | 2019-03-22 | 华为技术有限公司 | A kind of data reconstruction method and device |
| CN109508254B (en) * | 2017-09-14 | 2020-09-08 | 华为技术有限公司 | Data recovery method and device |
| US11397537B2 (en) | 2017-09-14 | 2022-07-26 | Huawei Technologies Co., Ltd. | Data restoration method and apparatus |
| CN108132855A (en) * | 2017-12-07 | 2018-06-08 | 重庆邮电大学 | A kind of full service data backup policy in mobile ad-hoc network |
| CN108132855B (en) * | 2017-12-07 | 2021-08-06 | 重庆邮电大学 | Method for backing up complete service data in mobile self-organizing network |
| CN110858123A (en) * | 2018-08-23 | 2020-03-03 | 华为技术有限公司 | Method and device for calculating size of backup file |
| CN110858123B (en) * | 2018-08-23 | 2021-06-01 | 华为技术有限公司 | Method and device for calculating size of backup file |
| CN110083490A (en) * | 2019-04-29 | 2019-08-02 | 浙江豪联信息科技有限公司 | A kind of database backup method, restoring method and storage medium |
| CN117435403A (en) * | 2023-12-21 | 2024-01-23 | 成都云祺科技有限公司 | Processing index merging method, system and invalid data processing method in persistent backup |
| CN117435403B (en) * | 2023-12-21 | 2024-03-12 | 成都云祺科技有限公司 | Processing index merging method, system and invalid data processing method in persistent backup |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101477487B (en) | Multiple incremental files backup and recovery method | |
| CN102236586A (en) | Local and network multiple incremental data backup and recovery method of computer | |
| CN102436408B (en) | Data storage cloud and cloud backup method based on Map/Dedup | |
| CN100365632C (en) | Processing method for realizing consistency of internal storage data and data bank data service | |
| CN106021016A (en) | Virtual point in time access between snapshots | |
| CN107391306B (en) | Heterogeneous database backup file recovery method | |
| US7801846B2 (en) | Generating log sequence identifiers to apply a transaction to a storage system | |
| CN101409877B (en) | Method for generating call ticket | |
| CN105938457B (en) | Filter method, device and the data reading system of data | |
| US9002800B1 (en) | Archive and backup virtualization | |
| CN101464890B (en) | Mixed log generation method and resolution method | |
| CN101625703B (en) | Method and system for merging logs of memory database | |
| CN102426609A (en) | Index generation method and index generation device based on MapReduce programming architecture | |
| WO2005086032A1 (en) | Database data recovery system and method | |
| CN101944114A (en) | Data synchronization method between memory database and physical database | |
| CN102339321A (en) | Network file system with version control and method using same | |
| CN102945278A (en) | Method and device for redoing logs of database records | |
| CN103838847A (en) | Data organization method oriented to sea-cloud collaboration network computing network | |
| CN101692226A (en) | Storage method of mass filing stream data | |
| CN108614876B (en) | Redis database-based system and data processing method | |
| CN102629250A (en) | Recovery method of redo log files for main memory database | |
| CN107402981A (en) | A kind of data increment processing method and system based on distributed offline database | |
| EP3953819A1 (en) | Object storage change-events | |
| CN107229540A (en) | A kind of database restoring method and system based on time point | |
| ATE463797T1 (en) | DATABASE DATA RECOVERY SYSTEM AND METHOD |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20111109 |