CN104794025A - Method for quick verification on storage device - Google Patents
Method for quick verification on storage device Download PDFInfo
- Publication number
- CN104794025A CN104794025A CN201510204245.0A CN201510204245A CN104794025A CN 104794025 A CN104794025 A CN 104794025A CN 201510204245 A CN201510204245 A CN 201510204245A CN 104794025 A CN104794025 A CN 104794025A
- Authority
- CN
- China
- Prior art keywords
- file
- information
- directory entry
- data structure
- directory
- 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
Abstract
The invention discloses a method for quick verification on a storage device, and belongs to the field of electronic-discovery data safeguarding. The method comprises the steps that 1 all parameter information in the storage device including a file system and a specific data structure is analyzed; 2 judgment on whether the data structure of the storage device is the specific data structure or not is conducted according to the analyzed parameter information in step 1, if the data structure of the storage device is the specific data structure, then the step 3 is conducted, and if the data structure of the storage device is not the specific data structure, then the step 5 is conducted. The method for quick verification on the storage device has the advantages that a segmentation test algorithm is adopted, when a disk with a specific data structure is safeguarded, values and deviation positions of a master boot record, a partition boot record, a root directory, all subdirectory entries and other all metadata file areas of the storage device are only need to be extracted, thereby the storage device data are safeguarded to large extent, the validity and the reliability of the electronic evidence are guaranteed, and the purpose of quick verification on the storage device is achieved.
Description
Technical field
The invention belongs to electronic evidence-collecting data and save field from damage, be specifically related to a kind of method of rapid verification memory device.
Background technology
Electronic evidence-collecting is also called computer forensics or computor method medical science, is to study how to the science and technology that the evidence of computing machine, network intrusions and crime obtains, saves from damage, analyzes and shows.Along with the widespread use of computing machine and universal, utilize cyber-net or be becoming increasingly rampant using cyber-net as the crime of tool target, electronic evidence-collecting and can resist in this kind of digitizing process of commission of crime and plays critical effect in strike.
Saving from damage of electronic data, that follow common evidence saves rule from damage.The singularity of electronic data makes its security method have singularity, is mainly reflected in notarization and saves from damage.The instantaneity of electronic data and fugitiveness propose higher requirement to the electronic data program of saving from damage of notarizing.Along with further developing of electronic technology, the notarization of future electronic data is saved from damage can based on construction network notarization center, develops a set of traditional evidence that is different from and to notarize the separate procedure of saving from damage.
At home, mostly the research and practice of relevant computer evidence obtaining aspect is to utilize more external conventional forensic tools, the flow process of computer forensics also lacks comparatively deep research, the preservation system of evidence and method are also perfect not to the utmost, thus cause the reliability of Computer forensics, validity, confidence level are not high.
The full name of MD5 algorithm is Message-Digest algorithm 5, is the widely used hash algorithm of a kind of computer safety field for generation of digital signature.Its effect allows Large Copacity information be ' compressed ' into a kind of secret form before with digital signature software signature private key, is transformed into the string of 128 by " byte serial " of a random length by an irreversible character string mapping algorithm.It is after carrying out initialization process to input information that MD5 calculates ratio juris, grouping is carried out to process input information with 512, each group is divided into again the subgroup of 16 32, after a series of conversion process, export four 32 groupings, then the hashed value of 128 will be generated after these four 32 packet concatenation.The integrality using MD5 algorithm to detect data can effectively prevent information to be tampered, forge and palm off, to ensure that the data of memory device are complete consistent with and data are effectively reliable censorship.
But, in actual applications, along with the huge expansion of company information and data, the problem that the method comes out is the reduction of efficiency and the complexity of data management, but the importance of preserve data has irreplaceable importance, need badly and method is done suitable Revision and supplement, to be more applicable to application needs.
Technical term used herein illustrates:
LBA:Logical Block Address (logical block addresses), is a kind of simple addressing mode, carrys out positioning logic block from 0 open numbering, and the LBA value of the first block is the LBA value of the 0, second block is 1, by that analogy.
Bunch number: bunch numbering, usually from 1 open numbering, bunch be windows system minimum data memory management unit.
Fat shows: file allocation table (fat) is that file management system is used for the form of each file allocation disk physical space, and log file leaves the position of disk in.
Directory entry: most important data structure, wherein deposits about the filename of sub-directory or file, attribute, starting cluster number, the information such as time value and content size.
BPB: the abbreviation being BIOS parameter block, it is arranged in the boot sector of memory device.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, provide a kind of method of rapid verification memory device, effectively can solve Large Volume Data and carry out MD5 and verify the problems such as the efficiency of saving from damage is too low, complex management.
For overcoming the above problems, the technical solution used in the present invention is as follows: a kind of method of rapid verification memory device, comprises the following steps:
S1. resolve each parameter information of memory device, comprise file system, specific data structure;
The parameter information of S2. resolving according to S1 judges whether the data structure of memory device is specific data structure, if it is skips to S3, otherwise skips to S5;
S3. extract the value of parameters in specific data structure, and record its deviation post;
S4. S6 is skipped to after the specific data structure extracted being reconfigured according to the order in memory device;
S5. without special construction then adopt totally byte-by-byte verify after skip to S6;
S6. the file after the new file after reconfiguring S4 or S5 check carries out MD5 verification;
S7. preserve the MD5 value that verification produces, and preserve memory device position corresponding to each parameter simultaneously.
As preferably, the concrete grammar of S1 for reading front 3 sectors in memory device, and resolves the data stored in sector.
As preferably, the specific data structure described in S1 comprises specific file system structure and specific monitor video structure.
As preferably, described specific file system structure has: fat12, fat16, fat32, ntfs, ext2, ext3, ext4, xfs, jfs, hfs and hfs+.
As preferably, described specific monitor video structure has: Haikang, large China, Chinese nation, sharp photopic vision news, Supreme Being look the monitor video data layout of treasured, wave-particle, WFS2/3/4, blue interspace, intelligence neck and the use of Long Shian manufacturer.
As preferably, when described specific file system structure is fat32, then in fat32 structure, extract the Main Boot Record of memory device, partition boot record, fat table 1, fat table 2, the value of root directory, all sub-directory item and deviation post.
As preferably, as the promising ntfs of described specific file system structure, then in ntfs structure, extract Main Boot Record, partition boot record, meta data file, the value of all mtf list items and deviation post.
As preferably, S3 is specifically further comprising the steps of:
S311. from the root directory list item of file system, current file clip directory place bunch number information is read;
S312. after jumping to this bunch number, directory entry information all under reading this bunch number one by one;
Whether the filename S313. contrasted in directory entry is consistent with the filename of the file that will open, resolve the file attribute information in directory entry, and mate with the file that current mouse is chosen, if do not mate, then skip to next directory entry information of S312 continuation reading to mate, otherwise skip to S314;
S314. after the match is successful, read directory entry details, obtain file storage location and document size information;
S315. read the use record of record this file storage location corresponding in fat table, and obtain its LBA information;
S316. upgrade the file access time in directory entry or modification time information, and write back.
As preferably, S3 is specifically further comprising the steps of:
S321., when memory device writing in files, the information at the root directory place bunch number storing writing in files or file is first obtained;
S322. judge that whether this directory entry is occupied, if do not have occupied, write new data;
S323. judge whether byte is normal labeled, only have the first byte when directory entry to be 0xE5 or 0x00, represent that this directory entry does not use, can data be write; If so, then S3211 is skipped to; If not, then S324 is skipped to;
S324. next directory entry is skipped to;
S325. directory entry number in compute cluster, judges whether this directory entry exceeds the catalogue item number of every bunch; If so, then S326 is skipped to; If not, then S322 is skipped to;
S326. read current cluster content, verify the state record information about this bunch in fat table;
S327. end mark, judges that whether current directory item is at a bunch tail, if so, then skips to S329; If not, S328 is skipped to;
S328. the content of end mark is assigned to current cluster number, continues the content reading this directory entry, skip to S321;
S329. verify and upgrade the status information recording this bunch in fat table;
S3210. the position of next free cluster is read;
S3211. read the content of next free cluster, skip to S323;
S3212. build the directory entry information of file or folder, and write;
S3213. bunch number state that in fat table, this file or folder uses is upgraded;
S3214. by corresponding for file content write bunch number;
S3215. judge whether file writes, and if so, then skips to S3219; If not, then S3216 is skipped to;
S3216. obtain current cluster number, by the lower cluster positional information of current cluster, prepare to continue write data;
S3217. the positional information of next free cluster in fat table is read;
S3218. the content information of free cluster in fat table is read;
S3219., after completing write, fat table and backup information thereof is upgraded;
S3220. successful writing in files or file.
The invention has the beneficial effects as follows: the present invention adopts segmentation check algorithm, value and the deviation post in the Main Boot Record of extraction memory device, partition boot record, root directory, all sub-directory items and other all meta data file region is only needed when saving the disk having specific data structure from damage, therefore storage device data is saved from damage largely, ensure the validity and reliability of electronic evidence, and the object of rapid verification memory device can have been reached.
Accompanying drawing explanation
Fig. 1 is the general flow chart of rapid verification memory device;
Fig. 2 is the detailed construction logical diagram of fat32 subregion;
Fig. 3 is the process flow diagram of file reading or file;
Fig. 4 is the process flow diagram of writing in files or file.
Embodiment
For making object of the present invention, technical scheme and advantage clearly understand, to develop simultaneously embodiment referring to accompanying drawing, the present invention is described in further details.
A method for rapid verification memory device, as shown in Figure 1, comprises the following steps:
S1. resolve each parameter information of memory device, comprise file system, specific data structure;
The parameter information of S2. resolving according to S1 judges whether the data structure of memory device is specific data structure, if it is skips to S3, otherwise skips to S5;
S3. extract the value of parameters in specific data structure, and record its deviation post;
S4. S6 is skipped to after the specific data structure extracted being reconfigured according to the order in memory device;
S5. without special construction then adopt totally byte-by-byte verify after skip to S6, this step is prior art;
S6. the file after the new file after reconfiguring S4 or S5 check carries out MD5 verification, and this step is prior art;
S7. preserve the MD5 value that verification produces, and preserve memory device position corresponding to each parameter simultaneously, this value can as the reference point verified next time, so that whether verification equipment information is by falsification.
The current specific data structure that can mate has:
File system structure: fat12, fat16, fat32, ntfs, ext2, ext3, ext4, xfs, jfs, hfs, hfs+;
Monitor video structure: Haikang, large China, Chinese nation, sharp photopic vision news, Supreme Being look the monitor video data layout of treasured, wave-particle, WFS2/3/4, blue interspace, intelligence neck, the use of imperial Shi An Deng50Yu Jia manufacturer;
Embodiment 1:
Here describe in detail for fat32, be illustrated in figure 2 the detailed construction logical diagram of fat32 subregion, by fat table and directory entry, the All Files stored is managed, reading or writing in files all can cause the renewal of fat table or directory entry information each time, so only need to extract the Main Boot Record of memory device, partition boot record, fat table 1, fat table 2, the value of root directory, all sub-directory item and deviation post in fat32 structure, Fig. 3 and Fig. 4 detail display process of file reading and writing in files.
Embodiment 2:
In like manner, in ntfs structure, writing in files or file reading also can cause the renewal of the multinomial mft list item in structure each time, equally can by the value of extraction Main Boot Record, partition boot record, meta data file, all mft list items and deviation post.
The detailed process of file reading and writing in files, as shown in Figure 3 and Figure 4:
1 file reading or file
The reading of file or folder can change the attribute information of file or folder, thus changes the data of memory device, detailed in Example 3;
2 writing in files or file
The write of file or folder can change the attribute information of file or folder equally, thus changes the data of memory device, detailed in Example 4.
Embodiment 3, as shown in Figure 3:
11 current directories bunch number
Current file clip directory place bunch number information is read from the root directory list item of file system;
12 each directory entries
After jumping to this bunch number, directory entry information all under reading this bunch number one by one;
Whether the filename in 13 contrast directory entries is consistent with the filename of the file that will open
Resolve the file attribute information in directory entry, and mate with the file that current mouse is chosen, if do not mate, then skip to 12 continuation and read next directory entry information and mate, until the match is successful, otherwise skip to 14;
14 read directory entry information
After the match is successful, read directory entry details, obtain the information such as file storage location and file size;
15 obtain that fat list files store bunch number and LBA value
Read the use record of record this file storage location corresponding in fat table, and obtain its LBA information;
16 upgrade directory information
The information such as the file access time in renewal directory entry or modification time, and write back.
Embodiment 4, as shown in Figure 4:
21 read current root catalogues bunch number
When memory device writing in files, first obtain the information at the root directory place bunch number storing writing in files or file;
22 read the content under current directories bunch
Judge that whether this directory entry is occupied, to judge whether to write new data in this position;
23 judge whether byte is normal labeled
Only have the first byte when directory entry to be 0xE5 (E5H) or 0x00 (00H), represent that this directory entry does not use, can data be write; If so, then 211 are skipped to; If not, then 24 are skipped to;
24 skip to next directory entry;
Directory entry number in 25 compute clusters
Judge whether this directory entry exceeds the catalogue item number of every bunch; If so, then 26 are skipped to; If not, then 22 are skipped to;
26 read current cluster content
Verify the state record information about this bunch in FAT table;
27 end marks
Judge that whether current directory item is at a bunch tail, if so, then skips to 29; If not, 28 are skipped to;
The content of end mark is assigned to current cluster number by 28
Continue the content reading this directory entry, skip to 21;
29 upgrade this tufted state
Verify and upgrade the status information recording this bunch in FAT table;
The position of 210 next free cluster of reading;
The content of 211 next free cluster of reading, skips to 23;
The directory entry information of 212 structure file or folders, and write;
213 upgrade bunch number state that in fat table, this file or folder uses;
214 by corresponding for file content write bunch number;
215 judge whether file writes, and if so, then skips to 219; If not, then 216 are skipped to;
216 obtain current cluster number, by the lower cluster positional information of current cluster, prepare to continue write data;
The positional information of next free cluster in 217 reading fat tables;
The content information of free cluster in 218 reading fat tables;
219 complete write after, upgrade fat table and backup information;
220 successful writing in files or files.
Those of ordinary skill in the art will appreciate that, embodiment described here is to help reader understanding's implementation method of the present invention, should be understood to that protection scope of the present invention is not limited to so special statement and embodiment.Those of ordinary skill in the art can make various other various concrete distortion and combination of not departing from essence of the present invention according to these technology enlightenment disclosed by the invention, and these distortion and combination are still in protection scope of the present invention.
Claims (9)
1. a method for rapid verification memory device, is characterized in that,
S1. resolve each parameter information of memory device, comprise file system, specific data structure;
The parameter information of S2. resolving according to S1 judges whether the data structure of memory device is specific data structure, if it is skips to S3, otherwise skips to S5;
S3. extract the value of parameters in specific data structure, and record its deviation post;
S4. S6 is skipped to after the specific data structure extracted being reconfigured according to the order in memory device;
S5. without special construction then adopt totally byte-by-byte verify after skip to S6;
S6. the file after the new file after reconfiguring S4 or S5 check carries out MD5 verification;
S7. preserve the MD5 value that verification produces, and preserve memory device position corresponding to each parameter simultaneously.
2. method according to claim 1, is characterized in that, the concrete grammar of S1 for reading front 3 sectors in memory device, and resolves the data stored in sector.
3. method according to claim 1 and 2, is characterized in that, the specific data structure described in S1 comprises specific file system structure and specific monitor video structure.
4. method according to claim 3, is characterized in that, described specific file system structure has: fat12, fat16, fat32, ntfs, ext2, ext3, ext4, xfs, jfs, hfs and hfs+.
5. method according to claim 3, it is characterized in that, described specific monitor video structure has: Haikang, large China, Chinese nation, sharp photopic vision news, Supreme Being look the monitor video data layout of treasured, wave-particle, WFS2/3/4, blue interspace, intelligence neck and the use of Long Shian manufacturer.
6. method according to claim 4, it is characterized in that, when described specific file system structure is fat32, then in fat32 structure, extract the Main Boot Record of memory device, partition boot record, fat table 1, fat table 2, the value of root directory, all sub-directory item and deviation post.
7. method according to claim 5, is characterized in that, as the promising ntfs of described specific file system structure, then in ntfs structure, extracts Main Boot Record, partition boot record, meta data file, the value of all MTF list items and deviation post.
8. method according to claim 1, is characterized in that, S3 is specifically further comprising the steps of:
S311. from the root directory list item of file system, current file clip directory place bunch number information is read;
S312. after jumping to this bunch number, directory entry information all under reading this bunch number one by one;
Whether the filename S313. contrasted in directory entry is consistent with the filename of the file that will open, resolve the file attribute information in directory entry, and mate with the file that current mouse is chosen, if do not mate, then skip to next directory entry information of S312 continuation reading to mate, otherwise skip to S314;
S314. after the match is successful, read directory entry details, obtain file storage location and document size information;
S315. read the use record of record this file storage location corresponding in fat table, and obtain its LBA information;
S316. upgrade the file access time in directory entry or modification time information, and write back.
9. method according to claim 1, is characterized in that, S3 is specifically further comprising the steps of:
S321., when memory device writing in files, the information at the root directory place bunch number storing writing in files or file is first obtained;
S322. judge that whether this directory entry is occupied, if do not have occupied, write new data;
S323. judge whether byte is normal labeled, only have the first byte when directory entry to be 0xE5 or 0x00, represent that this directory entry does not use, can data be write; If so, then S3211 is skipped to; If not, then S324 is skipped to;
S324. next directory entry is skipped to;
S325. directory entry number in compute cluster, judges whether this directory entry exceeds the catalogue item number of every bunch; If so, then S326 is skipped to; If not, then S322 is skipped to;
S326. read current cluster content, verify the state record information about this bunch in fat table;
S327. end mark, judges that whether current directory item is at a bunch tail, if so, then skips to S329; If not, S328 is skipped to;
S328. the content of end mark is assigned to current cluster number, continues the content reading this directory entry, skip to S321;
S329. verify and upgrade the status information recording this bunch in fat table;
S3210. the position of next free cluster is read;
S3211. read the content of next free cluster, skip to S323;
S3212. build the directory entry information of file or folder, and write;
S3213. bunch number state that in fat table, this file or folder uses is upgraded;
S3214. by corresponding for file content write bunch number;
S3215. judge whether file writes, and if so, then skips to S3219; If not, then S3216 is skipped to;
S3216. obtain current cluster number, by the lower cluster positional information of current cluster, prepare to continue write data;
S3217. the positional information of next free cluster in fat table is read;
S3218. the content information of free cluster in fat table is read;
S3219., after completing write, fat table and backup information thereof is upgraded;
S3220. successful writing in files or file.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510204245.0A CN104794025B (en) | 2015-04-27 | 2015-04-27 | The method of rapid verification storage device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510204245.0A CN104794025B (en) | 2015-04-27 | 2015-04-27 | The method of rapid verification storage device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104794025A true CN104794025A (en) | 2015-07-22 |
| CN104794025B CN104794025B (en) | 2017-11-10 |
Family
ID=53558835
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510204245.0A Active CN104794025B (en) | 2015-04-27 | 2015-04-27 | The method of rapid verification storage device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104794025B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105956172A (en) * | 2016-05-23 | 2016-09-21 | 深圳市硅格半导体股份有限公司 | Log information storage method and apparatus |
| CN106095619A (en) * | 2016-06-08 | 2016-11-09 | 杭州华三通信技术有限公司 | A kind of virtual machine backup method and device |
| CN107797881A (en) * | 2017-12-06 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of data coherence tester method, apparatus, equipment and storage medium |
| CN108763371A (en) * | 2018-05-17 | 2018-11-06 | 上海威固信息技术股份有限公司 | A kind of Exfat file system power-off protection and file detect restoration methods |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5696897A (en) * | 1994-01-31 | 1997-12-09 | Sun Microsystems, Inc. | Method and apparatus for a multi-layer system quiescent suspend and resume operation |
| US20020144058A1 (en) * | 2001-02-05 | 2002-10-03 | Burger Eric William | Network-based disk redundancy storage system and method |
| CN1979436A (en) * | 2005-12-02 | 2007-06-13 | 联想(北京)有限公司 | Data back-up system and method and system load-bearing apparatus |
| CN103138871A (en) * | 2011-11-23 | 2013-06-05 | 毕书清 | Server data processing system and method of application program of mobile communication system |
| US20130232325A1 (en) * | 2012-03-04 | 2013-09-05 | Samsung Electronics Co., Ltd. | Electronic device to restore mbr, method thereof, and computer-readable medium |
-
2015
- 2015-04-27 CN CN201510204245.0A patent/CN104794025B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5696897A (en) * | 1994-01-31 | 1997-12-09 | Sun Microsystems, Inc. | Method and apparatus for a multi-layer system quiescent suspend and resume operation |
| US20020144058A1 (en) * | 2001-02-05 | 2002-10-03 | Burger Eric William | Network-based disk redundancy storage system and method |
| CN1979436A (en) * | 2005-12-02 | 2007-06-13 | 联想(北京)有限公司 | Data back-up system and method and system load-bearing apparatus |
| CN103138871A (en) * | 2011-11-23 | 2013-06-05 | 毕书清 | Server data processing system and method of application program of mobile communication system |
| US20130232325A1 (en) * | 2012-03-04 | 2013-09-05 | Samsung Electronics Co., Ltd. | Electronic device to restore mbr, method thereof, and computer-readable medium |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105956172A (en) * | 2016-05-23 | 2016-09-21 | 深圳市硅格半导体股份有限公司 | Log information storage method and apparatus |
| CN105956172B (en) * | 2016-05-23 | 2019-08-13 | 深圳市硅格半导体有限公司 | The storage method and device of log information |
| CN106095619A (en) * | 2016-06-08 | 2016-11-09 | 杭州华三通信技术有限公司 | A kind of virtual machine backup method and device |
| CN107797881A (en) * | 2017-12-06 | 2018-03-13 | 郑州云海信息技术有限公司 | A kind of data coherence tester method, apparatus, equipment and storage medium |
| CN108763371A (en) * | 2018-05-17 | 2018-11-06 | 上海威固信息技术股份有限公司 | A kind of Exfat file system power-off protection and file detect restoration methods |
| CN108763371B (en) * | 2018-05-17 | 2021-06-18 | 上海威固信息技术股份有限公司 | Exfat file system power-off protection and file detection recovery method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104794025B (en) | 2017-11-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101464900B (en) | Light file hiding method in NTFS file system | |
| CN107391306B (en) | Heterogeneous database backup file recovery method | |
| US9424136B1 (en) | Systems and methods for creating optimized synthetic backup images | |
| CN105069048A (en) | Small file storage method, query method and device | |
| US8606759B2 (en) | Apparatus, system and method for recovering meta data using fragmentary information | |
| WO2014121102A2 (en) | Methods and systems for storing and retrieving data | |
| CN102375695B (en) | A kind of access method of disk and computer system | |
| JP2012531675A5 (en) | ||
| CN104794025A (en) | Method for quick verification on storage device | |
| CN103617277A (en) | Method for restoring data table content deleted mistakenly | |
| JP2005166042A (en) | Data restoring method for ext2 file system, and recording medium recorded with its program | |
| CN101980203A (en) | Embedded file system for high-definition media | |
| CN112052121B (en) | Hard disk data recovery method and system | |
| CN112115002B (en) | Method and device for recovering file from damaged or untrusted mechanical hard disk | |
| CN102567472B (en) | Built-in database based high-efficient data deleting and restoring method | |
| CN104050014A (en) | Efficient storage management method based on virtualization platform | |
| CN100386737C (en) | Data recovery technique based on packet structure | |
| CN112800007B (en) | Directory entry expansion method and system suitable for FAT32 file system | |
| CN102722450A (en) | Storage method for redundancy deletion block device based on location-sensitive hash | |
| CN104156669A (en) | Computer information evidence obtaining system | |
| US8151053B2 (en) | Hierarchical storage control apparatus, hierarchical storage control system, hierarchical storage control method, and program for controlling storage apparatus having hierarchical structure | |
| CN104199909A (en) | Method for recovering NTFS advanced encryption file in VMware scene | |
| JP6271581B2 (en) | Virtual tape library system | |
| TWI461904B (en) | Recovery method and device for linux using fat file system | |
| KR100987320B1 (en) | Data processing apparatus and Data procssing method, using FAT file system capable of fast file recovery |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 641000 Sichuan province Neijiang City Songshan Road No. 183 Applicant after: SICHUAN XLY INFORMATION SAFETY TECHNOLOGY CO., LTD. Address before: 641000 Sichuan province Neijiang City Songshan Road No. 183 Applicant before: Sichuan SalvationData Information Safety Technology Co., Ltd. |
|
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Liang Xiaoning Inventor after: Xu Chaoming Inventor after: Zhu Xinghai Inventor before: Liang Xiaoning |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |