CN1598776A - Method of continuous recording and reserving data changing by data map - Google Patents
Method of continuous recording and reserving data changing by data map Download PDFInfo
- Publication number
- CN1598776A CN1598776A CN 200410041903 CN200410041903A CN1598776A CN 1598776 A CN1598776 A CN 1598776A CN 200410041903 CN200410041903 CN 200410041903 CN 200410041903 A CN200410041903 A CN 200410041903A CN 1598776 A CN1598776 A CN 1598776A
- Authority
- CN
- China
- Prior art keywords
- record
- data
- null
- unit
- data map
- 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
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to an approach of using PC to record and storage continuously changing data. Recording units in the invention includes record A and B. A is to record the last updating time and which record unit while B is to record that the record unit is in which time point and which record unit. So data map is built between operating system and memorizer. Data can be accessed and modified by using memorizer through data map. Adopting the invention, each time point can be rapidly got back to seek needed data, prevent virus intrusion and look for hacker proof. It can record plenty of data in a limited space to save space and time.
Description
Technical field
The present invention relates to a kind of recording method, particularly a kind of method of utilizing computer that continuous delta data is write down and keeps.
Background technology
Existing computing machine mainly is present deposit data to the storage of data, writes down the last content of these data, has been modified the content of how many times and modification before in the end depositing as for these data, does not reflect without exception.If wanting these data are modified the content of how many times and modification all reflects, then need the data of each time point are backed up, make the redundance of data increase manyfold, requirement to storage space is just very high, and it is also very long to back up the required time, influences operating rate.As data is 1G, and having write down 100 time points so just needs the 100G space, needs the time of cost to add up to the time of writing the 100G data, just needs cost 100 minutes, these obvious incompatibility people's needs on common computer.Promptly existing operating system is directly used storer, sees Fig. 1.
So, can not continuous recording and keep the data modification content of each time point, will use computer to bring a series of inconveniences and difficulty to people.As run into defective, computer virus and hacker that operating system own and application software may exist destruction, collapse that user's level is limit the computer system that causes, utilize computer crime etc.; all owing to the state that computer can not be returned to the destroyed arbitrary time point before of computer; maybe can not bear fruit and cause to use; can not protect the operating system and the data of computer, and only can return to virgin state and can not overcome these difficulties and result.
Summary of the invention
Purpose of the present invention just is to overcome above-mentioned defective, and design, development are a kind of can continuous recording and keep the method for delta data.
Technical scheme of the present invention is: data map can continuous recording and the method that changes of retention data, its major technique is characterised in that a record cell has A record, B record composition data map, this record cell of A record record last update time of point and actual which record cell that is documented in of this record cell, the current data of depositing of B record this record cell of record are which time point and which record cell.
Further technical scheme of the present invention is that major technique is characterised in that when visiting a record cell, inquire about the A record of this record cell correspondence according to data map, obtain this record cell last update time of point and the actual new record cell of depositing of this record cell, the data of reading this new record unit.
The further again technical scheme of the present invention is that major technique is characterised in that when writing a record cell, if not record of A record, then this record cell is empty, directly new data is write on this record cell, if the A record is on the books, then new data is write on another new record unit, revise A record, B record, constitute new data map.
Advantage of the present invention and effect are very obviously and have a practical application effect.
The present invention can continuous recording and is kept the data variation of each time point, therefore not only can quickly recover to the original time point, and the arbitrary time point before also can returning to is sought needed data.
Write one piece of article in first day as someone; Revised partial content in second day; Revised a part on the 3rd day again; He was dissatisfied and deleted this document in the 4th day; He wanted to give for change this document suddenly again in the 5th day; He just can give this document for change to utilize the present invention, comprises first day, second day, the 3rd day, the 4th day content.
And for example ran into virus the day before yesterday, can not work, then as long as time point is returned to three days ago, just the data that computer three days ago also can be encroached on all access, do not influence and work on and operate, if might and necessary, the kill virus of turning back again; The hacker of attack of computer systems, stay data (vestige) on each time point that can be in computed process and be retained, even the hacker has removed all vestiges, but the data that the past has remained can help the investigator to recall by the time, seek the evidence that computer system is attacked step by step; The defective of computer operating system and application software existence and mistake cause the computer paralysis for another example, can easily return to the preceding normal operating conditions of paralysis.
In starting to the process of arbitrary time point, because the data map of having utilized A record, B record to constitute can write down lot of data in limited space, saved the space, also saved the time.As utilize the present invention can create 60,000 progresses, even more, writing down 10 progresses every day, this just means if needed and is necessary, can return to over arbitrary time point in 20 years to computer.
Description of drawings
Existing operating system before Fig. 1---the present invention is directly used the storer synoptic diagram.
Fig. 2---data map of the present invention is set up process flow diagram.
Fig. 3---operating system of the present invention is used the storer synoptic diagram by data map.
Fig. 4---each time point data map is incorporated in a synoptic diagram in the data map among the present invention.
Embodiment
Between computer operating system and storer, set up the data map or the map reference of A record, B record formation.
At first, defining a data unit is 1 sector or a plurality of sector, and for example 40 sectors suppose that all sector numbers of hard disk are N, and number of data units is N/40 so; Secondly, definition time point (parameter constantly) variable P=0, this moment of data map is created in expression; Once more, create the set that the data map form is A record and B record.See shown in Figure 2.From time stream, from Monday to Sunday, the one tunnel has all set up A record, the B record of raw data map; Consult the data of certain time point such as the data of Wednesday when needs, then find the data of Wednesday, and then calculate, set up new data map, to substitute original data map by the raw data map.Certainly, the present invention is not limited to the represented content of Fig. 2.
The A record last time point that upgrades in this unit of expression and this data physical record are in which unit; The current data of depositing in B record this unit of expression are to belong to which time point and which unit.
For example for A record (1,3,5) expression unit 1, the last time point that upgrades is 3, and the data physical record is in Unit 5.
Be recorded in unit 2 for B record (2,4,6) expression unit 6 in the real data of time point 4.
Total record number is the twice of unit number.The summation ∑ (A+B) of the record of all storage unit becomes data map.
Initialization data map (for newly-built data map) is labeled as:
P＝0
The A record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).Null is expressed as sky.Represent that there are data the first five unit, back five unit are empty.
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
When visiting the data of certain unit, inquire about the A record of this unit correspondence according to data map, can obtain actual which storage unit that leaves in of these data of last moment, the data of reading new unit then get final product.For example for A (1,0,1), be illustrated in P=0 time point (time parameter), the deposit data of unit 1 is 1 the inside in the unit.Read unit 1 the time can directly read unit 1.
When needs are revised the data of certain unit, there are two kinds of situations, if i.e. not record of the A of this unit correspondence record shows that this element is actual in effective unit, directly write on this element; If this unit is not effective unit, just need inquire an effective unit, then data are write new unit.Below either way need to revise simultaneously A record and B record, form new data map, with convenient read-write next time.
For example, when revising unit 1, this time point (parameter constantly) P=1, it is not effective unit that inquiry B record (1,0,1) is found, find B (6,0, null), be effective unit, then data are write unit 6, revising A (1,0,1) is A (1,1,6); Modification B (6,0, be B (6,1,1) null), so just finished the operation of revising unit 1.The data of the unit 6 of expression B come from the valid data of the unit 1 of A.
Data map is revised as:
P＝1
The A record: (1,1,6) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The data content of record current time only need be recorded as current point in time with the time point of data map, has just finished the curing of current time point data is preserved.
For example, example in the continuation only need be provided with time point variable P=2 and promptly realize the preservation of current data is operated.Owing to only revised a variable of data map, so very fast of this operation.
Data map is revised as:
P＝2
The A record: (1,1,6) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
In actual use, for obtaining data content sometime, the time point of inquiry is as required then revised all A records of data map, what make the record of A record is actual which unit that leaves in of pairing this cell data of this time point, so just can read the data content of this time point.
For example, obtain the data content of P=0 each unit constantly:
Need traversal B record, search the record of P=0, as find B (1,0,1), promptly corresponding modification A (1,1,6) is (1,0,1), by that analogy;
In traversal B record, P＜0 record, corresponding A record does not change, as finds B (6,1,1), promptly Dui Ying A (6,0, null) do not revise;
Revise P=3, this time point of mark is although the data content of this time point is constantly identical with P=0;
Data map is revised as:
P＝3
The A record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
Traversal A record for each A record, shows actual which storage unit that leaves in of these data of last moment, and the data of reading new unit then get final product.For example for A (1,0,1), the data of expression unit 1 are placed on 1 the inside, unit, just can directly read unit 1 when reading unit 1.
Revise the data map that past data information sometime must obtain this moment earlier, and this data map is labeled as the new moment.As to set P=3 be a new time point, though content is revised data information, because the new data of revising is recited as a new moment P=3, so can not destroy former data with the same during P=0 constantly in the past.
For instance:
P＝3
The A record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
Revise the data of unit 1, must search the B record, obtain B (7,0, null), revise B (7,0, null) be B (7,3,1), modification A (1,0,1) is that A (1,3,7) gets final product.
Data map is revised as:
P＝3
The A record: (1,3,7) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,3,1) (8,0, null) (9,0, and null) (10,0, null).
Preserve the data of current time, P=4 is set so, data map is revised as:
P＝4
The A record: (1,3,7) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,3,1) (8,0, null) (9,0, and null) (10,0, null).
Revise the data of unit 1 once more when needs, then search the B record, obtain B (8,0, null), revise B (8,0, null) be B (8,4,1); Revising A (1,3,7) is A (1,4,8), and data map is revised as:
P＝4
The A record: (1,4,8) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,3,1) (8,4,1) (9,0, and null) (10,0, null).
When needs deletions data sometime to reach the effect of Free up Memory, must at first travel through the B record, at each unit, search this cell data in each situation of depositing constantly, if the record of this element is arranged in the B of P writes down sometime, and the record that this element is still arranged in next one moment P1 illustrates that so this unit can be released in P space constantly.Free up Memory need be corresponding B recording setting empty only, i.e. null.
For instance, current data map is
The data of deletion moment P=3 at first travel through the B record if desired, obtain for unit 1: B (1,0,1), (6,1,1), (7,3,1), (8,4,1).
Whether for monopolizing the space,, illustrate that B (7,3,1) monopolizes when judging P=3 owing to there is B (8,4,1), promptly unnecessary.
The content of unit 1 during moment P=3 that deletion is preserved in unit 7 discharges the purpose in the shared space of P=3 constantly to reach, promptly revise B (7,3,1) and be B (7,0, null).
Data map is revised as:
P＝4
The A record: (1,4,8) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,0, null) (7,0, null) (8,0, null) (9,0, and null) (10,0, null).
The B record: (1,0,1) (2,0,2) (3,0,3) (4,0,4) (5,0,5) (6,1,1) (7,0, null) (8,4,1) (9,0, and null) (10,0, null).
In above method, can see, the present invention relies on the record of data map realization to a plurality of moment contents of data, no matter be to increase constantly new or minimizing one Geju City moment, all be to change in data map, actual data are not duplicated into many parts, and, the size of data map also is changeless, not because need the moment increase of record and become big.
Because data map only accounts for the very little part of real data, very short for the needed time of the operation of data map, this method can reach in the extremely short time inquires about, revise, deletion in the past sometime data and do not destroy other data constantly, can add new moment content and can not cause the explosive volume grows of redundancy backup.
Operating system of the present invention is used storer by data map, sees Fig. 3.
Particularly, be exactly among the present invention each time point data map be incorporated in the data map, see Fig. 4.
Claims (7)
1. data map can continuous recording and the method that changes of retention data, it is characterized in that a record cell has A record, B record composition data map, this record cell of A record record last update time of point and actual which record cell that is documented in of this record cell, the current data of depositing of B record this record cell of record are which time point and which record cell.
2. data map according to claim 1 can continuous recording and the method that changes of retention data, when it is characterized in that visiting a record cell, inquire about the A record of this record cell correspondence according to data map, obtain this record cell last update time of point and the actual new record cell of depositing of this record cell, the data of reading this new record unit.
3. data map according to claim 1 can continuous recording and the method that changes of retention data, when it is characterized in that revising a record cell, if not record of A record, then this record cell is effective, directly will make amendment,, then new data be write on another new record unit if the A record is on the books to this record cell, revise A record, B record, constitute new data map.
4. data map according to claim 2 can continuous recording and the method that changes of retention data, it is characterized in that the time parameter inquired about as required, revise all A records of data map, obtain the actual unit of depositing of pairing this cell data of this time parameter of A record record, read the data content of this unit at this time parameter.
5. can continuous recording according to claim 2,4 described data map and the method that changes of retention data, it is characterized in that obtaining data map according to time parameter, this time parameter is defined as new time point, revises data, the data of revising are documented in the data cell of new time point.
6. data map according to claim 4 can continuous recording and the method that changes of retention data, it is characterized in that obtaining data map according to time parameter, and the data content deletion with this time parameter discharges this time parameter proprietary data unit.
7. data map according to claim 1 can continuous recording and the method that changes of retention data, it is characterized in that in current point in time record data content, and the time parameter of data map is recited as current point in time, realize the curing of the data that write down is preserved.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100419030A CN100422944C (en) | 2004-09-08 | 2004-09-08 | Method of continuous recording and reserving data changing by data map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100419030A CN100422944C (en) | 2004-09-08 | 2004-09-08 | Method of continuous recording and reserving data changing by data map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1598776A true CN1598776A (en) | 2005-03-23 |
| CN100422944C CN100422944C (en) | 2008-10-01 |
Family
ID=34665305
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100419030A Expired - Fee Related CN100422944C (en) | 2004-09-08 | 2004-09-08 | Method of continuous recording and reserving data changing by data map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100422944C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105955845A (en) * | 2016-04-26 | 2016-09-21 | 浪潮电子信息产业股份有限公司 | Data recovery method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5230047A (en) * | 1990-04-16 | 1993-07-20 | International Business Machines Corporation | Method for balancing of distributed tree file structures in parallel computing systems to enable recovery after a failure |
-
2004
- 2004-09-08 CN CNB2004100419030A patent/CN100422944C/en not_active Expired - Fee Related
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105955845A (en) * | 2016-04-26 | 2016-09-21 | 浪潮电子信息产业股份有限公司 | Data recovery method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100422944C (en) | 2008-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220171740A1 (en) | Heuristic interface for enabling a computer device to utilize data property-based data placement inside a nonvolatile memory device | |
| US9489388B2 (en) | Computing system, host system and method for managing data | |
| JP5184462B2 (en) | Method of storing data in flash memory in a manner independent of DBMS using page-differential | |
| US9368130B2 (en) | Data storage system, method of writing to storage in the data storage system, hard disk and method of forming the hard disk | |
| CN101233517B (en) | Maintaining an aggregate including active files in a storage pool | |
| US8069320B1 (en) | System and method for consolidation of backups | |
| US8799622B2 (en) | Method for managing a memory apparatus | |
| CN1253799C (en) | File control method | |
| US20140325115A1 (en) | Conditional Iteration for a Non-Volatile Device | |
| US7769725B2 (en) | File profiling to minimize fragmentation | |
| US7933938B2 (en) | File storage system, file storing method and file searching method therein | |
| CN1495669A (en) | Method and system for building-up and restoring image document | |
| CN1770114A (en) | Copy operations in storage networks | |
| CN1900919A (en) | Address mapping method and mapping information managing method for flash memory, and flash memory using the same | |
| CN1512353A (en) | Performance improved data storage and method | |
| CN102696010A (en) | Apparatus, system, and method for caching data on a solid-state storage device | |
| CN1208891A (en) | Disc memory device data renewing method and disc memory controlling device | |
| JP2007012060A (en) | File system having inverted hierarchical structure | |
| KR100854032B1 (en) | Memory system and data storaging method thereof | |
| JP2022500723A (en) | Systems and methods for bulk deleting records in a database | |
| Lee et al. | An efficient index buffer management scheme for implementing a B-tree on NAND flash memory | |
| CN1359071A (en) | Method for completely deleting files on hard disk | |
| CN104050090A (en) | Staging sorted data in intermediate storage | |
| CN1823327A (en) | Data area managing method in information recording medium and information processor employing data area managing method | |
| CN100338607C (en) | Method for organizing and accessing distributive catalogue of document 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081001 Termination date: 20130908 |