CN102346693A - Method for data storage and data recovery - Google Patents
Method for data storage and data recovery Download PDFInfo
- Publication number
- CN102346693A CN102346693A CN2010102410642A CN201010241064A CN102346693A CN 102346693 A CN102346693 A CN 102346693A CN 2010102410642 A CN2010102410642 A CN 2010102410642A CN 201010241064 A CN201010241064 A CN 201010241064A CN 102346693 A CN102346693 A CN 102346693A
- Authority
- CN
- China
- Prior art keywords
- data
- row
- memory blocks
- test value
- proof test
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The embodiment of the invention provides a method for data storage and data recovery, which relates to the field of data security storage, can reduce the condition limitations of data recovery, and recovers corrupted data on larger range by utilizing the limited storage space. The storage method comprises the following steps of: carrying out equal segmentation on the distributed storage space by adopting logic blocks in the form of a line-row matrix form as a unit, and obtaining at least two same logic storage blocks; and carrying out line-row and the third-dimension check on the logic storage blocks and obtaining respective check values. The recovery method adopts data recovery in the logic storage blocks, data recovery among the logic storage blocks and interblock combined data recovery among the logic storage blocks. The embodiment of the invention is used for the storage and reading of data.
Description
Technical field
The present invention relates to the data security field of storage, relate in particular to a kind of data storage and data reconstruction method.
Background technology
The data security memory technology is an important techniques, can be used for important data are stored, and can restore data when certain damage appears in data.The environment of data-storage applications is a lot; In all basic signal processing systems; All need store digitized information; But because the different and extraneous interference of application scenario; There is damage unavoidably in the data of storage; Can't read proper data when reading, therefore need certain data storage and recovery technology that data are recovered.DVR (Digital Video Recorder for example; Digital video recorder) is exactly visual plant in the field of video monitoring; Can store recorded video data; Because the arrangement environment of DVR is poor through regular meeting; The data that store may or shake reason because of the electromagnetism reason and damage; Therefore need add certain data security mechanism to DVR, when guaranteeing that the data of storing go wrong, the data that can recover to damage.
In the prior art; A kind of recovery of stomge method is: data to be stored are divided into a plurality of partition datas; The verification of calculating a plurality of partition datas with, and a plurality of partition data and verification and step-by-step XOR result, the checking data of a plurality of partition datas and generation is stored simultaneously.Can recover according to checking data and unspoiled data during corrupted data.But this method is carried out repeated storage with data, has taken more additional storage space.
Another kind of recovery of stomge method is: the duplication check sign indicating number of actual storage data is set in each data logical memory blocks of being stored, and is each data logical memory blocks configuration distinctive mark and numbering.Find each data logical memory blocks of these group data during corrupted data according to the distinctive mark of data logical memory blocks; Then, the numbering according to the data logical memory blocks is linked in sequence each data logical memory blocks; At last, each data logical memory blocks being carried out data through check code recovers.This method can be recovered the data of a delegation or a row damage, but for the situation of recovering the multiple lines and multiple rows corrupted data, then has than limitations.
Summary of the invention
Embodiments of the invention provide a kind of data storage and restoration methods, can reduce the condition restriction that data are recovered, and utilize finite storage space, recover the data of damaging more broadly.
For achieving the above object, embodiments of the invention adopt following technical scheme:
On the one hand, a kind of date storage method is provided, has comprised:
Is that unit waits and cuts apart to the storage space that distributes with the logical block of ranks matrix form; Obtain at least two identical logical memory blocks; Wherein, each logical memory blocks is the ranks matrix form, and said at least two logical memory blocks stack constitutes the three-dimensional matrice form;
Each line data to each logical memory blocks carries out verification respectively, obtains the capable proof test value of every row;
Each column data to each logical memory blocks carries out verification respectively, obtains the row proof test value of every row;
Every group of data at least two logical memory blocks third dimensions of said three-dimensional matrice form are carried out verification respectively, obtain the third dimension proof test value of every group of data.
On the other hand, a kind of data reconstruction method that adopts above-mentioned date storage method is provided, has comprised:
Data are recovered and/or the recovery of logical storage interblock data in the logical memory blocks;
Data are recovered to comprise in the said logical memory blocks:
If listing when having only said corrupt data one place to damage of corrupt data place then recovered said corrupt data with the said row proof test value that lists other unspoiled all data and said row; And/or
If when having only said corrupt data one place to damage on the row at corrupt data place, then the capable proof test value with other unspoiled all data and said row on the said row recovers said corrupt data;
Said logical storage interblock data are recovered to comprise:
If when having only said corrupt data one place to damage in the third dimension group at corrupt data place, then the third dimension proof test value with other unspoiled all data and said third dimension group in the said third dimension group recovers said corrupt data.
Data storage that the embodiment of the invention provides and data reconstruction method; When data storage; Is that unit waits and cuts apart to the storage space that distributes with the logical block of ranks matrix form; Obtain identical a plurality of logical memory blocks; Wherein, Each logical memory blocks is the ranks matrix form, and a plurality of logical memory blocks stacks constitute the three-dimensional matrice form; Each row, each column data to each logical memory blocks carry out verification respectively, obtain the capable proof test value of every row and the row proof test value of every row; Every group of data on a plurality of logical memory blocks third dimensions of three-dimensional matrice form are carried out verification respectively, obtain the third dimension proof test value of every group of data.Thus, three groups of proof test values of horizontal, vertical and the third dimension have been obtained, so that when restore data, can recover to multiple lines and multiple rows; In addition, the resulting proof test value quantity of the embodiment of the invention is not a lot, and the relative raw data of proof test value takes up space not really big, has solved and has taken the big problem of storage space in the prior art, and simultaneously data recovery function preferably can be provided.
When data are recovered, adopted that data are recovered in the logical memory blocks, logical storage interblock data are recovered and logical memory blocks in, interblock associating data recover.Enriched data reset mode of the prior art; On the basis that row in piece, column data recover, recovered to reduce the condition restriction that data are recovered, utilized finite storage space through the third dimension data of interblock; Can recover the data damaged more broadly, and not increase the recovery difficulty.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously; Accompanying drawing in describing below only is some embodiments of the present invention; For those of ordinary skills; Under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The FB(flow block) of the date storage method that Fig. 1 provides for the embodiment of the invention;
In the date storage method that Fig. 2 provides for the embodiment of the invention, the logical organization synoptic diagram of a logical memory blocks;
In the date storage method that Fig. 3 provides for the embodiment of the invention, the logical organization synoptic diagram of a plurality of logical memory blocks;
In the date storage method that Fig. 4 provides for the embodiment of the invention, capable verification and row verification synoptic diagram in logical memory blocks;
In the date storage method that Fig. 5 provides for the embodiment of the invention, the synoptic diagram of the third dimension verification of a plurality of logical memory blocks;
In the data reconstruction method that Fig. 6 provides for the embodiment of the invention, the logical organization synoptic diagram that recovers in the logical memory blocks piece;
In the data reconstruction method that Fig. 7 provides for the embodiment of the invention, another synoptic diagram of logical organization that recovers in the logical memory blocks piece;
In the data reconstruction method that Fig. 8 provides for the embodiment of the invention, the logical organization synoptic diagram that the logical memory blocks interblock recovers.
Embodiment
To combine the accompanying drawing in the embodiment of the invention below, the technical scheme in the embodiment of the invention is carried out clear, intactly description, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
The date storage method that the embodiment of the invention provides as shown in Figure 1, may further comprise the steps:
S101, be that unit carries out etc. cutting apart with the logical block of ranks matrix form to the storage space that distributes; Obtain at least two identical logical memory blocks; Wherein, each logical memory blocks is the ranks matrix form, and at least two logical memory blocks stacks constitute the three-dimensional matrice form.
Concrete, can earlier the storage space that distributes be formed ranks matrix form in logic, the logical block with predetermined ranks matrix form is that unit waits separation then, the size of this logical block can be determined by user oneself.Obtain a plurality of identical logical memory blocks after cutting apart, as shown in Figure 2, suppose that a logical memory blocks in the present embodiment is 8 row * 10 row.A plurality of logical memory blocks stacks constitute the three-dimensional matrice form, and structure supposes that it is 3 logical memory blocks that present embodiment is divided into as shown in Figure 3.
Further, can accelerate disk read-write speed like this, and when follow-up piecemeal deal with data, can make data neatly be prone to handle for the continuous storage space of the data allocations that will store.
S102, each line data of each logical memory blocks is carried out verification respectively, obtain the capable proof test value of every row.
As shown in Figure 4, represent a logical memory blocks, obtain the first row proof test value in the verification of carrying out first row.After each provisional capital verification of this logical memory blocks finishes, obtain 8 capable proof test values.
S103, each column data of each logical memory blocks is carried out verification respectively, obtain the row proof test value of every row.
As shown in Figure 4, represent that a logical memory blocks in the verification of carrying out first row, obtains the first row proof test value.After respectively being listed as all verifications and finishing of this logical memory blocks, obtain 10 row proof test values.
S104, every group of data at least two logical memory blocks third dimensions of three-dimensional matrice form are carried out verification respectively, obtain the third dimension proof test value of every group of data.
In the present embodiment; Five equilibrium has obtained 3 logical memory blocks altogether; Promptly every group of data on 3 logical memory blocks third dimensions of this three-dimensional matrice form are carried out verification respectively; As shown in Figure 5; Expression is carried out verification to one group of data in the upper left corner of three-dimensional matrice, obtains the third dimension proof test value of this group of the upper left corner.Because each logical memory blocks is 8 row * 10 row, so after third dimension verification finishes, obtain 80 third dimension proof test values altogether.
In the present embodiment, the verification that step S102, S103, S104 carried out can be the XOR between each data, and algorithm complex is low like this, can realize fast data storage and reads.But the embodiment of the invention is not limited to this, other verification computing also can, all should fall in the application's protection domain as long as can be used for carrying out all verification computings that data recover.
Further, whether occur damaging, can also calculate the monoblock proof test value of all data of whole logical memory blocks again for the ease of the data in the decision logic storage block.In the later stage deterministic process, if this monoblock proof test value changes, then can illustrate in this logical memory blocks has corrupted data.
In addition, the capable proof test value that aforementioned calculation obtains, row proof test value, third dimension proof test value and monoblock proof test value respectively corresponding stored in the storage area of other distribution, so that corresponding use during restore data.
Need to prove that the step S102 in the present embodiment, S103, S104 do not have succession, both can calculate simultaneously that also can successively calculate, this depends on the computing power of user's setting and equipment.
The date storage method that the embodiment of the invention provides; Is that unit waits and cuts apart to the storage space that distributes with the logical block of ranks matrix form; Obtain identical a plurality of logical memory blocks; Wherein, Each logical memory blocks is the ranks matrix form, and a plurality of logical memory blocks stacks constitute the three-dimensional matrice form; Each row, each column data to each logical memory blocks carry out verification respectively, obtain the capable proof test value of every row and the row proof test value of every row; Every group of data on a plurality of logical memory blocks third dimensions of three-dimensional matrice form are carried out verification respectively, obtain the third dimension proof test value of every group of data.Thus, three groups of proof test values on horizontal, vertical and the third dimension have been obtained, so that when restore data, can recover to multiple lines and multiple rows.
In addition, the resulting proof test value quantity of the embodiment of the invention is not a lot, and the relative raw data of proof test value takes up space not really big.The size of logic of propositions storage block be W capable * H row, then the needed space of proof test value size is W+H+1 (proof test value number+row proof test value number+monoblock proof test value at once) in the piece; And the third dimension proof test value requisite space of interblock size is W * H (being data number in the piece), and (W+H+1)+(its shared space is little for W * H), the data number in the relative memory space so proof test value takies altogether.
In a word, the date storage method that the embodiment of the invention provides has solved and has taken the big problem of storage space in the prior art, and simultaneously data recovery function preferably can be provided.
The data reconstruction method that utilizes above-mentioned date storage method that the embodiment of the invention provides; This data reconstruction method comprises: data recovery and/or logical storage interblock data are recovered in the logical memory blocks, promptly comprise: data are recovered in the piece, the interblock data are recovered and the interior interblock associating of piece data are recovered.
Wherein, data are recovered to comprise in the logical memory blocks:
If listing when having only this corrupt data one place to damage of corrupt data place then recovered this corrupt data with this row proof test value that lists other unspoiled all data and these row.And/or
If when having only this corrupt data one place to damage on the row at corrupt data place, then the capable proof test value with other unspoiled all data on this row and this row recovers this corrupt data.
That is, the data recovery comprises in the piece: (laterally) data of going are recovered, row (vertically) data are recovered and go, be listed as (laterally, vertically) associating data recovery.
Logical storage interblock data are recovered to comprise:
If when having only this corrupt data one place to damage in the third dimension group at corrupt data place, then the third dimension proof test value with other unspoiled all data in this third dimension group and this third dimension group recovers this corrupt data.
Concrete, recover for interblock associating data in the piece, can be divided into two kinds of situation:
Situation 1: if data recovery in the logical memory blocks is then carried out in going or listing when having only this first corrupt data, one place to damage of first corrupt data place earlier; After the recovery, when having only this second corrupt data, one place to damage in the third dimension group as if second corrupt data place, then carry out logical storage interblock data again and recover.The data that are back interblock in the first piece are recovered.
Situation 2: when having only this first corrupt data, one place to damage in the third dimension group as if first corrupt data place, then carry out data recovery between logical memory blocks earlier; After the recovery, if data recovery in the logical memory blocks is then carried out in going or listing when having only this second corrupt data, one place to damage of second corrupt data place again.Be that the data in the piece are recovered behind the first interblock.
Below the branch situation specifically describe.
In reading of data, need to recover to data being carried out verification again and data.Verification again during reading of data is same calculating process with the verification of storage during data, i.e. verification and again verification be living calculating, the judgement of so just comparing.Because what verification was adopted in the above-mentioned storage implementation example is XOR, then in the present embodiment, XOR is adopted in the verification of adopting when reading again equally.
At first the data of each logical memory blocks are carried out whole verification again, promptly calculate the XOR value of whole logical memory blocks, the monoblock that obtains each logical memory blocks is proof test value again.And the monoblock proof test value that calculates during with data storage compares, if both equate, thinks that then data are normal in this logical memory blocks; Think that then damaging appears in the interior data of this logical memory blocks, needs to recover if both are unequal.
When the corrupt data in the logical memory blocks is recovered, need find the position of this corrupt data, its method can for: each line data to logical memory blocks carries out verification more respectively, and the row that obtains every row is proof test value again; If row of certain row capable proof test value the during data storage of proof test value and preservation again is unequal, then confirm the data appearance damage in this row.Each column data to logical memory blocks carries out verification more respectively, and the row that obtain every row are proof test value again; If the row of certain row row proof test value the during data storage of proof test value and preservation again are unequal, confirm that then damage appears in the data in these row.Intersections capable through corrupt data, the corrupt data row are confirmed the position of corrupt data in logical memory blocks.
The process that data are recovered is following:
1, the data in the logical memory blocks are recovered
(1) if the corrupt data in the logical memory blocks is positioned at on delegation's different lines the time, then can through corrupt data place row other not the row proof test value of these row of corrupt data and preservation this corrupt data is recovered.The row proof test value of these row carries out XOR during promptly with the not corrupt datas of other row of corrupt data place row and data storage, recovers this corrupt data.As shown in Figure 6; Suppose that listing data at the 3rd, 5,6 of the 3rd row occur to damage, so for the corrupt data of the 3rd row the 3rd row, just utilize the 3rd list other not the row proof test value of corrupt data and the 3rd row recover; Equally, other two corrupt datas also are like this.In a word, if certain lists when having only this corrupt data one place to damage, then this corrupt data is recovered with this row proof test value that lists other unspoiled all data and these row.
(2) if the corrupt data in the logical memory blocks is when being positioned on the same row different rows, then other that can be expert at through corrupt data not the row proof test value of this row of corrupt data and preservation this corrupt data is recovered.Promptly the capable proof test value of this row carries out XOR when the not corrupt data of other row of being expert at corrupt data and data storage, recovers this corrupt data.As shown in Figure 7; Suppose that data occur to be damaged on the 2nd, 5,6 row of the 4th row, so for the 4th corrupt data that is listed as the 2nd row, just utilize on the 2nd row other not the capable proof test value of corrupt data and the 2nd row recover; Equally, other two corrupt datas also are like this.In a word, if certain is gone when having only this corrupt data one place to damage, then the capable proof test value with other unspoiled all data on this row and this row recovers this corrupt data.
Further; When the corrupt data in the logical memory blocks is positioned on the multiple lines and multiple rows; If the requirement that the satisfied row of corrupt data recovers just elder generation recovers according to the row restoration methods, after the recovery, the requirement of satisfying the row recovery as if other corrupt datas just recovers according to the row restoration methods again; Equally, just recover according to the row restoration methods earlier, after the recovery, just recover according to the row restoration methods again if other corrupt datas satisfy the requirement of row recovery if corrupt data satisfies the requirement that row recover.In a word, row, row recover not strict succession, can hocket.But in practical application, for simplicity, also can preset the order of a recovery; For example, can advanced every trade recover, all corrupt datas that satisfy row recovery condition are all recovered to all corrupt datas; After the recovery, again other corrupt datas are listed as recovery.Certainly, this also can adopt other order just for example.
2, the data of logical storage interblock are recovered
(1) if having only in the logical memory blocks in each logical memory blocks of three-dimensional matrice form corrupted data appears; And the logical memory blocks of damaging is not the corrupted data of a certain row or a certain row; As shown in Figure 8, can't in logical memory blocks, recover.Can recover the corrupt data in this piece through the proof test value of the third dimension in this case.Promptly to certain corrupt data, on the third dimension group at its place, utilize on this third dimension group other not the third dimension proof test value of this third dimension group of corrupt data and preservation carry out XOR, recover this corrupt data.
(2) damaging appears in data in two logical memory blocks if having in each logical memory blocks of three-dimensional matrice form; And data are all correct in other logical memory blocks; And in each logical memory blocks that occurs damaging all is that corrupted data appears in multiple lines and multiple rows, can't be through recovering in the piece.But, then can recover through third dimension proof test value as long as the data that these two logical memory blocks are damaged are not overlapping on position on the third dimension.
(3) can release through the corrupted data rejuvenation of above-mentioned two logical memory blocks; If there are the data of N logical memory blocks to occur damaging; And when the data of damaging in each logical memory blocks all can not be recovered through piece is interior; As long as the data that each piece of this N logical memory blocks damages are not overlapping on the third dimension; Be that the everywhere corrupt data is unique on the third dimension group at its place, then can recover the data of damaging through the proof test value of the third dimension.
In a word, if when having only this corrupt data one place to damage in the third dimension group, then the third dimension proof test value with other unspoiled all data in this third dimension group and this third dimension group recovers this corrupt data.
3, logical memory blocks associating data interior and interblock are recovered
The recovery of back logical storage interblock in elder generation's logical memory blocks
(1) if there are two logical memory blocks corrupted data to occur in each logical memory blocks of three-dimensional matrice form; Other logical memory blocks are all correct; And the data that these two logical memory blocks are damaged are overlapping on the position of the third dimension, can't directly recover through third dimension proof test value.If but wherein some logical memory blocks satisfy the characteristics that data are recovered in the piece; Be that this corrupt data is expert at or is listed unique in the piece; Then can in this logical memory blocks, utilize above-mentioned interior restoration methods that it is recovered earlier; This moment, the corrupt data in another logical memory blocks just became uniquely on the third dimension, just can utilize the method recovery of interblock restore data that it has been recovered afterwards.
(2) if there be N logical memory blocks corrupted data to occur in each logical memory blocks of three-dimensional matrice form; And the data of damaging are overlapping on the third dimension; Can't directly recover with the interblock data; If if having M logical memory blocks to meet the characteristics of recovering in the piece in N logical memory blocks; Be that this corrupt data is expert at or is listed unique in the piece; Then recover this M logical memory blocks with data reconstruction method in the piece earlier; Afterwards; If the corrupt data of N-M remaining logical memory blocks is unique on the third dimension, then can utilize the interblock data reconstruction method to recover once more.
Recovery behind elder generation's logical storage interblock in the logical memory blocks
(1) if there are two logical memory blocks corrupted data to occur in each logical memory blocks of three-dimensional matrice form; Other logical memory blocks are all correct; If the data that these two logical memory blocks are damaged all do not meet the characteristics that data are recovered in the piece; Be in the piece this corrupt data be expert at or list not unique, can't be directly with the interior data reconstruction method of piece.If but wherein some logical memory blocks satisfy the characteristics that the interblock data are recovered; Be that this corrupt data is unique on its place third dimension group in the piece; Then can utilize above-mentioned interblock data reconstruction method that the corrupt data in this piece is recovered earlier; Corrupt data is expert at or is listed and just becomes uniquely in this moment this logical memory blocks, utilizes afterwards that data reconstruction method recovers it in the piece again.Another logical memory blocks piece also can be with recovering with quadrat method.
(2) there be N logical memory blocks to damage in each logical memory blocks of three-dimensional matrice form; Corrupt data in each logical memory blocks does not satisfy the characteristics of recovering in the piece; Be corrupt data going or list not uniquely in piece, each logical memory blocks can't be directly be recovered with data in the piece.If but the corrupt data in this N logical memory blocks is unique on the third dimension; So just can carry out interblock earlier recovers; Afterwards if corrupt data has satisfied the characteristics of recovering in the piece, promptly going or list uniquely in piece just can be carried out in the piece recovery once more to accomplish final recovery.
Need to prove that recovery and interblock recover not strict order in the piece of logical memory blocks, can hocket repeatedly.But in practical application; For simplicity; Also can preset the order of a recovery; For example to all corrupt datas on each logical memory blocks; Can carry out the interior data of piece of each logical memory blocks earlier recovers; And data are recovered advanced every trade and are recovered to be listed as recovery again in the piece, after data are recovered in the piece, carry out the interblock data again and recover.Certainly, this also can adopt other order just for example.
The data reconstruction method of the date storage method that utilizes the foregoing description that the embodiment of the invention provides has adopted data recovery in the logical memory blocks, the recovery of logical storage interblock data and logical memory blocks is interior, interblock associating data are recovered.Enriched data reset mode of the prior art; On the basis that row in piece, column data recover, recovered to reduce the condition restriction that data are recovered, utilized finite storage space through the third dimension data of interblock; Can recover the data damaged more broadly, and not increase the recovery difficulty.
One of ordinary skill in the art will appreciate that: all or part of step that realizes said method embodiment can be accomplished through the relevant hardware of programmed instruction; Aforesaid program can be stored in the computer read/write memory medium; This program the step that comprises said method embodiment when carrying out; And aforesaid storage medium comprises: various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
The above; Only be the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technician who is familiar with the present technique field is in the technical scope that the present invention discloses; Can expect easily changing or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion by said protection domain with claim.
Claims (9)
1. a date storage method is characterized in that, comprising:
Is that unit waits and cuts apart to the storage space that distributes with the logical block of ranks matrix form; Obtain at least two identical logical memory blocks; Wherein, each logical memory blocks is the ranks matrix form, and said at least two logical memory blocks stack constitutes the three-dimensional matrice form;
Each line data to each logical memory blocks carries out verification respectively, obtains the capable proof test value of every row;
Each column data to each logical memory blocks carries out verification respectively, obtains the row proof test value of every row;
Every group of data at least two logical memory blocks third dimensions of said three-dimensional matrice form are carried out verification respectively, obtain the third dimension proof test value of every group of data.
2. date storage method according to claim 1 is characterized in that, said method also comprises:
All data on each logical memory blocks are carried out verification, obtain the monoblock proof test value of each logical memory blocks.
3. date storage method according to claim 1 is characterized in that, the storage space of said distribution is continuous storage space.
4. date storage method according to claim 2 is characterized in that,
Said capable proof test value, row proof test value, third dimension proof test value and monoblock proof test value are distinguished corresponding stored in other storage area.
5. a data reconstruction method that adopts the described date storage method of claim 1 is characterized in that, said data reconstruction method comprises: data are recovered and/or the recovery of logical storage interblock data in the logical memory blocks;
Data are recovered to comprise in the said logical memory blocks:
If listing when having only said corrupt data one place to damage of corrupt data place then recovered said corrupt data with the said row proof test value that lists other unspoiled all data and said row; And/or
If when having only said corrupt data one place to damage on the row at corrupt data place, then the capable proof test value with other unspoiled all data and said row on the said row recovers said corrupt data;
Said logical storage interblock data are recovered to comprise:
If when having only said corrupt data one place to damage in the third dimension group at corrupt data place, then the third dimension proof test value with other unspoiled all data and said third dimension group in the said third dimension group recovers said corrupt data.
6. data reconstruction method according to claim 5 is characterized in that, data recovery and logical storage interblock data are recovered to comprise in the said logical memory blocks:
If data recovery in the said logical memory blocks is then carried out in going or listing when having only said first corrupt data one place to damage of first corrupt data place earlier; After the recovery, when having only said second corrupt data one place to damage in the third dimension group as if second corrupt data place, then carry out said logical storage interblock data again and recover;
Perhaps
If when having only said first corrupt data one place to damage in the third dimension group at first corrupt data place, then carry out said logical storage interblock data earlier and recover; After the recovery, if data recovery in the said logical memory blocks is then carried out in going or listing when having only said second corrupt data one place to damage of second corrupt data place again.
7. data reconstruction method according to claim 5 is characterized in that,
With the said row proof test value that lists other unspoiled all data and said row said corrupt data is recovered to comprise: carry out XOR with the said row proof test value that lists other unspoiled all data and said row, recover said corrupt data;
Capable proof test value with other unspoiled all data and said row on the said row recovers to comprise to said corrupt data: the capable proof test value with other unspoiled all data and said row on the said row carries out XOR, recovers said corrupt data;
Third dimension proof test value with other unspoiled all data and said third dimension group in the said third dimension group recovers to comprise to said corrupt data: the third dimension proof test value with other unspoiled all data and said third dimension group in the said third dimension group carries out XOR, recovers said corrupt data.
8. data reconstruction method according to claim 5 is characterized in that,
All data on the logical memory blocks are carried out verification again, and the monoblock that obtains said logical memory blocks is proof test value again; If proof test value is unequal again for the monoblock proof test value of said logical memory blocks and monoblock, confirm that then damaging appears in the data in the said logical memory blocks.
9. data reconstruction method according to claim 8 is characterized in that,
Each line data to logical memory blocks carries out verification more respectively, and the row that obtains every row is proof test value again; If the row of certain row proof test value again is unequal with the row proof test value, confirm that then damaging appears in the data in this row;
Each column data to logical memory blocks carries out verification more respectively, and the row that obtain every row are proof test value again; If the row of certain row proof test value again are unequal with the row proof test value, confirm that then damage appears in the data in these row;
Intersection through corrupted data row, corrupted data row is confirmed the position of corrupt data in logical memory blocks.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102410642A CN102346693A (en) | 2010-07-30 | 2010-07-30 | Method for data storage and data recovery |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102410642A CN102346693A (en) | 2010-07-30 | 2010-07-30 | Method for data storage and data recovery |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102346693A true CN102346693A (en) | 2012-02-08 |
Family
ID=45545390
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102410642A Pending CN102346693A (en) | 2010-07-30 | 2010-07-30 | Method for data storage and data recovery |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102346693A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103886883A (en) * | 2014-03-20 | 2014-06-25 | 公安部物证鉴定中心 | Method and system for recovering lossy video monitoring data |
| CN105630425A (en) * | 2015-12-31 | 2016-06-01 | 深圳市同创国芯电子有限公司 | Data management method and device as well as terminal |
| CN108572788A (en) * | 2017-03-13 | 2018-09-25 | 广州市动景计算机科技有限公司 | Data access method, apparatus and system |
| CN108712230A (en) * | 2018-04-08 | 2018-10-26 | 罗建平 | Fault data restorative procedure |
| CN110750381A (en) * | 2019-09-12 | 2020-02-04 | 百富计算机技术（深圳）有限公司 | Error correction method and device based on NAND FLASH memory |
| CN111240597A (en) * | 2020-01-15 | 2020-06-05 | 书生星际(北京)科技有限公司 | Method, device, equipment and computer readable storage medium for storing data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1496009A (en) * | 2002-09-20 | 2004-05-12 | 西门子公司 | Method for improving performance of three-dimensional concatenated product code |
| US20040141389A1 (en) * | 2002-07-31 | 2004-07-22 | Banks David Murray | Solid state storage device and data storage method |
| US20040153961A1 (en) * | 2003-01-20 | 2004-08-05 | Samsung Electronics Co., Ltd. | Parity storing method and error block recovering method in external storage subsystem |
| CN1630203A (en) * | 2003-12-15 | 2005-06-22 | 株式会社大宇电子 | Three-dimensional error correction coding method |
| CN1770638A (en) * | 2004-11-05 | 2006-05-10 | 中国科学技术大学 | Conformation method for low-density code based on circulating three-dimensional cube gridding diagram |
-
2010
- 2010-07-30 CN CN2010102410642A patent/CN102346693A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040141389A1 (en) * | 2002-07-31 | 2004-07-22 | Banks David Murray | Solid state storage device and data storage method |
| CN1496009A (en) * | 2002-09-20 | 2004-05-12 | 西门子公司 | Method for improving performance of three-dimensional concatenated product code |
| US20040153961A1 (en) * | 2003-01-20 | 2004-08-05 | Samsung Electronics Co., Ltd. | Parity storing method and error block recovering method in external storage subsystem |
| CN1630203A (en) * | 2003-12-15 | 2005-06-22 | 株式会社大宇电子 | Three-dimensional error correction coding method |
| CN1770638A (en) * | 2004-11-05 | 2006-05-10 | 中国科学技术大学 | Conformation method for low-density code based on circulating three-dimensional cube gridding diagram |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103886883A (en) * | 2014-03-20 | 2014-06-25 | 公安部物证鉴定中心 | Method and system for recovering lossy video monitoring data |
| CN103886883B (en) * | 2014-03-20 | 2016-08-17 | 公安部物证鉴定中心 | A kind of to damaging the method and system that video monitoring data recovers |
| CN105630425A (en) * | 2015-12-31 | 2016-06-01 | 深圳市同创国芯电子有限公司 | Data management method and device as well as terminal |
| CN105630425B (en) * | 2015-12-31 | 2020-06-26 | 深圳市紫光同创电子有限公司 | Data management method, device and terminal |
| CN108572788A (en) * | 2017-03-13 | 2018-09-25 | 广州市动景计算机科技有限公司 | Data access method, apparatus and system |
| CN108712230A (en) * | 2018-04-08 | 2018-10-26 | 罗建平 | Fault data restorative procedure |
| CN110750381A (en) * | 2019-09-12 | 2020-02-04 | 百富计算机技术（深圳）有限公司 | Error correction method and device based on NAND FLASH memory |
| CN111240597A (en) * | 2020-01-15 | 2020-06-05 | 书生星际(北京)科技有限公司 | Method, device, equipment and computer readable storage medium for storing data |
| CN111240597B (en) * | 2020-01-15 | 2024-05-17 | 书生星际(北京)科技有限公司 | Method, apparatus, device and computer readable storage medium for storing data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102346693A (en) | Method for data storage and data recovery | |
| US8566673B2 (en) | Method for improving performance in RAID systems | |
| US7934120B2 (en) | Storing data redundantly | |
| US8843782B2 (en) | Method and apparatus for reconstructing redundant array of inexpensive disks, and system | |
| CN102981778B (en) | A kind of RAID array method for reconstructing and device | |
| CN107391026A (en) | Flash memory device and flash memory management method | |
| CN101923501B (en) | Disk array multi-level fault tolerance method | |
| CN101587453B (en) | Data backup processing method, data memory node apparatus and data memory apparatus | |
| CN101840360A (en) | Rapid reconstruction method and device of RAID (Redundant Array of Independent Disk) system | |
| CN103593260B (en) | The guard method of a kind of metadata and device | |
| US20130219214A1 (en) | Accelerated rebuild and zero time rebuild in raid systems | |
| CN105264482A (en) | Low cost storage for rarely read data | |
| CN103793666A (en) | Data file protecting method and system | |
| CN102226892B (en) | Disk fault tolerance processing method and device thereof | |
| CN104484131A (en) | Device and corresponding method for processing data of multi-disk servers | |
| CN109739436A (en) | RAID reconstruction method, storage medium and device | |
| CN104516679A (en) | RAID (Redundant Array Of Independent Disk) data processing method and device | |
| CN108984113A (en) | A kind of redundant array of standalone media | |
| CN105630417B (en) | A kind of RAID5 systems and in the subsequent method for continuing data of RAID5 thrashings | |
| Pâris et al. | Three-dimensional redundancy codes for archival storage | |
| CN106788455B (en) | A kind of building method of the optimal partial repairable system code based on packet | |
| CN104461373A (en) | Method and device for processing data of RAID (redundant array of independent disks) | |
| CN102681918B (en) | Data storage and backup method and device | |
| CN104156276B (en) | It is a kind of to prevent two pieces of RAID methods of disk failures | |
| CN106227627A (en) | A kind of raid is inserted into data distribution method and the system of new disk after data are recovered |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120208 |