CN102955673B - RAID5 intelligence recombination method and device - Google Patents
RAID5 intelligence recombination method and device Download PDFInfo
- Publication number
- CN102955673B CN102955673B CN201110250365.6A CN201110250365A CN102955673B CN 102955673 B CN102955673 B CN 102955673B CN 201110250365 A CN201110250365 A CN 201110250365A CN 102955673 B CN102955673 B CN 102955673B
- Authority
- CN
- China
- Prior art keywords
- disk
- key
- value pair
- mft
- search
- 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.)
- Active
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a kind of RAID5 intelligence recombination method and device, described method comprises: at all MFT records with recording feature of the continuum of the first disk search, by its address sort in disk, middle address section is as standard analysis object; In 0x2C skew place extraction 32 signless integers of standard analysis object, form a key-value pair together with disk number, and the arrangement of key value ascending order; Key assignments in each key-value pair is deducted previous key assignments, and the highest difference of the frequency of occurrences is as block size; Confirm check disk, check disk is moved to diverse location and form different assembled schemes; Using partition table chain and the correct assembled scheme of MFT data manifold flow as final plan.The present invention is based on MFT and carry out regional analysis, utilize the administrative mechanism of file system, the data extracting specific region calculate RAID5 parameter, and restructuring speed is fast, and accuracy rate is high, and the assembled scheme of generation is few, and reorganization cost is low.
Description
Technical field
The present invention relates to raid-array technical field, particularly relate to a kind of 5 grades of raid-array (RAID5, Redundant Array of Independent Disk Level5) intelligent recombination methods and device.
Background technology
RAID5 restructuring is the maximum value point of date restoring industry, and mainly for the enterprises and institutions having huge storage resources, be wherein no lack of the financial industry involved the interests of the state and the people, can infer thus, the consequence that RAID5 fault causes is catastrophic often.RAID5 focuses on comprising block size, the isoparametric analysis of dish sequence.
It is rely on the experience of slip-stick artist individual and judgement to analyze that existing parameters analysis method mainly contains two kinds: one, efficiency is extremely low, be affected by human factors very large, error rate is higher, regrouping process often will expend a couple of days and even the tens of sky time not etc., and therefore, RAID5 restructuring charge is in higher level in all date restoring business, general all at ten thousand yuan even more than 100,000 yuan, considerably increase the system maintenance cost of relevant enterprises and institutions; Another kind of is exactly write software based on the algorithm of constantly restructuring+constantly checking, carry out permutation and combination analysis, but this method is when number of disks is more, too much (be that geometric index increase with number of disks), treatment effeciency is even lower than manual analytical methods for the reorganization scheme quantity produced.
Summary of the invention
Technical matters to be solved by this invention is to provide a kind of RAID5 intelligence recombination method, can solve the problem that existing treatment effeciency is not high.
Present invention also offers a kind of RAID5 intelligence reconstruction unit, to ensure said method application in practice.
In order to solve the problem, the invention discloses a kind of RAID5 intelligence recombination method, comprising: at all MFT records with recording feature of the continuum of first piece of disk search; To above-mentioned all MFT record by its address sort in disk, will be arranged in address section that middle MFT the records standard analysis object as first piece of disk, this address sections of other disks is as the standard analysis object of corresponding disk; In 0x2C skew place extraction 32 signless integers of the standard analysis object of every block disk as key assignments, form a key-value pair < key assignments together with current disk number, reel number >; By above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue; From the 2nd key-value pair, the key assignments in each key-value pair is deducted the key assignments in previous key-value pair, the highest difference of the frequency of occurrences is as block size; Check disk is confirmed according to number of disks; Based on above-mentioned orderly key-value pair queue, described check disk is moved to diverse location, form the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array; Verify that whether partition table chain and the MFT data manifold flow of above-mentioned often kind of assembled scheme be correct, the dish sequence representated by correct assembled scheme is final plan.
Preferably, the data block that described recording feature is start byte sequence is 0x46,0x49,0x4C, 0x45, size is 1024 bytes.
Preferably, search all methods with the MFT record of specific recording feature in the described continuum at first piece of disk are specially: the MFT record from the starting position search of first piece of disk with described recording feature; After searching first match point, continue from the end that current MFT records the MFT record that search has described recording feature, until described recording feature disappears.
Preferably, the condition that described recording feature disappears is: continuous 20480 bytes do not have described recording feature data block.
Preferably, describedly confirm that the method for check disk is specially according to number of disks: if RAID5 system disk quantity is odd number, then front 4 bytes of described standard analysis object be 0 disk be check disk; If RAID5 system disk quantity is even number, then for every block disk, perform following attribute list ergodic process: according to first attribute excursion variable location 10H attribute of described standard analysis object, then calculate the address of next attribute according to attribute size, until traversal attribute list; Can not be successful if locate 10H attribute in searching process or travel through attribute list, then namely this disk is check disk, terminates attribute list ergodic process.
According to another preferred embodiment of the present invention, also disclose a kind of RAID5 intelligence reconstruction unit, comprise recording feature search unit, standard analysis object generation unit, key-value pair generation unit, block size computing unit, assembled scheme generation unit and dish sequence confirmation unit, wherein: described recording feature search unit is used at all MFT records with recording feature of the continuum of first piece of disk search; Described standard analysis object generation unit is used for all MFT records of obtaining described recording feature search unit by its address sort in disk, to be arranged in address section that middle MFT records as the standard analysis object of first piece of disk, this address sections of other disks is as the standard analysis object of corresponding disk; Described key-value pair generation unit is used in 0x2C skew place extraction 32 signless integers of the standard analysis object of every block disk as key assignments, a key-value pair < key assignments is formed together with current disk number, reel number >, and, by above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue; Key assignments in each key-value pair is deducted the key assignments in previous key-value pair being used for the 2nd key-value pair of the orderly key-value pair queue generated from described key-value pair generation unit by described block size computing unit, and the highest difference of the frequency of occurrences is as block size; Described assembled scheme generation unit is used for confirming check disk according to number of disks, and, based on the orderly key-value pair queue that described key-value pair generation unit generates, described check disk is moved to diverse location, form the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array; Whether described dish sequence confirmation unit is correct for the partition table chain and MFT data manifold flow verifying often kind of assembled scheme that described assembled scheme generation unit generates, and the correct dish sequence representated by side's combination case is final plan.
Preferably, described recording feature search unit specifically comprises the first match point search subelement and continuous space search subelement, wherein: described first match point search subelement is used for the MFT record from the starting position search of first piece of disk with described recording feature, as the first match point; Described continuous space search subelement is used for continuing from the end that the MFT at described first match point place records the MFT record that search has described recording feature, till continuous 20480 bytes do not have described recording feature data block.
Preferably, described assembled scheme generation unit specifically comprises the first check disk determination subelement and the second check disk determination subelement, wherein: described first check disk determination subelement is used for when RAID5 system disk quantity is odd number, whether front 4 bytes judging the standard analysis object of every block disk are 0, if so, this disk is check disk; Described second check disk determination subelement is used for when RAID5 system disk quantity is even number, determine check disk in the following manner: for every block disk, according to first attribute excursion variable location 10H attribute of described standard analysis object, then the address of next attribute is calculated according to attribute size, until traversal attribute list; Can not be successful if locate 10H attribute in searching process or travel through attribute list, then namely this disk is check disk.
Compared with prior art, the present invention has the following advantages:
In preferred embodiment of the present invention scheme, based on master control file record sheet (MFT, Master File Table) carry out regional analysis, utilize the administrative mechanism of file system, the precise information of extraction system subregion (as NTFS subregion) specific region, directly calculates RAID5 parameter, has fundamentally abandoned prior art and has utilized experience to guess the method for attempting, restructuring speed is fast, accuracy rate is high, can reduce the cost of RAID business reorganization significantly.
Secondly, the assembled scheme quantity that the preferred embodiment of the present invention produces equals the block number of disk in RAID5 system, be far smaller than existing constantly recombinating+the constantly assembled scheme quantity exponentially changed with disk block number that produces of verification algorithm, greatly can alleviate the workload of follow-up selection final plan.Illustrate with the RAID5 of 3 pieces of disks, existing popular continuous restructuring+continuous verification algorithm is by generation 6 kinds of assembled schemes, and the assembled scheme that the preferred embodiment of the present invention produces only has 3 kinds; For the RAID5 system of 4 pieces of disks, existing continuous restructuring+constantly verification algorithm is by generation 24 kinds of assembled schemes, and the assembled scheme that preferred embodiment of the present invention scheme produces only has 4 kinds.The number of disks of RAID5 system is more, and the advantage of the present invention program is more obvious, and the omission of assembled scheme is not by the impact of data volume size.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of RAID5 of the present invention intelligence recombination method one embodiment;
Fig. 2 is the structured flowchart of RAID5 of the present invention intelligence reconstruction unit one embodiment.
Embodiment
For enabling above-mentioned purpose of the present invention, feature and advantage become apparent more, and below in conjunction with the drawings and specific embodiments, the present invention is further detailed explanation.
Embodiment of the method:
With reference to Fig. 1, show the flow process of RAID5 of the present invention intelligence recombination method one embodiment, specifically comprise the following steps:
Step S101: at all MFT records with recording feature of the continuum of first piece of disk search;
This preferred embodiment take start byte as 0x46,0x49,0x4C, 0x45, and size is fixed as the data block of 1024 bytes as recording feature.Be specially in the method for all MFT records with recording feature of continuum search: be 0x46 at first piece of disk search start byte, 0x49,0x4C, 0x45, size is fixed as the MFT record of 1024 bytes (hereinafter referred to as " recording feature "), after searching first match point, search behavior does not stop.Because MFT record is deposited continuously, a slice continuum afterwards all can have recording feature, and search procedure should stop when recording feature disappears.
With continuous 20480 bytes, this preferred embodiment does not occur that recording feature is for search end condition.Such as when every 1024 bytes in certain region all find recording feature, start suddenly all not find recording feature in continuous 20480 byte area, so namely search procedure stops.
Step S102: to above-mentioned all MFT record by its address sort in disk, will be arranged in address section that middle MFT records as standard analysis object;
The all MFT records with recording feature searched by step S101 are by its address sort in disk, and being wherein arranged in middle recording feature is standard analysis object.As, when having searched 50 recording features, then with the 25th recording feature for standard analysis object, and by this address section of other disks also referred to as standard analysis object.
Step S103: in 0x2C skew place extraction 32 signless integers of the standard analysis object of every block disk as key assignments, form a key-value pair < key assignments together with current disk number, reel number >;
0x2C skew place extraction in the recording feature as standard analysis object 32 unsigned integer variables, are included in the key of dictionary 1, and disk number are included in corresponding value; Then jump to the identical address place of second piece of disk, still at 0x2C place extraction 32 unsigned integer variables, still included in the key of dictionary 1, and disk number is included in corresponding value; By that analogy until the 0x2C skew at this address place of every block disk is all extracted 32 unsigned integer variables.
Step S104: by above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue;
Specific to this preferred embodiment, the key-value pair in dictionary 1 can be arranged according to key ascending order.
Step S105: from the 2nd key-value pair, the key assignments in each key-value pair is deducted the key assignments in previous key-value pair, the highest difference of the frequency of occurrences is as block size;
Deduct the value of its previous key element with each key element in dictionary 1, its difference is kept in list 1, and the value that in list 1, the frequency of occurrences is the highest is exactly block size.Such as, occur 64,256,128,192 in dictionary 1 key element, 512 5 values, what after ascending order arrangement, the poor frequency of occurrences of adjacent element was the highest is 64, is so generally the size of 1024 byte 1K according to a MFT record, so, the block size of this RAID5 is 64K, namely 128 sectors.
Step S106: confirm check disk according to number of disks;
From this step, start calculating dial sequence below: in step S104, arranged according to key assignments ascending order by key-value pair, after sequence, the order of its intermediate value element is exactly dish sequence to be verified.That is dish sequence is now close to correct, and just wherein still comprise a camouflage value of the verification generation of RAID5, subsequent step mainly judges which is camouflage value.
If number of disks is an odd number in RAID5, we only need judge whether front 4 bytes of the standard analysis object of which disk are 0, if being 0 is so a check block, when front disk regards as check disk;
If number of disks is an even number in RAID5, need according to first attribute excursion variable location 10H attribute in standard analysis object (being still a MFT record), then the address of next attribute is calculated according to attribute size, until traversal attribute list, can not be successful if locate 10H attribute in searching process or travel through attribute list, so search Attributes to terminate, can prove that it is a check block (because not being correct MFT record), the disk of its representative is called check disk.
Step S107: based on above-mentioned orderly key-value pair queue, described check disk is moved to diverse location, forms the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array;
After finding out check disk, owing to not knowing check disk, which position this comes on, can only go examination successively.All check disk is inserted dictionary 1 is worth in the diverse location of element at every turn, forms different assembled schemes, as: the RAID5 of one three pieces dishes can have following several scheme (P represents check disk):
P-1-2
1-P-2
1-2-P
Step S108: verify the partition table chain of above-mentioned often kind of assembled scheme and MFT data manifold flow whether correct, the dish sequence representated by correct assembled scheme is final plan.
Verify that whether the parameter such as the partition table chain of often kind of scheme, MFT data manifold flow item is correct, correct scheme is final plan
For aforesaid each embodiment of the method, simple in order to describe, therefore it is all expressed as a series of combination of actions, but those skilled in the art should know, the present invention is not by the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or perform simultaneously; Secondly, those skilled in the art also should know, said method embodiment all belongs to preferred embodiment, and involved action and module might not be that the present invention is necessary.
Device embodiment:
With reference to Fig. 2, show the structured flowchart of RAID5 of the present invention intelligence reconstruction unit one embodiment, comprise recording feature search unit 21, standard analysis object generation unit 22, key-value pair generation unit 23, block size computing unit 24, assembled scheme generation unit 25 and dish sequence confirmation unit 26, wherein:
Recording feature search unit 21: for searching for all MFT records with recording feature in the continuum of first piece of disk;
Wherein, recording feature search unit 21 specifically comprises the first match point search subelement 211 and continuous space search subelement 212, and the first match point search subelement 211 is wherein for having the MFT record of recording feature from the starting position search of first piece of disk; Continuous space search subelement 212 continues the MFT record that search has recording feature, till continuous 20480 bytes do not have described recording feature data block for the end of the MFT record obtained from the first match point search subelement 211.
Standard analysis object generation unit 22: for all MFT record of obtaining recording feature search unit 21 by its address sort in disk, will be arranged in address section that middle MFT records as standard analysis object;
Key-value pair generation unit 23: for 0x2C skew place extraction 32 signless integers of the standard analysis object at every block disk as key assignments, form a key-value pair < key assignments together with current disk number, reel number >; And, by above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue;
Block size computing unit 24: for the 2nd key-value pair of orderly key-value pair queue that generate from key-value pair generation unit 23, the key assignments in each key-value pair is deducted the key assignments in previous key-value pair, the highest difference of the frequency of occurrences is as block size;
Assembled scheme generation unit 25: for confirming check disk according to number of disks; And, based on the orderly key-value pair queue that key-value pair generation unit 23 generates, described check disk is moved to diverse location, form the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array;
Wherein, assembled scheme generation unit 25 specifically comprises the first check disk determination subelement 251 and the second check disk determination subelement 252, first check disk determination subelement 251 is for when RAID5 system disk quantity is odd number, whether front 4 bytes judging the standard analysis object of every block disk are 0, if so, this disk is check disk; Second check disk determination subelement 252 is for when RAID5 system disk quantity is even number, determine check disk in the following manner: for every block disk, according to first attribute excursion variable location 10H attribute of standard analysis object, then the address of next attribute is calculated according to attribute size, until traversal attribute list; Can not be successful if locate 10H attribute in searching process or travel through attribute list, then namely this disk is check disk.
Dish sequence confirmation unit 26: whether partition table chain and MFT data manifold flow for verifying often kind of assembled scheme that assembled scheme generation unit 25 generates be correct, and the dish sequence representated by correct assembled scheme is final plan.
It should be noted that, said apparatus embodiment belongs to preferred embodiment, and involved unit and module might not be that the present invention is necessary.
Each embodiment in this instructions all adopts the mode of going forward one by one to describe, and what each embodiment stressed is the difference with other embodiments, between each embodiment identical similar part mutually see.For device embodiment of the present invention, due to itself and embodiment of the method basic simlarity, so description is fairly simple, relevant part illustrates see the part of embodiment of the method.
Above a kind of RAID5 intelligence recombination method provided by the present invention and device are described in detail, apply specific case herein to set forth principle of the present invention and embodiment, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. a RAID5 intelligence recombination method, is characterized in that, comprising:
At all MFT records with recording feature of the continuum of first piece of disk search;
To above-mentioned all MFT record by its address sort in disk, will be arranged in address section that middle MFT the records standard analysis object as first piece of disk, this address sections of other disks is as the standard analysis object of corresponding disk;
In 0x2C skew place extraction 32 signless integers of the standard analysis object of every block disk as key assignments, form a key-value pair < key assignments together with current disk number, reel number >;
By above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue;
From the 2nd key-value pair, the key assignments in each key-value pair is deducted the key assignments in previous key-value pair, the highest difference of the frequency of occurrences is as block size;
Check disk is confirmed according to number of disks;
Based on above-mentioned orderly key-value pair queue, described check disk is moved to diverse location, form the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array;
Verify that whether partition table chain and the MFT data manifold flow of above-mentioned often kind of assembled scheme be correct, the dish sequence representated by correct assembled scheme is final plan.
2. the method for claim 1, is characterized in that, the data block that described recording feature is start byte sequence is 0x46,0x49,0x4C, 0x45, size is 1024 bytes.
3. the method for claim 1, is characterized in that, search all methods with the MFT record of specific recording feature in the described continuum at first piece of disk are specially:
There is from the starting position search of first piece of disk the MFT record of described recording feature;
After searching first match point, continue from the end that current MFT records the MFT record that search has described recording feature, until described recording feature disappears.
4. method as claimed in claim 3, is characterized in that, the condition that described recording feature disappears is: continuous 20480 bytes do not have described recording feature data block.
5. the method for claim 1, is characterized in that, the described method according to number of disks confirmation check disk is specially:
If RAID5 system disk quantity is odd number, then front 4 bytes of described standard analysis object be 0 disk be check disk;
If RAID5 system disk quantity is even number, then for every block disk, perform following attribute list ergodic process: according to first attribute excursion variable location 10H attribute of described standard analysis object, then calculate the address of next attribute according to attribute size, until traversal attribute list; Can not be successful if locate 10H attribute in searching process or travel through attribute list, then namely this disk is check disk, terminates attribute list ergodic process.
6. a RAID5 intelligence reconstruction unit, is characterized in that, comprises recording feature search unit, standard analysis object generation unit, key-value pair generation unit, block size computing unit, assembled scheme generation unit and dish sequence confirmation unit, wherein:
Described recording feature search unit is used at all MFT records with recording feature of the continuum of first piece of disk search;
Described standard analysis object generation unit is used for all MFT records of obtaining described recording feature search unit by its address sort in disk, to be arranged in address section that middle MFT records as the standard analysis object of first piece of disk, this address sections of other disks is as the standard analysis object of corresponding disk;
Described key-value pair generation unit as key assignments, forms a key-value pair < key assignments, reel number > for 0x2C skew place extraction 32 signless integers at the standard analysis object of every block disk together with current disk number; And, by above-mentioned key-value pair according to the arrangement of key assignments ascending order, generate orderly key-value pair queue;
Key assignments in each key-value pair is deducted the key assignments in previous key-value pair being used for the 2nd key-value pair of the orderly key-value pair queue generated from described key-value pair generation unit by described block size computing unit, and the highest difference of the frequency of occurrences is as block size;
Described assembled scheme generation unit is used for confirming check disk according to number of disks; And, based on the orderly key-value pair queue that described key-value pair generation unit generates, described check disk is moved to diverse location, form the individual different assembled scheme of n; Wherein n is the number of disks in RAID5 disk array;
Whether described dish sequence confirmation unit is correct for the partition table chain and MFT data manifold flow verifying often kind of assembled scheme that described assembled scheme generation unit generates, and the dish sequence representated by correct assembled scheme is final plan.
7. device as claimed in claim 6, is characterized in that, described recording feature search unit specifically comprises the first match point search subelement and continuous space search subelement, wherein:
Described first match point search subelement is used for the MFT record from the starting position search of first piece of disk with described recording feature, as the first match point;
Described continuous space search subelement is used for continuing from the end that the MFT at described first match point place records the MFT record that search has described recording feature, till continuous 20480 bytes do not have described recording feature data block.
8. device as claimed in claim 6, it is characterized in that, described assembled scheme generation unit specifically comprises the first check disk determination subelement and the second check disk determination subelement, wherein:
Described first check disk determination subelement is used for when RAID5 system disk quantity is odd number, and judge whether front 4 bytes of the standard analysis object of every block disk are 0, if so, this disk is check disk;
Described second check disk determination subelement is used for when RAID5 system disk quantity is even number, determine check disk in the following manner: for every block disk, according to first attribute excursion variable location 10H attribute of described standard analysis object, then the address of next attribute is calculated according to attribute size, until traversal attribute list; Can not be successful if locate 10H attribute in searching process or travel through attribute list, then namely this disk is check disk.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110250365.6A CN102955673B (en) | 2011-08-29 | 2011-08-29 | RAID5 intelligence recombination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110250365.6A CN102955673B (en) | 2011-08-29 | 2011-08-29 | RAID5 intelligence recombination method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102955673A CN102955673A (en) | 2013-03-06 |
| CN102955673B true CN102955673B (en) | 2015-08-12 |
Family
ID=47764519
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110250365.6A Active CN102955673B (en) | 2011-08-29 | 2011-08-29 | RAID5 intelligence recombination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102955673B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104794017B (en) * | 2015-04-27 | 2018-05-04 | 四川效率源信息安全技术股份有限公司 | A kind of data reconstruction method for odd number disk RAID5 |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1670682A (en) * | 2004-03-15 | 2005-09-21 | 华为技术有限公司 | A data reintegration method |
| CN101571820A (en) * | 2009-05-27 | 2009-11-04 | 成都市华为赛门铁克科技有限公司 | Redundancy protected method, device and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100502106B1 (en) * | 2002-10-17 | 2005-07-20 | 한국전자통신연구원 | The reorganization method in the raid striping system |
-
2011
- 2011-08-29 CN CN201110250365.6A patent/CN102955673B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1670682A (en) * | 2004-03-15 | 2005-09-21 | 华为技术有限公司 | A data reintegration method |
| CN101571820A (en) * | 2009-05-27 | 2009-11-04 | 成都市华为赛门铁克科技有限公司 | Redundancy protected method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102955673A (en) | 2013-03-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103136243B (en) | File system duplicate removal method based on cloud storage and device | |
| CN103631538B (en) | Cold and hot data identification threshold value calculation, device and system | |
| CN105631003B (en) | Support intelligent index construct, inquiry and the maintaining method of mass data classified statistic | |
| CN104731896B (en) | A kind of data processing method and system | |
| CN109710572B (en) | HBase-based file fragmentation method | |
| US20170060700A1 (en) | Systems and methods for verification of code resiliency for data storage | |
| CN102831222A (en) | Differential compression method based on data de-duplication | |
| CN107122126B (en) | Data migration method, device and system | |
| CN106897322A (en) | The access method and device of a kind of database and file system | |
| CN104636401B (en) | A kind of method and device of SCADA system data rewind | |
| CN103714086A (en) | Method and device used for generating non-relational data base module | |
| Gupta et al. | Faster as well as early measurements from big data predictive analytics model | |
| CN105095247A (en) | Symbolic data analysis method and system | |
| CN104991741B (en) | A kind of situation adaptation power network big data storage method based on key-value model | |
| WO2022120995A1 (en) | Device computing power evaluation method and system based on pow consensus mechanism | |
| CN105590245A (en) | Computer implementation method and data processing method for locating fault cause of electronic transaction | |
| CN104778123A (en) | Method and device for detecting system performance | |
| CN106897342A (en) | A kind of data verification method and equipment | |
| CN106354587A (en) | Mirror image server and method for exporting mirror image files of virtual machine | |
| CN103970844B (en) | The wiring method and device of big data, read method and device and processing system | |
| WO2019084917A1 (en) | Method and apparatus for calculating available capacity of storage system | |
| CN105447519A (en) | Model detection method based on feature selection | |
| CN102955673B (en) | RAID5 intelligence recombination method and device | |
| CN108845771A (en) | Method, system and the associated component of RAID are configured in a kind of storage system | |
| CN104123347B (en) | A kind of data applied to BOSS systems delete method and system again |
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 |