CN101149693A - Computer hard disk data continuous time point storage and recovery method - Google Patents

Computer hard disk data continuous time point storage and recovery method Download PDF

Info

Publication number
CN101149693A
CN101149693A CNA2007100189920A CN200710018992A CN101149693A CN 101149693 A CN101149693 A CN 101149693A CN A2007100189920 A CNA2007100189920 A CN A2007100189920A CN 200710018992 A CN200710018992 A CN 200710018992A CN 101149693 A CN101149693 A CN 101149693A
Authority
CN
China
Prior art keywords
sector
write operation
write
backup
data
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.)
Granted
Application number
CNA2007100189920A
Other languages
Chinese (zh)
Other versions
CN100524237C (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.)
XI'AN SAMING TECHNOLOGY Co Ltd
Original Assignee
XI'AN SAMING TECHNOLOGY 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 XI'AN SAMING TECHNOLOGY Co Ltd filed Critical XI'AN SAMING TECHNOLOGY Co Ltd
Priority to CNB2007100189920A priority Critical patent/CN100524237C/en
Publication of CN101149693A publication Critical patent/CN101149693A/en
Application granted granted Critical
Publication of CN100524237C publication Critical patent/CN100524237C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Techniques For Improving Reliability Of Storages (AREA)

Abstract

This invention discloses the method how the computer hard disk data saves and restores run-on time spot, including the following steps: Carries on the piecemeal management to the hard disk, through intercepting the visit requested the operating system to hard disk, the written data backups to the data warehouse continually, at the same time the hard disk writes data, realizes the continual memory for the hard disk run-on time data. When needs it, chooses any time data from the data warehouse to carry on the restoration, realizes the random restoration. This invention is characterized in that it can save the data condition of the run-on time fast and continuously when the hard disk is processing, but does not interfere with the user work, takes few space of the hard disk, to restore the data condition of any-time pot accurately, rapidly.

Description

