CN100353331C - Long-distance data fast restoring method of network information system - Google Patents
Long-distance data fast restoring method of network information system Download PDFInfo
- Publication number
- CN100353331C CN100353331C CNB2006100204625A CN200610020462A CN100353331C CN 100353331 C CN100353331 C CN 100353331C CN B2006100204625 A CNB2006100204625 A CN B2006100204625A CN 200610020462 A CN200610020462 A CN 200610020462A CN 100353331 C CN100353331 C CN 100353331C
- Authority
- CN
- China
- Prior art keywords
- data
- data block
- digest value
- reset terminal
- backup end
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 18
- 238000011084 recovery Methods 0.000 claims abstract description 24
- 238000009825 accumulation Methods 0.000 claims description 3
- 238000005192 partition Methods 0.000 claims description 2
- 238000010276 construction Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 3
- 238000005498 polishing Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
Images
Abstract
The present invention provides a long-distance data fast recovering method of a network information system, which belongs to the field of data backup and disaster recovery. The present invention carries out the difference recovery of the data of a recovery end according to the data of the backup end by the difference comparison of the data of the backup end and the data of the recovery end, wherein the physical position of the data of the recovery end and the physical position of the data of the backup end are not limited and are kept for a long distance. The data of the recovery end and the data of the backup end can be file data, databank data, disk data, etc. The present invention has the characteristics of fast speed of data recovery, low request to network bandwidth, transparency to an application layer, etc. The present invention can be widely used on the long-distance data backup and the disaster recovery which are based on the internet, and has low construction cost and wide application prospect.
Description
One, technical field
The present invention proposes a kind of long-distance data fast restoring method of network information system, belong to data backup and disaster recovery field.
Two, background technology
In network information system, after disaster takes place, can be to guarantee commercial continuous key from remote backup center restore data, minimizing out of service time apace.The method of disaster recovery at present has the rsync of employing to carry out the data recovery, utilizes the recovery instrument of database oneself, utilizes the data of backup end to carry out schemes such as complete data copy.These technology respectively have its relative merits: rsync that certain advantage is arranged in the saving of resume speed and bandwidth, but because it is based on the file-level operation, powerless at big file as the database, and its recovery can not be satisfied the requirement of real-time, can only recover the data of the last backup end.Relevant based on the realization of the recovery scheme of database, and generally provide by the manufacturer of database with the realization of concrete database, costliness very normally.Carrying out problem that complete data copy scheme exists according to the data of backup end is that data volume load big, network the speed big, that recover of copy is low.
The present invention proposes a kind of general long-distance data fast restoring method of network information system, have following characteristics:
1) resume speed of data is fast, low to the bandwidth requirement of network;
2) this method can be based on the Internet of cheapness, and operating cost reduces;
3) recovery of data is based on data block, to layer transparent.
The present invention can support user's data recovery system with minimum cost structure oneself on Internet, has broad application prospects.
Three, summary of the invention
The present invention proposes a kind of long-distance data fast restoring method of network information system, this method utilization backup end data carries out data to the reset terminal data and recovers, make the reset terminal data be in consistent state with the backup end data, wherein reset terminal and backup end position physically are not limited, can divide to be in the strange land, reset terminal data and backup end data can be file data, database data, data in magnetic disk etc.
This method is at first carried out same deblocking to reset terminal data and backup end data, and reset terminal data and backup end data obtain set of data blocks separately respectively behind the piecemeal.When the reset terminal data are carried out deblocking with the backup end data, all take same method of partition, therefore, the data block that obtains behind data block that obtains behind the reset terminal deblocking and the backup end data piecemeal is corresponding one by one, and each data block of reset terminal data has unique data block corresponding with it in the backup end data.Secondly, each data block of reset terminal data and each data block of backup end data are asked digest value respectively; Then, the digest value of each data block of reset terminal data is compared with the digest value of the corresponding data block of backup end data respectively, if the digest value of the data block of reset terminal data and backup the end data digest value of the data block of correspondence with it are identical, think that then the data of this data block are consistent at reset terminal with the backup end, this blocks of data need not to recover, otherwise, think that then the data of this data block are inconsistent at reset terminal and backup end, utilize this blocks of data of backup end to cover the reset terminal corresponding data block, finish resuming work of this blocks of data.All data blocks that reset terminal and backup are held all adopt same difference restoration methods, to finish resuming work of whole data.Usually, in actual applications, when system broke down, system's current data and Backup Data difference therebetween was less, needed the content of recovery few, and therefore, the present invention can be with the data of high efficiency mode recovery system.
Four, description of drawings
Fig. 1 is a fundamental diagram of the present invention.
Fig. 2 is the step of deblocking.
Fig. 3 is the step that the data block digest value calculates.
Fig. 4 is the step that variance data is recovered.
Five, embodiment
Describe concrete grammar of the present invention in detail below in conjunction with accompanying drawing.
Fig. 1 is a fundamental diagram of the present invention.
Fig. 1 fundamental diagram of the present invention, wherein reset terminal data and backup end data position physically are not limited, can divide to be in the strange land.The data recovery is mainly realized by the combination of three steps such as deblocking, the calculating of data block digest value and variance data recovery as seen from the figure.Wherein the deblocking step is carried out deblocking to reset terminal data and backup end data, sets up set of data blocks separately; Data block digest value calculation procedure is carried out digest value to each data block of reset terminal data and backup end data and is calculated; The variance data recovering step compares the digest value of reset terminal data block and the digest value of backup end respective data blocks, realizes the variance data of data block is recovered.
Particularly, the step of the long-distance data fast restoring method of network information system of the present invention's proposition may further comprise the steps:
1) step of deblocking;
2) step of data block digest value calculating;
3) step of variance data recovery.
Fig. 2 is the step of deblocking.
Fig. 2 has provided the example of data being carried out deblocking.Data are made up of data cell among the figure, each data unit size is identical, if the size of last data cell of data is less than the size of other data cell, then make its size and other data cell big or small consistent with last data cell of blank polishing.Data block is made up of continuous in logic one or more data cells, and the size of each data block can be different.Like this, data can be regarded as by data cell and form, and also can regard as by data block and form.
The deblocking step is as follows:
1) step of reset terminal deblocking: the reset terminal data are carried out piecemeal, and concrete steps are as follows:
1. the size of definition of data unit: the data cell that data is divided into the fixed length size, if the size of last data cell of data is less than the size of definition of data unit, then making its size with last data cell of blank polishing is the size of definition of data unit;
2. the size of definition of data piece: the size of specifies data block, the number of data units that promptly comprises, the size of each data block can be different.
3. the number of computational data piece: the number that calculates the data block that constitutes whole data.
2) step of backup end data piecemeal: the reset terminal data are carried out piecemeal, and concrete steps are as follows:
1. the size of definition of data unit: the data cell that data is divided into the fixed length size, if the size of last data cell of data is less than the size of definition of data unit, then making its size with last data cell of blank polishing is the size of definition of data unit;
2. the size of definition of data piece: the size of specifies data block, the number of data units that promptly comprises, the size of each data block can be different.
3. the number of computational data piece: the number that calculates the data block that constitutes whole data.
By above step, the reset terminal data are carried out the same deblocking with the backup end data, it is all identical with the size of the number of the size of backup end data data cell when the piecemeal, data block, each data block to be the reset terminal data, and the data block set separately of end data and backup end data is restored behind the piecemeal.
The step that Fig. 3 data block digest value calculates.
Fig. 3 has provided the example that the data block digest value calculates.H is the digest calculations function among the figure, as MD5, SHA-1 etc., illustrated data block is made up of m data unit, and each data cell has a digest value, draw the digest value of data block among the figure by the digest value of each data cell of accumulation calculating, h is the digest value of data in graph form piece among the figure.
The step that the data block digest value calculates is as follows:
1) data block digest calculations initialization: the initialization related variable makes the digest value h=sky of data block, the numbering i=1 of data cell;
2) the digest value h ' of calculating current data unit: h '=H (d
i), wherein H is an abstract function, as MD5, SHA-1 etc., d
iIt is the i blocks of data unit of current data block;
3) current data block digest value: h=H (h ⊙ h ') is calculated in accumulation, and wherein ⊙ represents the character string concatenation operation; I=i+1; If i is not more than the size of current data block, then change 2), otherwise h is the digest value of current data block.
Fig. 4 is the step that variance data is recovered.
Fig. 4 has provided the step that variance data is recovered, and as shown in the figure, at first carries out variance data and recovers initial work; Secondly calculate the digest value of reset terminal and the corresponding data block of backup end data respectively; The digest value of comparing data piece then, if the digest value of data block is identical, think that then the data of this data block of reset terminal data and the data of respective data blocks of backup end data are in consistent state, if the digest value difference of data block, think that then the data of this data block of reset terminal data and the data of respective data blocks of backup end data are in inconsistent state, utilize this moment this blocks of data of backup end to cover the reset terminal corresponding data block, finish resuming work of this blocks of data; All data blocks that reset terminal and backup are held all adopt same difference restoration methods, to finish resuming work of the whole data of reset terminal.
Particularly, the step of variance data recovery is as follows:
1) variance data is recovered initialization: the initialization related variable makes the numbering i=1 of data block;
2) digest value of calculating reset terminal data respective data blocks: the step of calling the calculating of data block digest value is calculated the digest value h of the i blocks of data piece of reset terminal data;
3) calculate the digest value that backs up the end data respective data blocks: the step of calling the calculating of data block digest value is calculated the digest value h ' of the i blocks of data piece of backup end data;
4) the data block data are recovered: by comparing the difference of two ends digest value, take the difference restoration methods to carry out data block and recover, concrete steps are as follows:
1. the difference of two ends data block relatively: if h=h ', two ends data consistent then, this blocks of data does not need to recover, otherwise, change 2.;
2. obtain the backup end data: extract i blocks of data d at the backup end
i
3. data are recovered: utilize d
iData cover reset terminal i blocks of data;
5) circulation recovers next data block: i=i+1; If i is not more than the sum of data block, then change 2), otherwise end data is resumed work.
Claims (1)
1. a long-distance data fast restoring method of network information system is characterized in that may further comprise the steps: the step of deblocking; The step that the data block digest value calculates; The step that variance data is recovered; Wherein
(1) step of deblocking: adopt same method of partition that reset terminal and backup end are carried out piecemeal, the data block set separately of end and backup end is restored, data block in the set of reset terminal data block is corresponding one by one with the data block in the backup end data set of blocks, and the step of concrete deblocking may further comprise the steps:
1) size of definition of data unit is divided into data the step of the data cell of fixed length size;
2) size of definition of data piece promptly defines the step of the number of data units that each data block comprises;
3) number of computational data piece promptly calculates the step of number of data blocks according to the size of the size of data cell and data block;
(2) step of data block digest value calculating: the data block that data piecemeal step obtains is carried out digest value calculating, and the step that concrete data block digest value calculates may further comprise the steps:
1) the data block digest value calculates initialized step;
2) from first data cell of data block,, successively each data cell of data block is carried out following steps up to last data cell of data block:
1. calculate the step of the digest value of current data unit;
2. the step of current data block digest value is calculated in accumulation;
(3) step of variance data recovery: carry out variance data according to the result of calculation of data block digest value and recover, the step that concrete variance data is recovered may further comprise the steps:
1) variance data is recovered initialized step;
2) from first data block of reset terminal and backup end, up to last data block of reset terminal and backup end, following steps are carried out in circulation:
1. calculate the step of the digest value of reset terminal data data block;
2. calculate the step of backup end data corresponding to the digest value of described reset terminal data block;
3. the step recovered of data block data comprises:
A) step of the difference of reset terminal and backup end data piece relatively: the digest value and the digest value of backup end corresponding to described reset terminal data block of reset terminal data block are compared, if both equate, then finish the epicycle circulation, otherwise change b);
B) obtain the step that backs up end data: the data of obtaining backup end current data block;
C) step of data recovery: the data that cover the reset terminal current data block with the data of backup end current data block.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100204625A CN100353331C (en) | 2006-03-10 | 2006-03-10 | Long-distance data fast restoring method of network information system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100204625A CN100353331C (en) | 2006-03-10 | 2006-03-10 | Long-distance data fast restoring method of network information system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1818880A CN1818880A (en) | 2006-08-16 |
| CN100353331C true CN100353331C (en) | 2007-12-05 |
Family
ID=36918902
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100204625A Expired - Fee Related CN100353331C (en) | 2006-03-10 | 2006-03-10 | Long-distance data fast restoring method of network information system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100353331C (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102073560A (en) * | 2011-01-17 | 2011-05-25 | 北京深思洛克软件技术股份有限公司 | Data backup method and device |
| CN103428245A (en) * | 2012-05-21 | 2013-12-04 | 联想(北京)有限公司 | Method for data backup and recovery, terminal device and server |
| CN104199925B (en) * | 2014-09-01 | 2018-07-10 | 安一恒通（北京）科技有限公司 | Ile repair method and device |
| CN104679614B (en) * | 2015-03-31 | 2018-03-27 | 成都文武信息技术有限公司 | A kind of Database Disaster Backup/Recover |
| CN106528677A (en) * | 2016-10-31 | 2017-03-22 | 努比亚技术有限公司 | Data comparison method and device |
| CN111831481B (en) * | 2020-07-10 | 2021-09-07 | 厦门靠谱云股份有限公司 | Database remote backup and recovery method and system based on C/S architecture |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6081875A (en) * | 1997-05-19 | 2000-06-27 | Emc Corporation | Apparatus and method for backup of a disk storage system |
| US6131148A (en) * | 1998-01-26 | 2000-10-10 | International Business Machines Corporation | Snapshot copy of a secondary volume of a PPRC pair |
| US6332177B1 (en) * | 1998-10-19 | 2001-12-18 | Lsi Logic Corporation | N-way raid 1 on M drives block mapping |
| CN1352427A (en) * | 2001-11-26 | 2002-06-05 | 北京实达铭泰计算机应用技术开发有限公司 | Recovery method for computer system |
-
2006
- 2006-03-10 CN CNB2006100204625A patent/CN100353331C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6081875A (en) * | 1997-05-19 | 2000-06-27 | Emc Corporation | Apparatus and method for backup of a disk storage system |
| US6131148A (en) * | 1998-01-26 | 2000-10-10 | International Business Machines Corporation | Snapshot copy of a secondary volume of a PPRC pair |
| US6332177B1 (en) * | 1998-10-19 | 2001-12-18 | Lsi Logic Corporation | N-way raid 1 on M drives block mapping |
| CN1352427A (en) * | 2001-11-26 | 2002-06-05 | 北京实达铭泰计算机应用技术开发有限公司 | Recovery method for computer system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1818880A (en) | 2006-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100353331C (en) | Long-distance data fast restoring method of network information system | |
| CN101739313B (en) | Method for protecting and restoring continuous data | |
| CN102891849B (en) | Service data synchronization method, data recovery method, data recovery device and network device | |
| WO2012065408A1 (en) | Disaster tolerance data backup method and system | |
| US20080313241A1 (en) | Distributed data storage using erasure resilient coding | |
| CN104541252A (en) | Server-based hierarchical mass storage system | |
| CN103729151B (en) | A kind of fail data restorative procedure based on modified model correcting and eleting codes | |
| CN103336785A (en) | Distributed storage method and distributed storage device based on network coding | |
| CN109491835B (en) | Data fault-tolerant method based on dynamic block code | |
| CN103944981A (en) | Cloud storage system and implement method based on erasure code technological improvement | |
| CN111444042B (en) | Block chain data storage method based on erasure codes | |
| WO2016058289A1 (en) | Mds erasure code capable of repairing multiple node failures | |
| CN104252466A (en) | Stream computing processing method, equipment and system | |
| CN103116615A (en) | Data index method and server based edition vector | |
| CN103902410A (en) | Data backup acceleration method for cloud storage system | |
| CN111831223B (en) | Fault-tolerant coding method, device and system for improving expandability of data deduplication system | |
| WO2015180038A1 (en) | Partial replica code construction method and device, and data recovery method therefor | |
| CN111104069A (en) | Multi-region data processing method and device of distributed storage system and electronic equipment | |
| CN103281400A (en) | Data segmenting, coding and recovering method used for cloud storage gateway | |
| CN103377100A (en) | Data backup method, network nodes and system | |
| CN103544270B (en) | The generalization network code fault tolerant storage platform at data-oriented center and method of work | |
| CN108900621B (en) | Fog computing mode-based difference cloud synchronization method | |
| CN110083487A (en) | A kind of reference data block fragment removing method and system based on data locality | |
| CN105681425B (en) | Multinode restorative procedure and its system based on distributed memory system | |
| CN102841840B (en) | The message logging restoration methods that Effect-based operation reorders and message number is checked |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: SICHUAN GREAT TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: SICHUAN UNIVERSITY Effective date: 20100513 |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 610065 NO.24, SOUTH 1ST SECTION, 1ST RING ROAD, CHENGDU CITY, SICHUAN PROVINCE TO: 610041 2/F, COMPLEX BUILDING (FACING THE STREET), CHENGDU KEHUA MIDDLE ROAD PRIMARY SCHOOL, NO.2, CHANGSHOU ROAD, WUHOU DISTRICT, CHENGDU CITY |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20100513 Address after: 610041, Wuhou District, Changshou Road, Chengdu No. 2 Chengdu KELONG Road Primary School Street building two floor Patentee after: Sichuan Gerite Technology Co., Ltd. Address before: 610065 Sichuan, Chengdu, South Ring Road, No. 1, No. 24 Patentee before: Sichuan University |
|
| ASS | Succession or assignment of patent right |
Owner name: CHENGDU GLOBAL CAPSHEAF TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: SICHUAN GREAT TECHNOLOGY CO., LTD. Effective date: 20130402 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20130402 Address after: 610000 C-411 Asia Pacific Plaza, KELONG North Road, Sichuan, Chengdu Patentee after: Chengdu century summit Technology Co., Ltd. Address before: 610000, Sichuan, Wuhou District, Changshou Road, Chengdu No. 2 Chengdu KELONG Road Primary School Street building two floor Patentee before: Sichuan Gerite Technology Co., Ltd. |
|
| DD01 | Delivery of document by public notice |
Addressee: Wang Zhengtao Document name: Notification of Passing Examination on Formalities |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20071205 Termination date: 20180310 |