CN1740981A - A computer hardware data multi-timepoint fast storing and recovery method - Google Patents
A computer hardware data multi-timepoint fast storing and recovery method Download PDFInfo
- Publication number
- CN1740981A CN1740981A CN 200510043097 CN200510043097A CN1740981A CN 1740981 A CN1740981 A CN 1740981A CN 200510043097 CN200510043097 CN 200510043097 CN 200510043097 A CN200510043097 A CN 200510043097A CN 1740981 A CN1740981 A CN 1740981A
- Authority
- CN
- China
- Prior art keywords
- piece
- hard disk
- block
- concordance list
- address
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000011084 recovery Methods 0.000 title description 23
- 238000013507 mapping Methods 0.000 claims abstract description 21
- 238000004321 preservation Methods 0.000 claims description 9
- 230000003760 hair shine Effects 0.000 claims description 5
- 238000012546 transfer Methods 0.000 claims description 4
- 241001269238 Data Species 0.000 claims description 2
- 238000012217 deletion Methods 0.000 claims 1
- 230000037430 deletion Effects 0.000 claims 1
- 238000012986 modification Methods 0.000 claims 1
- 230000004048 modification Effects 0.000 claims 1
- 230000007704 transition Effects 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 3
- 230000002950 deficient Effects 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- PCTMTFRHKVHKIS-BMFZQQSSSA-N (1s,3r,4e,6e,8e,10e,12e,14e,16e,18s,19r,20r,21s,25r,27r,30r,31r,33s,35r,37s,38r)-3-[(2r,3s,4s,5s,6r)-4-amino-3,5-dihydroxy-6-methyloxan-2-yl]oxy-19,25,27,30,31,33,35,37-octahydroxy-18,20,21-trimethyl-23-oxo-22,39-dioxabicyclo[33.3.1]nonatriaconta-4,6,8,10 Chemical compound C1C=C2C[C@@H](OS(O)(=O)=O)CC[C@]2(C)[C@@H]2[C@@H]1[C@@H]1CC[C@H]([C@H](C)CCCC(C)C)[C@@]1(C)CC2.O[C@H]1[C@@H](N)[C@H](O)[C@@H](C)O[C@H]1O[C@H]1/C=C/C=C/C=C/C=C/C=C/C=C/C=C/[C@H](C)[C@@H](O)[C@@H](C)[C@H](C)OC(=O)C[C@H](O)C[C@H](O)CC[C@@H](O)[C@H](O)C[C@H](O)C[C@](O)(C[C@H](O)[C@H]2C(O)=O)O[C@H]2C1 PCTMTFRHKVHKIS-BMFZQQSSSA-N 0.000 description 1
- 241000700605 Viruses Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 239000000829 suppository Substances 0.000 description 1
Images
Abstract
The invented method includes the following steps: in the course of using hard disk capturing read/write request of operation system, distributing different true hard disk addresses for every time point hard disk request and recording mapping relationship between hard disk request address and true-distributed hard disk address to make hard disk requests of different time points do not mutually interfere so as to attain the changed data real-time incrementally stored in hard disk.
Description
Affiliated technical field
The present invention relates to field of computer information security, especially be stored in the safety of the data message self of hard disk, the method for in the computing machine use a plurality of optional time points of hard disc data being carried out quick storage and recovery is provided.
Background technology
In most computer PC, notebook system, hard disk is basic data storage device, guarantees that the safety of hard disc data is significant to whole computer information safe.In the computing machine use, loss of data or ruined phenomenon all can take place, and cause the loss that can't retrieve in the implicit defective of infected by computer virus, types of applications program and user's operation error unavoidably.
The method for security protection of present various hard disc datas, adopt measure mostly based on data backup, allow the user select hard disk related data content as backup target, and mark off at the segment space that hard disk is not used can protected zone, duplicates the desired data content then and backups in the protected field that marks off; When the needs restore data, from shielded zone, take out backed up data coverage goal hard disk again.This method has two defectives: one, data are duplicated portion fully can take a large amount of hard disk free spaces in hard disks, as the backup different time points data then occupation proportion be multiplied; Its two, the backup of the data of one or more hard disks and recovery will consume the plenty of time and often need user's interruption of work and enter special operating environment, operation inconvenience.
The user often wishes to preserve the data content of hard disk different times in the computing machine use.For example can't confirm under the situation of current point in time hard-disk content correctness that hope can not destroy the data content of institute's holding time point before this when preserving the current point in time hard-disk content the user; Or the user is installing certain to the software that closes system's safety, wishing can be with the system data rapid saving of hard disk this moment, if software installs that some failure problems is found in the back can't handle or unload the time, thereby the hard-disk content that can recover before this apace to be preserved makes system recovery; The user who also has will install different operating system or software because of different application targets in an operating system, but do not wish thereby each software is installed together the operational efficiency that causes reducing operating system, so often wish to preserve the hard-disk content that different operating system or software are installed, select the hard disc data of the hard-disk content of different time points then when needed as current slot in different time points.
The data of hard disk very big, the simple copy backup that often takes up room takies hard drive space very much, if preserve the data content of a plurality of time points again with copy backup, the hard disk expense is almost intolerable.Prior, be in these operations of duplicating and backing up, taken a large amount of quality time, thereby much counted the suppository user and often just abandoned that hard disc data is preserved and backup, thereby hidden some dangers for for hard disc data safety.
At present the market popular all kinds of reduction card products; tentatively solved rapid saving in the function of recovering hard disc data; improved the efficient of protection hard disc data, but its deficiency is the hard disc data that only limits to preserve a time point, can't satisfy user's complicated demand far away.
Summary of the invention
In order to solve rapid saving that has hard disc data now and the hard disc data that restoration methods can only be preserved single time point, to take a series of problems such as hard drive space is big, complex operation is very long, the invention provides the method for a kind of computer hardware data multi-timepoint quick storage and recovery.This storage and restoration methods can allow the user at work rapid saving, the reduction a plurality of different time points hard disc data.
Technical scheme of the present invention is: by the read-write requests of capturing operation system at hard disk, the different true hard disk address of address assignment for each time point request read-write, and the mapping relations between the hard disk address of recording disk request address and real allocated, make the request of different time points hard disc data state not disturb mutually, like this can be in real time, the data of increment ground storage hard disk change, and make Data Dynamic deposit in the remaining space of same hard disk.Can repeatedly preserve the data mode of current point in time when needed, recover certain during the data mode of holding time point, only need in the mapping relations table read-write requests of operating system is redirected to this time point.
The present invention has two key components: the 1) read-write requests of capturing operation system.2) the different true hard disk address of address assignment that will read and write for each time point hard disk request, and the mapping relations between the hard disk address of recording disk request address and real allocated.
1, the read-write requests of capturing operation system is to drive by install one in current operation system in the middle of, the middle driving between operating system hard disk read and write access and disk unit port driver, call by middle driven management all, can distribute true hard disk address unitedly to all disk read-write requests of each time point like this disk unit port driver.
2, the different true hard disk address of address assignment that will read and write for each time point hard disk request, and the mapping relations between the hard disk address of recording disk request address and real allocated, realize by two data structures: the piece concordance list of each time point, block count table.The piece concordance list of each time point is used for the mapping relations between the hard disk address of the distribution situation of each time point hard disc data of detail record and hard disk request address and real allocated.Such as, when the present invention program intercepts and captures a read request to hard disk, scheme will be mapped to it to this read request in the real address of hard disk according to the mapping relations of hard disk address in this time point piece concordance list, and the real address of the hard disk of mapping may be different with the address that this request will be read.Informational needs in the piece concordance list of each time point is communicated with each other, such as allowing the other times point know the hard disk address that certain time point has taken, other times point just can be avoided the hard disk areas that use has taken, the block count table designs for this purpose, and it writes down the number of times that each address is taken by different time points.
The present invention is with hard disk address block management, and a piece comprises one or more sectors, and the number of sector generally is 2 power, the unique corresponding block address of each sevtor address, and block management can improve execution efficient of the present invention like this.
Introduce the detailed design of piece concordance list below:
The piece concordance list of each time point is the operating position of each time point of record to block address, and each time point has a unique piece concordance list, and wherein, the piece concordance list of current point in time is called the current block concordance list.It is following target array with block address that the piece concordance list of a time point is actually one, and each element comprises two parts: block address state, block address moving cursor.
The block address state recording of piece concordance list the user mode of this block address when this time point, it is actually a round values, the user mode that the representative of different value is different, user mode can be: idle, use, protect, shift, to be transferred, bad address; Its concrete implication is:
(1) is designated idle block address and is meant that this piece is not by the data occupancy of putting any time;
(2) be designated the block address of having used and be meant that this piece is by the data occupancy of current point in time;
(3) be designated the time point data occupancy that the block address of having protected is meant that this piece had been stored;
(4) block address that is designated bad address is meant that there is fault in the zone of this piece correspondence and can't uses;
(5) having shifted is the situation that is occurred when being designated the block address write data of having protected: when current point in time need be write a piece A who has protected, need in subregion, pick up the piece B of a free time, later on current slot all translates into read and write access to piece B to all disk read-writes of originally having protected piece A, after the mapping, originally the address state of piece A just shifts by protecting to become, promptly current point in time all new address B is all transferred in the visit of original address;
(6) to be transferred is to be designated the hard disk address of having shifted to one to preserve the situation that the back occurs: when preserving a time point, if piece A has been designated and has shifted and its mapping is piece B in the current point in time, after preservation, for the content that guarantees piece B not by the hard disk access violation of time point afterwards, the address state of piece A just by shift become to be transferred.
The block address moving cursor of piece concordance list is used for the request of access that the request of access of this piece is converted to another piece, when the user mode of a piece be shift, when to be transferred, just need be the new block address of the block address moving cursor indication of the request of access of this piece being transferred to this piece.
Be the detailed design of block count table below:
The block count table is the number of times that each block address of record is taken by different time points.The shared same block count table of all time points, the block count table record number of times that taken by different time points of each block address, it also is one and is target array down with block address that each element is the integer of a record number of times.
Technical scheme of the present invention is divided into three parts in operation, be respectively hard disc data quick storage, hard disc data rapid saving, the fast quick-recovery of hard disc data.
1, the hard disc data quick storage may further comprise the steps:
(1) sets up the piece concordance list for current point in time;
(2) intercept and capture all hard disk request of access of current operation system;
(3) according to the user mode of block address in the piece concordance list, the map addresses of intercepting and capturing in the hard disk visit is arrived the suitable true block address of hard disk, again will be according to block address state, the block address moving cursor of each block address that takies in the mapping change concordance list.
2, the hard disc data rapid saving may further comprise the steps:
(1) revise block address state in the current block concordance list, the piece that will preserve is arranged to guard mode;
(2) the current block concordance list is saved in the hard disk appropriate location;
(3) according to the holding time is put block address state renewal block count table in the piece concordance list;
(4) set up new piece concordance list for next time point.
3, the fast quick-recovery of hard disc data may further comprise the steps:
(1) finds out the piece concordance list that to put release time from the hard disk appropriate location;
(2) the piece concordance list with this time point covers the current block concordance list;
(3) upgrade block address state in the current block concordance list according to the situation of quoting of piece in the block count this moment table.
In the hard disc data quick storage method of the present invention, the map addresses of intercepting and capturing in the hard disk visit is arrived the suitable true block address of hard disk, will be according to the block address state of each block address that takies in the mapping change concordance list, the method for block address moving cursor again:
(1) visits for the hard disk of write operation, if the user mode of the piece of write operation indication in the piece concordance list is idle, then directly the true block address of write operation and its indication is shone upon mutually, and in the piece concordance list, the user mode of visit indication piece is modified to by the free time and uses; If the user mode of the piece of write operation indication in the piece concordance list for using, then directly shone upon the true block address of write operation and its indication mutually; If the user mode of piece in the piece concordance list of write operation visit indication is for protecting or bad address, then search for the new piece of a free time, the new piece that write operation and this are searched shines upon mutually, in the piece concordance list, the user mode of new piece is modified to by the free time then and protects, also the address moving cursor of original piece will be pointed to new piece; If the user mode of the piece of write operation indication in the piece concordance list is for shifting, then earlier find object block after the transfer by the block address moving cursor, then hard disk write operation is shone upon mutually with this object block; If the user mode of the piece of write operation indication in the piece concordance list is to be transferred, then at first search for the new piece of a free time, the new piece that write operation and this are searched shines upon mutually, in the piece concordance list, the user mode of new piece is modified to by the free time then and protects, address moving cursor with original piece points to new piece again again, the user mode of original piece is shifted by to be transferred being modified to again;
(2) for the visit of the hard disk of read operation, if the user mode of the piece of read operation indication in the piece concordance list then directly shone upon the true block address of read operation and its indication mutually for idle or used; If the user mode of the piece of read operation indication in the piece concordance list for protect, shift, to be transferred or bad address, then earlier find object block after the transfer by the block address moving cursor, the object block that read operation and this are searched is shone upon mutually again.
In the hard disc data rapid saving method of the present invention; revise block address state in the current block concordance list; the method that the piece that will preserve is arranged to guard mode is: for address state is the piece that uses, shifted, its block address state is modified to respectively protect, to be transferred.The method of upgrading the block count table according to block address state in the some piece concordance list of holding time is: for block address state in the holding time point piece concordance list be protect, piece to be transferred, in the block count table, it is quoted number of times and adds 1.
In the hard disc data quick recovery method of the present invention; the method of upgrading block address state in the current block concordance list according to the situation of quoting of piece in the block count table is: if certain piece block address state in the current block concordance list is that the number of times of quoting idle and in the block count table is not 0, then this piece block address state in the current block concordance list is changed to and protect.
The invention has the beneficial effects as follows, can preserve the data mode of a plurality of time points in the hard disk use apace, the data of each time point are independent of each other mutually, and the user can conveniently delete each time point of having preserved, have expanded the range of choice that hard disc data is preserved greatly; Preserve the hard disc data of a time point and only need preserve the current block concordance list and upgrade the block count table, the disk read-write amount of whole preservation process is very little, can finish rapidly; Preserve hard disc data and additionally do not take a large amount of hard drive spaces, greatly save hard drive space; The user does not need to enter special operating environment when preserving data, just can work in the back that hangs on, and is very easy to user's operation.
Description of drawings
Fig. 1 is the embodiment of mutual relationship between a plurality of time points of the present invention.
Fig. 2 is the storage effect embodiment of three time points of the present invention.
Fig. 3 is the embodiment of a time point piece concordance list.
Fig. 4 is the use attribute alternate embodiment of a hard disk address.
Fig. 5 is the middle layer of structure figure that realizes on three kinds of operating system platforms that drives of the present invention.
Fig. 6 is the process flow diagram that the present invention preserves operation and restoring operation.
Fig. 7 is the quick recovery routine embodiment of the present invention.
Embodiment
In the context of specific embodiment, describe the present invention below, but be not intended to limit like this present invention.
Fig. 1 is mutual relationship embodiment between a plurality of time points of storing of the present invention, has shown mutual relationship between a kind of possible a plurality of time points of certain hard disk.
One has 14 time points among Fig. 1, and wherein the sequencing of each time point preservation is exactly the size order of numeral.Time point 1 is the time point of first preservation of user, and the user has preserved 5 time points again continuously in the middle of follow-up use.In these 6 time points, time point 1 is a last time point of time point 2, and time point 2 is last time points of time point 3, is last time points of time point 6 up to time point 5.After having preserved time point 6, the user has returned to the data of hard disk the state of time point 2, from the time point 2 that recovers, the user has begun new use again, the user has done 4 preservations again in new use, here time point 2 is last time points of time point 7, and time point 9 is last time points of time point 10.On the time point mutual relationship, we can say that the user has drawn the use branch of a hard disk again from time point 2, time point 7,8,9,10 is exactly the time point in this branch.In like manner, the user has drawn time point 11 from time point 8 again after putting 8 release time; After putting 3 release time, drawn time point 12; Drawn time point 13,14 after putting 2 release time again.
As can be seen from Figure 1, user's preservation can be that the hard disc data of any current point in time is noted, and recovery can be with the hard disc data recovery of point any time.
Fig. 2 has demonstrated a hard disk after having preserved three time points, the design sketch of each time point and the true hard disk of hard disk.The top hard disk that to be the user see when three time points separately by operating system among Fig. 2, this user is through the virtual hard disk after the mapping at the hard disk that these three time points are seen, the address of virtual hard disk is continuous, the user imperceptible it with any difference of true hard disk, operating system can not have been found any difference when hardening the dish read-write requests.The center section of Fig. 2 drives in the middle of being.The middle driving intercepted and captured all hard disk visits of current slot operating system, just any visit to virtual hard disk.The hard disk address mapping relation that drives according to each time point then shines upon virtual address mutually with hard disk actual physical address, converts the visit to hard disk actual physical address at last to.The hard disk address mapping relation of each time point is by the decision of the piece concordance list of each time point.The below of Fig. 2 is true hard disk and block count table.First row of block count table is the hard disk block address, and second row is the number of times of quoting of piece.
In the embodiment of Fig. 2, the user has stored data ABCD, ACDG, ABHC respectively in the virtual hard disk of time point 1,2,3,4. 3. 2. 1. the virtual address of three time points be mapped to piece ' 1 ' ' 2 ' ' 3 ' ' 4 ', ' 1 ' ' 3 ' ' 4 ' ' 10 ', ' 1 ' ' 2 ' ' 8 ' ' 9 ' respectively.In the block count table, can see the number of times of quoting of each piece.Be noted that wherein time point 3 virtual hard disk address contents 4. are C, it is 9 in the real MBA memory block address of hard disk.
Preserve the hard disc data of a time point as seen from Figure 2 and only the piece concordance list of current point in time need be preserved, and upgrade the block count table, each time point data is preserved and need not additionally be preserved, and greatly saves hard drive space.
Fig. 3 is the embodiment of the piece concordance list of time point 3 among Fig. 2 embodiment.Can be clear that among Fig. 3 that time point 3 has not only write down the address state with own relevant piece (1,2,3,4,8,9), but also write down the address state of the piece (10) that is taken by the other times point.
At Fig. 4 is a hard disk address use attribute alternate embodiment, and this embodiment has demonstrated the various states that the true block address of hard disk occurs.Among Fig. 4 embodiment, the address state of piece 1 in the piece concordance list of time point 1 is idle at the beginning, and operating system was write A to piece 1 afterwards, uses so piece 1 becomes at the address state of time point 1.When the holding time put 1, piece 1 becomes again at the address state of time point 1 to be protected, and simultaneously the quote number of times of piece 1 in the block count table is added 1.Entry time point 2 behind the piece concordance list of holding time point 1 is put 2 piece concordance list Time Created.At time point 2; operating system needs to write B again to piece 1; at this moment need in the piece concordance list of time point 2, find a free block; such as piece 2; B is write piece 2; simultaneously piece 2 is become at the address state of time point 2 and protect, in the concordance list of time point 2, the address moving cursor of piece 1 is pointed to piece 2 then, again the address state of piece 1 is changed and shift.Piece 2 become at the address state of time point 2 to protect be because operating system might also will be used piece 2 in time point 2, so protect for drive block 2 in the middle of telling can not write direct the address state of piece 2 will be become.If operating system also will be write C afterwards to piece 1 in time point 2,, C is directly write piece 2 according to the address state and the address moving cursor of piece 1.Put 2 o'clock in the holding time, piece 1 is become to be transferred at the address state of time point 2,, need again piece 1 is mapped to a new idle address if expression wants to write piece 1 at time point afterwards.Operating system needs to write D again to piece 1 in the time point 3 of back; at this moment in the piece concordance list of time point 3, find a free block again; such as piece 3; D is write piece 3; simultaneously piece 3 is become at the address state of time point 3 and protect; then piece 1 is pointed to piece 3 at the piece moving cursor of time point 3, again the address state of piece 1 at time point 3 made into to shift.
The use attribute that Fig. 4 shows changes and shows, the present invention can be easily, the use attribute of change of address more apace.
Fig. 5 is the middle layer of structure figure that realizes on three kinds of platforms that drives of the present invention, and three kinds of platforms are respectively Windows, Linux and Dos.Drive between file system driving and device drives in the middle of on the windows platform, middle driving will be intercepted and captured all to calling that hard disc apparatus drives.Be positioned in middle driving on the Linux platform among the block device driving of Linux, in fact added a filtering layer in block device drives, all will be intercepted and captured by this filtering layer calling all of hard drive.On the Dos platform, by replacing the Int13H inlet under the original dos, in the middle of adding between new Int13H inlet and original Int13H inlet, drive, the middle driving intercepted and captured the calling of Int13H, and calls original Int13H after remapping again.
Fig. 6 is the process flow diagram that the present invention preserves operation and restoring operation, and the left side is to preserve operational flowchart, and the right is the process flow diagram of recovery operation.
When the user feels to need to preserve certain time point in the middle of work, the user asks to preserve, drive then and can end all hard disk visits, then the current block concordance list is saved in the hard disk appropriate location and upgrades the block count table according to block address state in the time point piece concordance list of having preserved, be that following time point is created new piece concordance list again, drive in the middle of last and open disk access, the user can work on.
The preservation process flow diagram that shows from Fig. 5 as can be seen, whole preservation operation user only need hang on and not need to restart computing machine.
When the user recovers certain time point at needs, the user asks recovery operation, control program can be write a recovery request sign in certain position of hard disk then, then restart computing machine, before computer guiding operating system, can enter quick recovery routine, point release time that user's selection is wanted, find out the piece concordance list that to put release time from the hard disk appropriate location, piece concordance list with this time point covers the current block concordance list, the situation of quoting according to piece in the block count this moment table is upgraded block address state in the current block concordance list, reboots new operating system after recovering to finish.
Fig. 7 is the quick recovery routine embodiment of the present invention, has showed how according to user's request call recovery routine.Provided before the pilot operationp system program that computing machine will be carried out in each stage among Fig. 7: the program among bios initialization-MBR-recovery polling routine-bootSector program-bootblock program-OS loader program.Wherein bootSector program, bootblock program and OS loader program all are the boot of system disk.Present embodiment recovers polling routine and checks whether control program writes the over recovery request flag on hard disk by added one between MBR and bootSector as can be seen, if having then represent that the user wants recovery operation, so just call quick recovery routine.Recovering to finish the back in the operating system that is turning back to the new recovery of bootSector program designation.Method that add to recover polling routine is exactly to revise the MBR program to change the program of follow-up operation into the recovery polling routine by bootSector, starts bootSector by recovering polling routine again.
Claims (16)
1. computer hardware data multi-timepoint quick storage and restoration methods, it is characterized in that, read-write requests by the capturing operation system, the data of increment ground storage hard disk change in real time,, Data Dynamic is deposited in the remaining space of same hard disk, and preserve the data of current point in time when needed, during certain time point, only need the read-write requests of operating system is redirected to the data of this time point before recovering.
2. method according to claim 1 is characterized in that, the read-write requests of capturing operation system is to drive by install one in current operation system in the middle of; The middle driving between operating system hard disk read and write access and disk unit port driver called by middle driven management all to the disk unit port driver.
3. method according to claim 1, it is characterized in that, in real time, the data of increment ground storage hard disk change are the hard disk address areas that is mapped to each time point oneself by the hard disk request with each time point, and write down the hard disk address mapping relation of each time point, make the hard disk request of different time points not disturb mutually.
4. method according to claim 3 is characterized in that the hard disk address is a block management, and a piece comprises one or more sectors, the unique corresponding block address of each sevtor address.
5. method according to claim 3, it is characterized in that, the hard disk request of each time point is mapped to the hard disk address area of each time point oneself, and the hard disk address mapping relation that writes down each time point is realized by two data structures: the piece concordance list of each time point, block count table; The piece concordance list of each time point is the operating position of each time point of record to block address, and wherein, the piece concordance list of current point in time is called the current block concordance list; The block count table is the number of times that each block address of record is taken by different time points.
6. method according to claim 5 is characterized in that, it is following target array with block address that the piece concordance list of a time point is one, and each element comprises two parts: block address state, block address moving cursor; The block address state recording user mode of this block address when this time point, user mode can be: idle, use, protect, shift, to be transferred, bad address; The block address moving cursor is used for the request of access that the request of access of this piece is converted to another piece, when the user mode of a piece be shift, when to be transferred, just need be the new block address of the block address moving cursor indication of the request of access of this piece being transferred to this piece.
7. method according to claim 1 is characterized in that, the data real-time, that increment ground storage hard disk changes, and the remaining space of Data Dynamic being deposited in same hard disk may further comprise the steps:
(1) sets up the piece concordance list for current point in time;
(2) intercept and capture all hard disk request of access of current operation system;
(3) according to the user mode of block address in the piece concordance list, the map addresses of intercepting and capturing in the hard disk visit is arrived the suitable true block address of hard disk, again will be according to block address state, the block address moving cursor of each block address that takies in the mapping change concordance list.
8. method according to claim 1 is characterized in that, the data of preserving current point in time when needed may further comprise the steps:
(1) revise block address state in the current block concordance list, the piece that will preserve is arranged to guard mode;
(2) the current block concordance list is saved in the hard disk appropriate location;
(3) according to the holding time is put block address state renewal block count table in the piece concordance list;
(4) set up new piece concordance list for next time point.
9. method according to claim 1 is characterized in that, certain time point may further comprise the steps before recovering:
(1) finds out the piece concordance list that to put release time from the hard disk appropriate location;
(2) the piece concordance list with this time point covers the current block concordance list;
(3) upgrade block address state in the current block concordance list according to the situation of quoting of piece in the block count this moment table.
10. method according to claim 1, it is characterized in that, a plurality of time points can have a common last time point, different time point hard disc datas can be on the hard disc data basis of recovering the time point before same, the increase of visiting by operating system hard disk, deletion, modification and newly-generated a plurality of different hard disc data.
11. method according to claim 1 is characterized in that, certain time point is meant and returns to former time point once before recovering, without any need for the transition of interlude point.
12. block address state according to claim 6 is characterized in that, block address state implication is:
(4) be designated idle block address and be meant that this piece is not by the data occupancy of putting any time;
(5) be designated the block address of having used and be meant that this piece is by the data occupancy of current point in time;
(6) be designated the time point data occupancy that the block address of having protected is meant that this piece had been stored;
(7) block address that is designated bad address is meant that there is fault in the zone of this piece correspondence and can't uses;
(8) having shifted is the situation that is occurred when being designated the block address write data of having protected: when current point in time need be write a piece A who has protected, need in subregion, pick up the piece B of a free time, later on current slot all translates into read and write access to piece B to all disk read-writes of originally having protected piece A, after the mapping, originally the address state of piece A just shifts by protecting to become, promptly current point in time all new address B is all transferred in the visit of original address;
(9) to be transferred is to be designated the hard disk address of having shifted to one to preserve the situation that the back occurs: when preserving a time point, if piece A has been designated and has shifted and its mapping is piece B in the current point in time, after preservation, for the content that guarantees piece B not by the hard disk access violation of time point afterwards, the address state of piece A just by shift become to be transferred.
13. method according to claim 7, it is characterized in that, the map addresses of intercepting and capturing in the hard disk visit is arrived the suitable true block address of hard disk, will be according to the block address state of each block address that takies in the mapping change concordance list, the method for block address moving cursor again:
(1), when the user mode of the piece of indication in the piece concordance list be idle, directly write operation is shone upon mutually with the true block address of its indication, and the user mode that handle is visited the indication piece in the piece concordance list is modified to by the free time and uses for the visit of the hard disk of write operation; The user mode of the piece of indication in the piece concordance list directly shone upon the true block address of write operation and its indication when using mutually; The user mode of the piece of indication in the piece concordance list is for protecting or during bad address, the new piece of a free time of search, the new piece that write operation and this are searched shines upon mutually, in the piece concordance list, the user mode of new piece is modified to by the free time then and protects, and the address moving cursor of original piece is pointed to new piece; The user mode of the piece of indication in the piece concordance list finds object block after the transfer by the block address moving cursor earlier when shifting, then hard disk write operation shone upon mutually with this object block; When the user mode of the piece of indication in the piece concordance list is to be transferred, at first search for the new piece of a free time, the new piece that write operation and this are searched shines upon mutually, in the piece concordance list, the user mode of new piece is modified to by the free time then and protects, address moving cursor with original piece points to new piece again again, at last the user mode of original piece is shifted by to be transferred being modified to;
(2) for the visit of the hard disk of read operation, the user mode of the piece of indication in the piece concordance list directly shone upon read operation with the true block address of its indication mutually for idle or when having used; The user mode of the piece of indication in the piece concordance list is for protecting, shift, during to be transferred or bad address, finding object block after the transfer by the block address moving cursor earlier, and the object block that read operation and this are searched is shone upon mutually again.
14. method according to claim 8; it is characterized in that; revise block address state in the current block concordance list, the method that the piece that will preserve is arranged to guard mode is: for address state is the piece that uses, shifted, its block address state is modified to respectively protect, to be transferred.
15. method according to claim 8; it is characterized in that; the method of upgrading the block count table according to block address state in the some piece concordance list of holding time is: for block address state in the holding time point piece concordance list be protect, piece to be transferred, in the block count table, it is quoted number of times and adds 1.
16. method according to claim 9; it is characterized in that; the method of upgrading block address state in the current block concordance list according to the situation of quoting of piece in the block count table is: if certain piece block address state in the current block concordance list is that the number of times of quoting idle and in the block count table is not 0, then this piece block address state in the current block concordance list is modified to and protects.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100430975A CN100369000C (en) | 2005-08-12 | 2005-08-12 | A computer hardware data multi-timepoint fast storing and recovery method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005100430975A CN100369000C (en) | 2005-08-12 | 2005-08-12 | A computer hardware data multi-timepoint fast storing and recovery method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1740981A true CN1740981A (en) | 2006-03-01 |
| CN100369000C CN100369000C (en) | 2008-02-13 |
Family
ID=36093383
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005100430975A Active CN100369000C (en) | 2005-08-12 | 2005-08-12 | A computer hardware data multi-timepoint fast storing and recovery method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100369000C (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508743A (en) * | 2011-11-10 | 2012-06-20 | 武汉噢易科技有限公司 | Multi-point backup and real-time protection method for Linux file system |
| WO2015125030A1 (en) * | 2014-02-07 | 2015-08-27 | International Business Machines Corporation | Creating restore copy from copy of source data in repository having source data at different point-in-times |
| CN108304143A (en) * | 2018-01-07 | 2018-07-20 | 长沙开雅电子科技有限公司 | A kind of memory system data temporally puts establishment i.e. protection implementation method |
| CN109144416A (en) * | 2018-08-03 | 2019-01-04 | 华为技术有限公司 | The method and apparatus for inquiring data |
| US10176048B2 (en) | 2014-02-07 | 2019-01-08 | International Business Machines Corporation | Creating a restore copy from a copy of source data in a repository having source data at different point-in-times and reading data from the repository for the restore copy |
| US10387446B2 (en) | 2014-04-28 | 2019-08-20 | International Business Machines Corporation | Merging multiple point-in-time copies into a merged point-in-time copy |
| US11169958B2 (en) | 2014-02-07 | 2021-11-09 | International Business Machines Corporation | Using a repository having a full copy of source data and point-in-time information from point-in-time copies of the source data to restore the source data at different points-in-time |
| US11194667B2 (en) | 2014-02-07 | 2021-12-07 | International Business Machines Corporation | Creating a restore copy from a copy of a full copy of source data in a repository that is at a different point-in-time than a restore point-in-time of a restore request |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6141773A (en) * | 1998-06-30 | 2000-10-31 | Emc Corporation | Method and apparatus for undoing changes to computer memory |
| US7363633B1 (en) * | 2000-04-24 | 2008-04-22 | Microsoft Corporation | Registering and storing dependencies among applications and objects in a computer system and communicating the dependencies to a recovery or backup service |
| US7613945B2 (en) * | 2003-08-14 | 2009-11-03 | Compellent Technologies | Virtual disk drive system and method |
| US7904428B2 (en) * | 2003-09-23 | 2011-03-08 | Symantec Corporation | Methods and apparatus for recording write requests directed to a data store |
| CN1609986A (en) * | 2004-11-17 | 2005-04-27 | 秦峰 | Permanent dynamic holding technique for hard discs |
-
2005
- 2005-08-12 CN CNB2005100430975A patent/CN100369000C/en active Active
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102508743A (en) * | 2011-11-10 | 2012-06-20 | 武汉噢易科技有限公司 | Multi-point backup and real-time protection method for Linux file system |
| CN102508743B (en) * | 2011-11-10 | 2014-06-04 | 武汉噢易科技有限公司 | Multi-point backup and real-time protection method for Linux file system |
| US10176048B2 (en) | 2014-02-07 | 2019-01-08 | International Business Machines Corporation | Creating a restore copy from a copy of source data in a repository having source data at different point-in-times and reading data from the repository for the restore copy |
| GB2538464A (en) * | 2014-02-07 | 2016-11-16 | Ibm | Creating restore copy from copy of source data in repository having source data at different point-in-times |
| WO2015125030A1 (en) * | 2014-02-07 | 2015-08-27 | International Business Machines Corporation | Creating restore copy from copy of source data in repository having source data at different point-in-times |
| US10372546B2 (en) | 2014-02-07 | 2019-08-06 | International Business Machines Corporation | Creating a restore copy from a copy of source data in a repository having source data at different point-in-times |
| GB2538464B (en) * | 2014-02-07 | 2020-08-12 | Ibm | Creating restore copy from copy of source data in repository having source data at different point-in-times |
| US11150994B2 (en) | 2014-02-07 | 2021-10-19 | International Business Machines Corporation | Creating a restore copy from a copy of source data in a repository having source data at different point-in-times |
| US11169958B2 (en) | 2014-02-07 | 2021-11-09 | International Business Machines Corporation | Using a repository having a full copy of source data and point-in-time information from point-in-time copies of the source data to restore the source data at different points-in-time |
| US11194667B2 (en) | 2014-02-07 | 2021-12-07 | International Business Machines Corporation | Creating a restore copy from a copy of a full copy of source data in a repository that is at a different point-in-time than a restore point-in-time of a restore request |
| US10387446B2 (en) | 2014-04-28 | 2019-08-20 | International Business Machines Corporation | Merging multiple point-in-time copies into a merged point-in-time copy |
| US11630839B2 (en) | 2014-04-28 | 2023-04-18 | International Business Machines Corporation | Merging multiple point-in-time copies into a merged point-in-time copy |
| CN108304143A (en) * | 2018-01-07 | 2018-07-20 | 长沙开雅电子科技有限公司 | A kind of memory system data temporally puts establishment i.e. protection implementation method |
| CN109144416A (en) * | 2018-08-03 | 2019-01-04 | 华为技术有限公司 | The method and apparatus for inquiring data |
| US11579986B2 (en) | 2018-08-03 | 2023-02-14 | Huawei Cloud Computing Technologies Co., Ltd. | Data query method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100369000C (en) | 2008-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9785370B2 (en) | Method and system for automatically preserving persistent storage | |
| CN1740981A (en) | A computer hardware data multi-timepoint fast storing and recovery method | |
| US7032107B2 (en) | Virtual partition for recording and restoring computer data files | |
| US5515502A (en) | Data backup system with methods for stripe affinity backup to multiple archive devices | |
| US8996468B1 (en) | Block status mapping system for reducing virtual machine backup storage | |
| US20140223096A1 (en) | Systems and methods for storage virtualization | |
| US9152823B2 (en) | Systems, methods, and computer readable media for computer data protection | |
| US20150347311A1 (en) | Storage hierarchical management system | |
| US8386847B2 (en) | Apparatus, system and method for volume-level restoration of cluster server data | |
| CN107003809A (en) | A kind of method and storage device of storage device data storage | |
| JP4222917B2 (en) | Virtual storage system and operation method thereof | |
| CN103761053A (en) | Data and method for data processing | |
| US20040268070A1 (en) | Method and apparatus for backing up data in virtual storage medium | |
| CN1965300A (en) | Apparatus and method for protecting system data on computer hard-disk | |
| KR20200123850A (en) | Hybrid memory system | |
| US8566541B2 (en) | Storage system storing electronic modules applied to electronic objects common to several computers, and storage control method for the same | |
| WO2021169163A1 (en) | File data access method and apparatus, and computer-readable storage medium | |
| TW200844744A (en) | Near instantaneous backup and restore of disc partitions | |
| JP2001051882A (en) | Snapshot referencing method and storage device | |
| CN1282067C (en) | Device and relative method for hardware array appositive operation | |
| CN1920786A (en) | System and method for implementing safety control of operation system | |
| CN1109979C (en) | Method for quick protection and recovery for hard disc data of computer | |
| US7734887B1 (en) | Relocation tracking during write operation | |
| US8060694B2 (en) | Techniques for storing system images in slices on data storage devices | |
| CN1609986A (en) | Permanent dynamic holding technique for hard discs |
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: A computer hardware data multi-timepoint fast storing and recovery method Effective date of registration: 20110415 Granted publication date: 20080213 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: 20080213 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: A computer hardware data multi-timepoint fast storing and recovery method Effective date of registration: 20120914 Granted publication date: 20080213 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 | ||
| PC01 | Cancellation of the registration of the contract for pledge of patent right |
Date of cancellation: 20150528 Granted publication date: 20080213 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 | ||
| CP03 | Change of name, title or address |
Address after: 710075 Tang Feng International D block 18, Fenghui South Road, Xi'an High-tech Zone, Shaanxi, China 601, 602, 603, 604 Patentee after: Xi'an Sanming Polytron Technologies Inc. Address before: 710075 the 3 layer of photoelectron professional incubator No. 77, science and technology two road, Xi'an hi tech Industrial Development Zone, Shaanxi. Patentee before: XI'AN SAMING TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address | ||
| DD01 | Delivery of document by public notice |
Addressee: Xi'an Sanming Polytron Technologies Inc. Person in charge of patents Document name: payment instructions |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Xi'an Sanming Polytron Technologies Inc. Person in charge of patents Document name: payment instructions |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Xi'an Sanming Polytron Technologies Inc. Person in charge of patents Document name: Notice of Termination of Patent Rights |
|
| DD01 | Delivery of document by public notice |