Computer hard disk data continuous time point storage and the method for recovering
Technical field
The invention belongs to the Computer Data Security field, particularly computer hard disk data continuous time point storage and the method for recovering.
Background technology
Hard disk is a most important equipment in the present data storage, guarantees that hard disc data safety is significant to the data security of whole computer system.In the process that hard disk uses, maloperation, infective virus, various software defect all might cause losing of hard disc data or destroy, for some user's key application, and the losing or destroy and might bring massive losses of any amount of data.So need the data that a kind of method is preserved before can recovering fast when hard disc data is lost or destroy.Existing technical scheme, normally in the moment of user's appointment, the operation of suspension system is carried out the copy backup operation to system again.When data are lost or destroy, can return to the data mode that the user preserved.What these methods major parts adopted is the copy backup principle; on hard disk, mark off a shielded zone; in backup with the valid data copy backup of target partition in the protected field, the data of when recovering, from the protected field, reading Backup Data coverage goal subregion.The guard method of existing hard disc data can only be preserved the subregion state of putting or preserve limited time point sometime, and when preserving the state of certain time point, need have influence on the operation of system, such as the read-write of supspending hard disk.Generally speaking, it is bigger needing the partition data amount of backup, utilize the data of a time point of existing technology backup will spend a large amount of storage spaces, and also need to back up the data of a plurality of time points sometimes, so the storage space that takies will be directly proportional with backup quantity, and the data major part between a plurality of backups is repetition, and the disk expense can't be stood.In the process of backup, need the operation of interrupt system or application, switching operating system, whole backup procedure continue dozens of minutes possibly, and this also can delay user's work.
Summary of the invention
Limited for the backup point data of the storage that solves existing hard disc data and restoration methods, back-up job is time-consuming, backup point takies shortcomings such as hard drive space is big, the invention provides a kind of storage continuously fast, do not influence user job, take hard drive space few, can return to a kind of computer hard disk data continuous time point storage and the restoration methods of the valid data of point any time.This method can be continuous the data put any time of automatic preservation, when needed, fdisk can be returned to the state of any needs.
Technical scheme of the present invention is: a kind of computer hard disk data continuous time point storage and the method for recovering may further comprise the steps:
(1) hard disk is carried out block management, regard fdisk as combination, set up a sector block mark table, write down the situation that each sector piece carries out write operation by consecutive identical big or small sector piece;
(2) in the process of system's operation, by the request of access of capturing operation system at hard disk, monitoring in real time is to the write operation of fdisk, when a write operation arrives, earlier write operation is split into writing of continuous several sectors piece, the sector block size is consistent with the middle definition of above-mentioned steps (1);
(3) the sector piece write operation that breaks is handled: will write the data continuous backup to data warehouse when will write data, and realize the lasting storage of hard disk point data continuous time hard disk;
1) if for the first time to the write operation of sector piece, the content backup of then reading this sector piece earlier arrives data warehouse, and sets up a write operation requests backup, and the time is the time that whole write operation supervisory system begins;
2) will write the fast content backup of data to data warehouse, and set up a write operation requests backup, the time is current system time;
(4) through after above-mentioned steps (3) processing, again data are write corresponding sector piece;
(5) when needed, from data warehouse, select arbitrary time point data to recover, realize any recovery of hard disk point data continuous time:
1) from data warehouse, obtains to recover all write operation requests backups that this time point needs;
2) the sector content that will write with record in the write operation requests backup that obtains is written in the write operation initial sector of write operation requests backup appointment.
Described sector block mark table is made up of zone bit, and each zone bit is represented a sector piece, and zone bit has two states, on behalf of this sector piece, 0 also do not write data, on behalf of this sector piece, 1 write data, and during initialization, the zone bit of subregion middle fan block all is 0.
Described data warehouse is the position that Backup Data is deposited, in the protection subregion, set up a big file as data warehouse, the sector piece that data warehouse used no longer is operated system and uses, data warehouse is made up of the write operation requests backup: in operating system, a write operation requests is made up of following three aspects: operation initial sector, the sector number of operation, the sector content that will write; In data warehouse, the backup of write operation requests is made up of following four aspects: operation initial sector, the sector number of operation, the sector content that will write, the time of sending write operation, it is big or small identical that write operation requests backs up.
Backup write operation step is as follows:
(1) intercept a write operation requests after, according to the operation initial sector of write operation requests and the sector number of operation, find this operating influence all sector pieces to the hard disk, influence several sectors piece, just form several write operation requests backups, the time of write operation requests backup is for intercepting and capturing the time of write operation;
(2) check the zone bit of the sector piece that write operation has influence on, if be 0, then this sector piece never was written to, need to form extra write operation requests backup: the operation initial sector is that the sector number of sector piece initial sector, operation is the sector block size, the sector content that will write is that the raw content of reading this sector piece, the time of sending write operation are the whole time that begins to intercept and capture the hard disk visit, after write operation requests backup write data warehouse, make the zone bit of this sector piece into 1, preserve the sign table then;
(3) the write operation requests backup that forms in the step (1) is written to data warehouse.
Realize that hard disc data recovers arbitrarily to realize may further comprise the steps:
(1) the restore data operand is whole subregion.
(2) sequential read that starts anew rounds write operation requests backup in the data warehouse, up to the time that the time of write operation requests backup returns to greater than needs, constructs the chained list of the write operation that a recovery operation need carry out:
When there is not identical catena in writing of the write operation requests backup that scans in Sector Range and the chained list, in chained list, increase an item newly, if there is the identical catena of writing Sector Range, then delete this catena and add a new catena, the initial sector that the write operation requests that current scanning is pointed in its data warehouse position backs up, the initial beginning sector of operation is the write operation requests backup, the sector number of operation are the sector number of the operation of write operation requests backup.Owing to be the write operation requests backup that sequential read rounds a data warehouse, comprised the nearest write operation record of the moment that recovers to needs so can guarantee the chained list of setting up.
(3) content that will write the sector of the write operation requests backup that catena mapping in the chained list is pointed to is write in the write operation initial sector of write operation requests backup appointment, and the sector number that write is the sector number of the operation of write operation requests backup appointment.
The invention has the beneficial effects as follows, can store the data mode of continuous time point in the hard disk use fast continuously, do not influence user job, take the data mode that hard drive space is few, can return to any time point quickly and accurately.
Description of drawings
Fig. 1 is a storage principle process flow diagram of the present invention.
Fig. 2 be hard disc data of the present invention when continuing storage the partition write operation requests be the method synoptic diagram of write operation requests backup.
Fig. 3 is that hard disc data of the present invention concerns synoptic diagram between chained list and the data warehouse when recovering arbitrarily.
Fig. 4 is a hard disk sector bulk state synoptic diagram in the continuous time point storing process.
Fig. 5 is the write operation requests backup synoptic diagram of depositing in the different time data warehouse in the continuous time point storing process.
Embodiment
The present invention is divided into two parts in operating process, be respectively that hard disc data continues storage and hard disc data recovers arbitrarily.
1, the lasting storage of hard disc data may further comprise the steps:
(1) hard disk is carried out block management, set up sector block mark table: the present invention will carry out block management to hard disk, hard disk be regarded as the combination of the sector piece of continuous identical size.Set up a sector block mark table, write down the situation that each sector piece carries out write operation.Sector block mark table is made up of zone bit, and each zone bit is represented a sector piece, and zone bit has two states, on behalf of this sector piece, 0 also do not write data, on behalf of this sector piece, 1 write data, and during initialization, the zone bit of subregion middle fan block all is 0.
(2) the capturing operation system is to the write operation of hard disk, revise sector block mark table simultaneously: all methods to the hard disk visit of capturing operation system are: drive install one in current system in the middle of, the middle driving on the disk unit port driver, under the operating system hard disk read-write interface, all operations system disk read-write requests all can drive through middle earlier, and then mails to the disk unit port driver.
The present invention writes data with hard disk and backs up to data warehouse simultaneously.Data warehouse is the position that Backup Data is deposited, and sets up a big file as data warehouse (file size can be specified by the user, and file is big more, and then the Backup Data that can store is many more) in the protection subregion.The purpose of making data warehouse of big file is that the sector piece that data warehouse used no longer is operated system and uses.Data warehouse is made up of the write operation requests backup.
In operating system, a write operation requests is made up of following three aspects: operation initial sector, the sector number of operation, the sector content that will write.
In data warehouse, the backup of write operation requests is made up of following four aspects: the time of operate initial sector, the sector number of operation, the sector content that will write, sending write operation.It is big or small identical that write operation requests backs up.
Continue in the storing process at hard disc data, backup write operation step is as follows:
1) intercept a write operation requests after, might need to form the backup of several write operation requests.According to the operation initial sector of write operation requests and the sector number of operation, find this operating influence all sector pieces to the hard disk, influence several sectors piece, just form several write operation requests backups, the time of write operation requests backup is for intercepting and capturing the time of write operation.The partition write operation requests be write operation requests backup method as shown in Figure 2.
2) check the zone bit of the sector piece that write operation has influence on, if be 0, then this sector piece never was written to, need to form extra write operation requests backup, the operation initial sector is that the sector number of sector piece initial sector, operation is the sector block size, the sector content that will write is that the raw content of reading this sector piece, the time of sending write operation are the whole time that begins to intercept and capture the hard disk visit.After write operation requests backup write data warehouse, make the zone bit of this sector piece into 1, preserve the sign table then.
3) with 1) the write operation requests backup that forms in the step is written to data warehouse.
(3) obtain the data that hard disk writes simultaneously, set up write operation requests, back up to data warehouse, finish the lasting storage of hard disc data.
2, hard disc data recovers arbitrarily to realize may further comprise the steps: when the present invention recovers at hard disc data, use chained list to realize finding out the nearest write operation record of the moment of required recovery from the backup of data warehouse write operation requests.The catena of chained list is made up of the sector number of position in data warehouse of write operation requests backup, operation initial sector, operation.
(1) from data warehouse, obtains to recover all write operation requests backups that this time point needs;
(2) the sector content that will write with record in the write operation requests backup that obtains is written in the write operation initial sector of write operation requests backup appointment.
In any rejuvenation of hard disc data, the specific implementation method:
1) the restore data operand is whole subregion.
2) as shown in Figure 3, the sequential read that starts anew rounds the write operation requests backup in the data warehouse, constructs the chained list of the write operation that a recovery operation need carry out.The catena of chained list is made up of the sector number of position in data warehouse of write operation requests backup, operation initial sector, operation.
When there is not identical catena in writing of the write operation requests backup that scans in Sector Range and the chained list, in chained list, increase an item newly.If the operation initial sector in the backup of two write operation requests is the same with the sector number that will operate, then two write operation requests back up, and to write Sector Range the same, and a back like this write operation requests can cover previous write operation requests fully.Therefore when existing when backing up the identical catena of writing Sector Range with current write operation requests at chained list, delete this catena earlier, increase an item again in chained list newly, the initial sector that the write operation requests that current scanning is pointed in its data warehouse position backs up, the operation initial sector is the write operation requests backup, the sector number of operation are the sector number of the operation of write operation requests backup.
Owing to be the write operation requests backup that sequential read rounds a data warehouse, comprised the nearest write operation record of the moment that recovers to needs so can guarantee the chained list of setting up.
3) content that will write the sector of the write operation requests backup that catena mapping in the chained list is pointed to is write in the write operation initial sector of write operation requests backup appointment, and the sector number that write is the sector number of the operation of write operation requests backup appointment.
Embodiment:
The continuous time point storing process:
One. suppose that hard disk through block management, is divided into a plurality of sectors piece.The subregion of protecting is formed A, B, C by three sector pieces.
Continuous data protection begins to carry out during two .9:00.The 1st row is depicted as A, B, C among subregion state such as Fig. 4 at this moment.
During three .9:01, the middle driving intercepts a write operation.This write operation need be write some and the whole data B piece of sector piece A.
These three sector bulk states will become the 2nd capable a, B1, the C of being depicted as Fig. 4 when write operation is carried out.
At this moment, in data warehouse, will store the original state of sector piece A and newly write the data mode of a of piece A part sector, sector and the data mode of the B1 of the original state of sector piece B and the sector piece B that newly writes.The write operation requests backup of therefore, depositing in data warehouse is depicted as A, B, a, B1 as Fig. 5 the 1st row.Wherein a only is the some of A.
During four .9:02, the middle driving newly intercepts a write operation.This write operation need be write whole sector piece C.
These three sector bulk states will become the 3rd capable a, B1, the C1 of being depicted as Fig. 4 when write operation is carried out.
At this moment, will store in data warehouse, the original state of sector piece C reaches the data mode of the C1 that newly writes sector piece C.To increase the write operation requests backup to sector piece C and C1 in data warehouse, at this moment, the write request operation Status of Backups of depositing in the data warehouse such as Fig. 5 the 2nd row are depicted as A, B, a, B1, C, C1.
During five .9:03, the middle driving newly intercepts a write operation.This write operation need be write the first part of A piece.
These three sector bulk states will become the 4th capable a1, a, B1, the C1 of being depicted as Fig. 4 when write operation is carried out.
At this moment, in data warehouse, will store, newly write the data mode of the a1 of piece A part sector, sector.To increase the write operation requests backup to the a1 of piece A part sector, sector in data warehouse, at this moment, the write request operation Status of Backups of depositing in the data warehouse such as Fig. 5 the 3rd row are depicted as A, B, a, B1, C, C1, a1.
Continuous time point rejuvenation:
When the current time is 9:03
1 if return to 9:02
Scan whole data warehouse, form chained list, if the running time of the write operation that scans record is greater than the time that will recover, direct filtration.Process is:
Add the catena that points to the backup of A write operation;
Add the catena that points to the backup of B write operation;
Add the catena that points to the backup of a write operation;
The catena of B write operation backup is pointed in deletion, adds the catena that points to the backup of B1 write operation;
Add the catena that points to the backup of C write operation;
The catena of C write operation backup is pointed in deletion, adds the catena that points to the backup of C1 write operation.
Element is in the last chained list:
A?a?B1?C1。
2 if return to 9:01
Scan whole data warehouse, form chained list, if the running time of the write operation that scans record is greater than the time that will recover, direct filtration.Process is:
Add the catena that points to the backup of A write operation;
Add the catena that points to the backup of B write operation;
Add the catena that points to the backup of a write operation;
The catena of B write operation backup is pointed in deletion, adds the catena that points to the backup of B1 write operation;
Add the catena that points to the backup of C write operation.
Element is in the last chained list:
A?a?B1?C。
3 if return to 9:00
Scan whole data warehouse, form chained list, if the running time of the write operation that scans record is greater than the time that will recover, direct filtration.Process is:
Add the catena that points to the backup of A write operation;
Add the catena that points to the backup of B write operation;
Add the catena that points to the backup of C write operation.
Element is in the last chained list:
A?B?C。

Claims (5)

1. a computer hard disk data continuous time point is stored and the method for recovering, and it is characterized in that: may further comprise the steps:
(1) hard disk is carried out block management, regard fdisk as combination, set up a sector block mark table, write down the situation that each sector piece carries out write operation by consecutive identical big or small sector piece;
(2) in the process of system's operation, by the request of access of capturing operation system at hard disk, monitoring in real time is to the write operation of fdisk, when a write operation arrives, earlier write operation is split into writing of continuous several sectors piece, the sector block size is consistent with the middle definition of above-mentioned steps (1);
(3) the sector piece write operation that breaks is handled: will write the data continuous backup to data warehouse when will write data, and realize the lasting storage of hard disk point data continuous time hard disk;
1) if for the first time to the write operation of sector piece, the content backup of then reading this sector piece earlier arrives data warehouse, and sets up a write operation requests backup, and the time is the time that whole write operation supervisory system begins;
2) will write the fast content backup of data to data warehouse, and set up a write operation requests backup, the time is current system time;
(4) through after above-mentioned steps (3) processing, again data are write corresponding sector piece;
(5) when needed, from data warehouse, select arbitrary time point data to recover, realize any recovery of hard disk point data continuous time:
1) from data warehouse, obtains to recover all write operation requests backups that this time point needs;
2) content that will write the sector with record in the write operation requests backup that obtains is written in the write operation initial sector of write operation requests backup appointment.
2. the method for claim 1, it is characterized in that: described sector block mark table is made up of zone bit, each zone bit is represented a sector piece, zone bit has two states, on behalf of this sector piece, 0 also do not write data, on behalf of this sector piece, 1 write data, and during initialization, the zone bit of subregion middle fan block all is 0.
3. the method for claim 1, it is characterized in that: described data warehouse is the position that Backup Data is deposited, in the protection subregion, set up a big file as data warehouse, the sector piece that data warehouse used no longer is operated system and uses, data warehouse is made up of the write operation requests backup: in operating system, a write operation requests is made up of following three aspects: operation initial sector, the sector number of operation, the sector content that will write; In data warehouse, the backup of write operation requests is made up of following four aspects: operation initial sector, the sector number of operation, the sector content that will write, the time of sending write operation, it is big or small identical that write operation requests backs up.
4. the method for claim 1: it is characterized in that: backup write operation step is as follows:
(1) intercept a write operation requests after, according to the operation initial sector of write operation requests and the sector number of operation, find this operating influence all sector pieces to the hard disk, influence several sectors piece, just form several write operation requests backups, the time of write operation requests backup is for intercepting and capturing the time of write operation;
(2) check the zone bit of the sector piece that write operation has influence on, if be 0, then this sector piece never was written to, need to form extra write operation requests backup: the operation initial sector is that the sector number of sector piece initial sector, operation is the sector block size, the sector content that will write is that the raw content of reading this sector piece, the time of sending write operation are the whole time that begins to intercept and capture the hard disk visit, after write operation requests backup write data warehouse, make the zone bit of this sector piece into 1, preserve the sign table then;
(3) the write operation requests backup that forms in the step (1) is written to data warehouse.
5. the method for claim 1: it is characterized in that: realize that hard disc data recovers arbitrarily may further comprise the steps:
(1) the restore data operand is whole subregion;
(2) sequential read that starts anew rounds write operation requests backup in the data warehouse, up to the time that the time of write operation requests backup returns to greater than needs, constructs the chained list of the write operation that a recovery operation need carry out:
When there is not identical catena in writing of the write operation requests backup that scans in Sector Range and the chained list, in chained list, increase an item newly, if there is the identical catena of writing Sector Range, then delete this catena and add a new catena, the write operation requests backup of current scanning is pointed in its data warehouse position: the operation initial sector is the initial sector of write operation requests backup, the sector number of operation is the sector number of the operation of write operation requests backup, owing to be the write operation requests backup that sequential read rounds a data warehouse, comprised the nearest write operation record of the moment that recovers to needs so can guarantee the chained list of setting up;
(3) content that will write the sector of the write operation requests backup that catena mapping in the chained list is pointed to is write in the write operation initial sector of write operation requests backup appointment, and the sector number that write is the sector number of the operation of write operation requests backup appointment.
CNB2007100189920A 2007-11-02 2007-11-02 Computer hard disk data continuous time point storage and recovery method Expired - Fee Related CN100524237C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2007100189920A CN100524237C (en) 2007-11-02 2007-11-02 Computer hard disk data continuous time point storage and recovery method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2007100189920A CN100524237C (en) 2007-11-02 2007-11-02 Computer hard disk data continuous time point storage and recovery method

Publications (2)

Publication Number Publication Date
CN101149693A true CN101149693A (en) 2008-03-26
CN100524237C CN100524237C (en) 2009-08-05

Family

ID=39250238

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2007100189920A Expired - Fee Related CN100524237C (en) 2007-11-02 2007-11-02 Computer hard disk data continuous time point storage and recovery method

Country Status (1)

Country Link
CN (1) CN100524237C (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101685412B (en) * 2008-09-22 2011-06-22 联想(北京)有限公司 Hard disk data backup and restore method, system and computer
CN102279806A (en) * 2011-05-18 2011-12-14 深圳创维-Rgb电子有限公司 Digital television equipment and storage method for single program initiation (SPI) memory
CN102594849A (en) * 2011-01-06 2012-07-18 阿里巴巴集团控股有限公司 Data backup and recovery method and device, virtual machine snapshot deleting and rollback method and device
CN102799542A (en) * 2012-07-12 2012-11-28 福建升腾资讯有限公司 Disk protection system of tree-form multilayer cover layer of sector increment and implementing method thereof
CN103389928A (en) * 2013-08-14 2013-11-13 陈谦 Computer data backup and recovery method
CN101937378B (en) * 2009-07-01 2014-04-02 联想(北京)有限公司 Method for carrying out back-up protection on data of storage equipment and computer system
CN104407942A (en) * 2014-11-28 2015-03-11 上海爱数软件有限公司 Off-site storage based Linux operation system backup recovery method
CN104899114A (en) * 2014-03-07 2015-09-09 中国科学院苏州纳米技术与纳米仿生研究所 Continuous time data protection method on solid state drive
CN105827681A (en) * 2015-01-06 2016-08-03 南京壹进制信息技术有限公司 Backup data transmission method under SAN (Storage Area Network)
CN105955845A (en) * 2016-04-26 2016-09-21 浪潮电子信息产业股份有限公司 Data recovery method and device
CN109117423A (en) * 2017-06-23 2019-01-01 阿里巴巴集团控股有限公司 The table partitioned allocation method of Database Systems, device and system
CN110692058A (en) * 2017-07-05 2020-01-14 金德祐 Auxiliary storage device providing independent backup and recovery functions and apparatus using the same

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1329829C (en) * 2004-11-29 2007-08-01 中兴通讯股份有限公司 Back-up restoring method for user database

Cited By (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101685412B (en) * 2008-09-22 2011-06-22 联想(北京)有限公司 Hard disk data backup and restore method, system and computer
CN101937378B (en) * 2009-07-01 2014-04-02 联想(北京)有限公司 Method for carrying out back-up protection on data of storage equipment and computer system
CN102594849B (en) * 2011-01-06 2015-05-20 阿里巴巴集团控股有限公司 Data backup and recovery method and device, virtual machine snapshot deleting and rollback method and device
CN102594849A (en) * 2011-01-06 2012-07-18 阿里巴巴集团控股有限公司 Data backup and recovery method and device, virtual machine snapshot deleting and rollback method and device
CN102279806A (en) * 2011-05-18 2011-12-14 深圳创维-Rgb电子有限公司 Digital television equipment and storage method for single program initiation (SPI) memory
CN102799542A (en) * 2012-07-12 2012-11-28 福建升腾资讯有限公司 Disk protection system of tree-form multilayer cover layer of sector increment and implementing method thereof
CN102799542B (en) * 2012-07-12 2014-12-10 福建升腾资讯有限公司 Disk protection system of tree-form multilayer cover layer of sector increment and implementing method thereof
CN103389928A (en) * 2013-08-14 2013-11-13 陈谦 Computer data backup and recovery method
CN103389928B (en) * 2013-08-14 2016-02-10 陈谦 A kind of method of computer data backup and recovery
CN104899114A (en) * 2014-03-07 2015-09-09 中国科学院苏州纳米技术与纳米仿生研究所 Continuous time data protection method on solid state drive
CN104899114B (en) * 2014-03-07 2018-03-20 中国科学院苏州纳米技术与纳米仿生研究所 A kind of continuous time data guard method on solid state hard disc
CN104407942A (en) * 2014-11-28 2015-03-11 上海爱数软件有限公司 Off-site storage based Linux operation system backup recovery method
CN105827681A (en) * 2015-01-06 2016-08-03 南京壹进制信息技术有限公司 Backup data transmission method under SAN (Storage Area Network)
CN105827681B (en) * 2015-01-06 2019-04-16 南京壹进制信息科技有限公司 Backup Data transmission method under a kind of SAN network
CN105955845A (en) * 2016-04-26 2016-09-21 浪潮电子信息产业股份有限公司 Data recovery method and device
CN109117423A (en) * 2017-06-23 2019-01-01 阿里巴巴集团控股有限公司 The table partitioned allocation method of Database Systems, device and system
CN109117423B (en) * 2017-06-23 2022-05-03 阿里巴巴集团控股有限公司 Table partition configuration method, device and system of database system
CN110692058A (en) * 2017-07-05 2020-01-14 金德祐 Auxiliary storage device providing independent backup and recovery functions and apparatus using the same
CN110692058B (en) * 2017-07-05 2024-06-04 金德祐 Auxiliary storage device for providing independent backup and recovery functions and equipment suitable for auxiliary storage device

Also Published As

Publication number Publication date
CN100524237C (en) 2009-08-05

Similar Documents

Publication Publication Date Title
CN100524237C (en) Computer hard disk data continuous time point storage and recovery method
US6857057B2 (en) Virtual storage systems and virtual storage system operational methods
US8566282B2 (en) Creating a buffer point-in-time copy relationship for a point-in-time copy function executed to create a point-in-time copy relationship
JP4512638B2 (en) Computer hard disk system data protection apparatus and method using system area information table and mapping table
US20060174075A1 (en) Method for creating and preserving snapshots in a storage system
US20120151125A1 (en) Data processing method for nonvolatile memory system
US20050262316A1 (en) Backup acquisition method and disk array apparatus
CN103761053A (en) Data and method for data processing
CN104778018A (en) Broad-strip disk array based on asymmetric hybrid type disk image and storage method of broad-strip disk array
CN101334708A (en) Storage device with write barrier sensitive write commands and write barrier insensitive commands
CN107273046B (en) A kind of data processing method and system based on Solid-state disc array
JP4222917B2 (en) Virtual storage system and operation method thereof
CN106227621A (en) The data back up method of logic-based volume management simplification volume and system
CN107544869A (en) A kind of data reconstruction method and device
CN104166601A (en) Storage data backup method and device
CN107239233A (en) A kind of disk array and data reconstruction method and storage device based on it
CN106095330A (en) A kind of storage method and apparatus of metadata
CN105354109B (en) The backup method and device of video monitoring index data
US11093339B2 (en) Storage utilizing a distributed cache chain and a checkpoint drive in response to a data drive corruption
US7398420B2 (en) Method for keeping snapshot image in a storage system
CN102981979A (en) Method for improving speed of storage system data access
US8655841B1 (en) Selection of one of several available incremental modification detection techniques for use in incremental backups
US8990528B2 (en) Method for fast format of a fully allocated volume when copied from a space efficient volume
CN104424115B (en) Recover method, storage device and the electronic equipment of the preset state of electronic equipment
CN102508743A (en) Multi-point backup and real-time protection method for Linux file system

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
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Computer hard disk data continuous time point storage and recovery method

Effective date of registration: 20110415

Granted publication date: 20090805

Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch

Pledgor: Li Zengsheng|Xi'an saming Technology Co Ltd

Registration number: 2011990000065

PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20120814

Granted publication date: 20090805

Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch

Pledgor: Li Zengsheng|Xi'an saming Technology Co Ltd

Registration number: 2011990000065

PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Computer hard disk data continuous time point storage and recovery method

Effective date of registration: 20120914

Granted publication date: 20090805

Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch

Pledgor: Xi'an saming Technology Co Ltd| Li Zengsheng

Registration number: 2012990000528

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20090805

Termination date: 20121102

PC01 Cancellation of the registration of the contract for pledge of patent right

Date of cancellation: 20150528

Granted publication date: 20090805

Pledgee: Pudong Development Bank of Shanghai, Limited by Share Ltd, Xi'an branch

Pledgor: Xi'an saming Technology Co Ltd| Li Zengsheng

Registration number: 2012990000528

PLDC Enforcement, change and cancellation of contracts on pledge of patent right or utility model