CN104166723A - Data shredding method and device for resilient file system - Google Patents

Data shredding method and device for resilient file system Download PDF

Info

Publication number
CN104166723A
CN104166723A CN201410421920.0A CN201410421920A CN104166723A CN 104166723 A CN104166723 A CN 104166723A CN 201410421920 A CN201410421920 A CN 201410421920A CN 104166723 A CN104166723 A CN 104166723A
Authority
CN
China
Prior art keywords
file
pulverized
folder
target
mentioned
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
Application number
CN201410421920.0A
Other languages
Chinese (zh)
Inventor
沈长达
林艺滨
钱镜洁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen Meiya Pico Information Co Ltd
Original Assignee
Xiamen Meiya Pico Information Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen Meiya Pico Information Co Ltd filed Critical Xiamen Meiya Pico Information Co Ltd
Priority to CN201410421920.0A priority Critical patent/CN104166723A/en
Publication of CN104166723A publication Critical patent/CN104166723A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/17Details of further file system functions
    • G06F16/1724Details of de-fragmentation performed by the file system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10File systems; File servers
    • G06F16/16File or folder operations, e.g. details of user interfaces specifically adapted to file systems
    • G06F16/162Delete operations

Abstract

The invention provides a data shredding method and device for a resilient file system. The method includes the steps that according to the composition and structure of the resilient file system, metadata information of a target to be shredded and the positions of the metadata information in corresponding leaf node blocks are searched for in a B+ tree, and the metadata information of the target to be shredded is erased. By the adoption of the means, the metadata of a file to be shredded and the position of the file content in a storage device can be automatically located and erased, so that the data recovery hidden danger can be eliminated completely, and strong support is provided for safety management of confidential files.

Description

The data crushing method and apparatus of Resilient file system
Technical field
The present invention relates to technical field of data storage, especially, relate to a kind of data crushing method and apparatus of Resilient file system.
Background technology
Common file delet method is easy to be resumed software to recovering, and cannot meet the requirement of high classified document security.For ripe file system such as NTFS, FAT etc. under windows operating system, existing relevant technology and software can be pulverized file both at home and abroad at present.But for the up-to-date Resilient file system of Microsoft (REFS, Resilient File System), not yet there are relevant data crushing technology and software at present.
In the situation that technical documentation lacks, can only do common deletion for this novel file system of REFS to the file of REFS and file thereof.Common delet method has two drawbacks: the one, cannot remove the corresponding file record information of file, and exist the possibility that is resumed software rejuvenation; The 2nd, cannot process the residual region of file, and the residual district of file may exist the data that need to shatter, and therefore also has the possibility being resumed, and can not meet high classified document security requirement.
Summary of the invention
The invention provides a kind of data crushing method of Resilient file system, can not remove for solving prior art file record information and the residual district of the file data that REFS system deleted file is corresponding, exist the possibility of being recovered by data recovery tools, can not meet the problem of high classified document security requirement.
The present invention also provides a kind of data crushing device of Resilient file system, to ensure said method application in practice.
In order to address the above problem, the invention discloses a kind of data crushing method of Resilient file system, comprising: according to the composition structure of Resilient file system, in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof; Wipe the metadata information of target above-mentioned to be pulverized.
Preferably, described in, target to be pulverized is file; Described metadata information comprises: the chain block address that file content is corresponding; Before described metadata information step of wiping target above-mentioned to be pulverized, also comprise: wipe and treat shredding documents content in data block corresponding to above-mentioned chain block address.
Preferably, described in, target to be pulverized is file; Described metadata information comprises: folder identifier;
Before described metadata information step of wiping target above-mentioned to be pulverized, also comprise: in B+ tree, search the file data block number that includes above-mentioned folder identifier; The sub-folder comprising according to above-mentioned file data block and son file information, judge whether described file includes sub-folder or son file; If so, circulate using all son files under this file or sub-folder as new target to be pulverized, repeat above-mentioned data crushing flow process; Otherwise, wipe folder attribute, son file and/or folder information in above-mentioned file data block.
The metadata information step of wiping target above-mentioned to be pulverized preferably, also comprises before: the related command calling in Windows application interface is deleted file or folder to be pulverized; After described metadata information step of wiping target above-mentioned to be pulverized, also comprise: again in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof; Wipe the leaf node piece that is marked as free block in the delete procedure of above-mentioned file or folder.
Preferably, described metadata information also comprises: leaf node piece LeafBlockNumbers, the byte number EntrySize of metadata and the offset address EntryOffset in leaf node piece thereof; The method of the above-mentioned metadata information of wiping target above-mentioned to be pulverized is specially: in the leaf node piece that is LeafBlockNumbers at piece number, the position that is EntryOffset, write the 0x00 of EntrySize byte from piece bias internal address.
Preferably, according to the composition structure of Resilient file system, in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof, be specially: read subregion skew meta data block information, obtain master shift meta data block number and information thereof; According to master shift meta data block information, obtain the root node of B+ tree; Start to travel through B+ tree from the root node of B+ tree, comprise until find the leaf node piece that needs to be pulverized target designation; From described leaf node piece, read the metadata information of target to be pulverized and the position in this leaf node piece thereof.
According to another preferred embodiment of the present invention, a kind of data crushing device of Resilient file system is also disclosed, comprise: metadata location lookup unit, for according to the composition structure of Resilient file system, in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof; Metadata erase unit, for wiping the metadata information of target above-mentioned to be pulverized.
Preferably, described metadata information comprises: the chain block address that file content is corresponding; Described device also comprises: file content erase unit, for when described in the time pulverizing target and be file, chain block address corresponding to file content comprising according to metadata information, wipes and treats shredding documents content in data block corresponding to above-mentioned chain block address.
Preferably, described metadata information comprises: folder identifier; Described device also comprises: folder information erase unit, for searching in B+ tree the file data block number that includes above-mentioned folder identifier; The sub-folder comprising according to above-mentioned file data block and son file information, judge whether described file includes sub-folder or son file; If so, circulate using all son files under this file or sub-folder as new target to be pulverized, call described device and repeat data crushing process; Otherwise, wipe folder attribute, son file and/or folder information in above-mentioned file data block.
Preferably, described device also comprises: target delete cells to be pulverized, delete file or folder to be pulverized for calling the related command of Windows application interface; Free block erase unit, for again searching the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof in B+ tree, and wipes the leaf node piece that is marked as free block in the delete procedure of above-mentioned file or folder.
Compared with prior art, the present invention has the following advantages:
The preferred embodiment of the present invention is according to the ad hoc structure of Resilient file system (REFS), automatically location is treated position on memory storage (as disk) of the metadata of shredding documents and file content thereof and is wiped, thereby thoroughly eliminate the hidden danger that data are recovered, for the safety management of confidential document provides strong support.
In further preferred embodiment, can also do bulk erase to file, make user carry out crushing operation to single file, can also carry out crushing operation to all sub-folders in whole file and file.
Brief description of the drawings
Fig. 1 is the composition structural representation of Resilient file system;
Fig. 2 is the process flow diagram of data crushing method first embodiment of Resilient file system of the present invention;
Fig. 3 is the concrete positioning flow of target to be pulverized in the embodiment of the method shown in Fig. 2;
Fig. 4 is the process flow diagram of data crushing method second embodiment of Resilient file system of the present invention;
Fig. 5 is the structural representation of data crushing device one embodiment of Resilient file system of the present invention;
Fig. 6-1 is the recovery effects schematic diagram with R-Studio instrument after the conventional delet method deleted file of employing;
Fig. 6-2 are the recovery effects schematic diagram with R-Studio instrument after the data crushing method deleted file shown in employing Fig. 1.
Embodiment
Before the present invention is further detailed explanation with embodiment by reference to the accompanying drawings, first the structure of Resilient file system is described.
Resilient file system (REFS) is made up of volume head, POMB (subregion skew meta data block), MOMB (master shift meta data block) and B+ tree (B+ tree is for description document information, folder structure and positional information).The fundamental unit in REFS memory allocated space is piece, and each has numbering, since 0 and size be 32 sectors, MOMB, B+ tree each node be a piece.Relation between each several part as shown in Figure 1.Wherein:
Volume head is at the 0th, for relevant information such as memory sector size, volume sizes;
POMB fixed storage is in the 30th piece, for information such as the MOMB pieces of the piece at store M OMB place number and backup number;
MOMB piece is for storing the pointer information that points to B+ tree.
In REFS file system, each file has the folder identifier (DirID) of 64, this identifier value uses as the key assignments (key) in B+ tree, and wherein the DirID of root folder (being root folder key assignments RootKey) is fixed as 0x00000600.Each file including has two parts information, part information is for description document folder attribute information such as (as:) Folder Name, times, another part information is for describing son files all under this file and sub-folder information, its corresponding piece number is SubInfoBlock (in the time that son file/sub-folder quantity is more, need to take multiple buffer descriptor son file/sub-folder information).
After the file in REFS volume adopts usual manner (as calling DeleteFile function) to delete, in the parent folder of this deleted file, there is variation (but key message has also existed for describing some zone bits of file record of this deleted file information, as: filename, time, data directory), make this file record become the idle record without any pointed, there is not any variation in file content part, just corresponding data block is marked as to free block.In addition, REFS has a very important characteristic, and in the time of delete/newly-increased file, the SubInfoBlock for descriptor file/sub-folder information that parent folder is corresponding may change, and therefore residual risk may be distributed in two different places.As can be seen here, if the not operation of newly-increased file after deleted file, the crucial index information that comprises so this deleted file also exists, parent folder includes complete file content for descriptor file/sub-folder recording of information, exist or part complete by data recovery ways to recover the possibility of this deleted file, the safety of confidential document has been caused to great threat.
With reference to Fig. 2, show the flow process of data crushing method first embodiment of Resilient file system of the present invention, comprise the following steps:
Step S101: according to the composition structure of Resilient file system, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof in B+ tree;
Step S102: the metadata information of wiping target above-mentioned to be pulverized.
The present invention is by above-mentioned means, can effectively remove the attribute informations such as the size, time, position of file to be deleted, block data recovery tools and set up the means of file attribute and file content incidence relation by above-mentioned attribute information, therefore can eliminate preferably the hidden danger of part or all of recovery deleted file.
In REFS system, data are with the form storage of file, the file organization and administration of file based on tree structure, and as file and the file of target to be pulverized, it metadata information comprising is different.In the further preferred embodiment of this method embodiment, above-mentioned steps S101 can realize in the following way:
Step S101-1: read POMB block message (piece number is 30);
Step S101-2: obtain MOMB piece number and read MOMB block message from POMB piece;
Step S101-3: the B+ root vertex that obtains maintenance documentation clamping structure from MOMB piece;
Step S101-4: CurrentKey be set to the title that RootKey TargetName be set to ground floor file/file under root folder (file that for example will shatter be D: test my.doc, TargetName is now " test ");
Step S101-5: search the leaf node piece LeafBlock that CurrentKey is corresponding in the B+ of folder structure tree, and obtain corresponding file/folder information according to TargetName.These information comprise: if fileinfo, need to obtain the piece LeafBlockNumbers of piece chain that file content is corresponding, LeafBlock and file metamessage skew EntryOffset and big or small EntrySize in LeafBlock and record the value of CurrentKey; If folder information, obtain piece LeafBlockNumbers and skew EntryOffset and the big or small EntrySize of file metamessage in LeafBlock of relevant DirID information, LeafBlock.Concrete lookup method is as follows:
1), establish the root node that CurrentNode is B+ tree;
2), judge the type of CurrentNode node, root node goes to step 4 if); Intermediate node goes to step 5 if); Some continuation step 3 of leaf if);
3), in leaf node, search as key word using TargetName, thus obtaining corresponding file/folder information goes to step S101-6 and finishes search procedure;
4), in root node, search as key word using CurrentKey, thereby obtain corresponding child nodes SubNode, and CurrentNode is set to SubNode, goes to step 2);
5), in index node, search as key word using TargetName, obtain the list item that key word is less than the maximum key word place of TargetName, and the child nodes SubNode that points to of the CurrentNode list item that is set to find, go to step 2).
Step S101-6: judge that whether the current information of obtaining is the file destination/folder information that will pulverize, if so, finishes positioning flow, otherwise goes to step S101-7;
Step S101-7: be DirID by CurrentKey assignment, file/file name that TargetName assignment is lower floor; Go to step S101-5.
With reference to Fig. 4, show the flow process of data crushing method second embodiment of Resilient file system of the present invention, this preferred embodiment is for the metadata information of different targets to be pulverized (file and file), adopt different pulverizing measures, not only wipe the associated metadata information of file or folder, the descriptor of also having wiped respectively file content and file for different targets to be pulverized.This preferred embodiment specifically comprises:
Step S201: according to the composition structure of Resilient file system, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof in B+ tree;
When this preferred embodiment is specifically implemented, can be with reference to the positioning flow shown in Fig. 3.
Step S202: judge that target to be pulverized is file? if go to step S203, otherwise go to step S208;
Step S203: write 0x00 according to the file content piece chain information obtaining in corresponding piece;
Step S204: call DeleteFile function and delete file destination;
Step S205: the attribute information such as size, time of removing file;
The method that the present embodiment is removed file attribute information is specially: be LeafBlockNumbers at piece number, piece bias internal is the 0x00 that EntryOffset place writes EntrySize byte.
Step S206: again obtain the B+ tree information (specifically seeing flow process one) of folder structure, search corresponding object block according to the value that records CurrentKey;
In REFS system, call after DeleteFile or DeleteFolder function, the index information of piece changes sometimes, for further guaranteeing that metadata information is thoroughly wiped, the B+ tree of folder structure will obtain again, and further wipes and call the data block that is set to idle list item after DeleteFile or DeleteFolder.
Step S207: if the idle list item in object block piece bias internal EntryOffset place finding, past object block piece bias internal EntryOffset place writes the 0x00 of EntrySize byte.Go to step S213;
Step S208: search corresponding object block according to DirID in the B+ tree of folder structure, suppose that piece number is DirBlockNumbers;
Step S209: judge that whether file comprises son file/file, goes to step S211 if do not comprised;
Step S210: all son file/files under shredding documents;
Step S211: call DeleteFolder and delete destination folder;
Step S212: write 0x00 in the piece that is DirBlockNumbers toward piece number, go to step S205;
Step S213: finish.
For aforesaid each embodiment of the method, simple in order to describe, therefore it is all expressed as to a series of combination of actions, but those skilled in the art should know, the present invention is not subject to the restriction of described sequence of movement, because according to the present invention, some step can adopt other orders or carry out simultaneously; Secondly, those skilled in the art also should know, said method embodiment all belongs to preferred embodiment, and related action and module might not be that the present invention is necessary.
With reference to Fig. 5, show the structural representation of data crushing device one embodiment of Resilient file system of the present invention, comprising:
The metadata information of target to be pulverized and the position in corresponding leaf node piece thereof for according to the composition structure of Resilient file system, are searched in metadata location lookup unit 51 in B+ tree;
Wherein, above-mentioned metadata information also comprises: leaf node piece LeafBlockNumbers, the byte number EntrySize of metadata and the offset address EntryOffset in leaf node piece thereof; When in the time pulverizing target bit file, metadata information also comprises: the chain block address that file content is corresponding; When in the time pulverizing target bit file, metadata information also comprises: folder identifier.
In this preferred embodiment, the position of metadata can be in the following way be searched in metadata location lookup unit 51 in B+ tree: first, read subregion skew meta data block information, obtain master shift meta data block number and information thereof; According to master shift meta data block information, obtain the root node of B+ tree; Then, start to travel through B+ tree from the root node of B+ tree, comprise until find the leaf node piece that needs to be pulverized target designation; Finally, from described leaf node piece, read the metadata information of target to be pulverized and the position in this leaf node piece thereof.
Metadata erase unit 52, for wiping the metadata information of target above-mentioned to be pulverized.
In this preferred embodiment, metadata erase unit 52 can be wiped the metadata information of target above-mentioned to be pulverized in the following way: be in the leaf node piece of LeafBlockNumbers at piece number, the position that is EntryOffset from piece bias internal address, write the 0x00 of EntrySize byte.
File content erase unit 53, for when described in the time pulverizing target and be file, chain block address corresponding to file content comprising according to metadata information, wipes and treats shredding documents content in data block corresponding to above-mentioned chain block address.
Folder information erase unit 54, for searching in B+ tree the file data block number that includes above-mentioned folder identifier; The sub-folder comprising according to above-mentioned file data block and son file information, judge whether described file includes sub-folder or son file; If so, circulate using all son files under this file or sub-folder as new target to be pulverized, call described device and repeat data crushing process; Otherwise, wipe folder attribute, son file and/or folder information in above-mentioned file data block.
Target delete cells 55 to be pulverized, for wipe at file content erase unit 53 until in shredding documents perhaps folder information erase unit 54 wipe after folder attribute and sub-folder thereof, son file information, the related command calling in Windows application interface is deleted file or folder to be pulverized;
Free block erase unit 56, for again searching the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof in B+ tree, and wipes the leaf node piece that is marked as free block in the delete procedure of above-mentioned file or folder.
In order to verify the effect of data crushing device of Resilient file system of the present invention, do following contrast test:
First,, under Windows Server 2012 operating systems, create a REFS subregion; Under this subregion, a newly-built name is called the file of " test ", and in test file, creates two file Document.txt and ReadMine.txt.
Secondly, adopt shift+delete mode to carry out deletion action to Document.txt, then adopt data recovery tools (as R-Studio) to recover, its effect as in Figure 6-1; Can find out from Fig. 6-1, file Document.txt is resumed successfully.
Finally, adopt the data crushing device of Resilient file system of the present invention to carry out deletion action to Document.txt, then adopt data recovery tools (as R-Studio) to recover, its effect is as shown in Fig. 6-2; Can find out from Fig. 6-2, file Document.txt is not resumed successfully.
It should be noted that, said apparatus or system embodiment belong to preferred embodiment, and related 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 and the difference of other embodiment, between each embodiment identical similar part mutually referring to.For device embodiment of the present invention, because it is substantially similar to embodiment of the method, so description is fairly simple, relevant part is referring to the part explanation of embodiment of the method.
Data crushing method and apparatus to a kind of Resilient file system provided by the present invention above, be described in detail, applied specific case herein principle of the present invention and embodiment are set forth, the explanation of above embodiment is just for helping to understand method of the present invention and core concept thereof; , 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 meanwhile.

Claims (10)

1. a data crushing method for Resilient file system, is characterized in that, comprising:
According to the composition structure of Resilient file system, in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof;
Wipe the metadata information of target above-mentioned to be pulverized.
2. the method for claim 1, is characterized in that,
Target described to be pulverized is file;
Described metadata information comprises: the chain block address that file content is corresponding;
Before described metadata information step of wiping target above-mentioned to be pulverized, also comprise: wipe and treat shredding documents content in data block corresponding to above-mentioned chain block address.
3. the method for claim 1, is characterized in that,
Target described to be pulverized is file;
Described metadata information comprises: folder identifier;
Before described metadata information step of wiping target above-mentioned to be pulverized, also comprise:
In B+ tree, search the file data block number that includes above-mentioned folder identifier;
The sub-folder comprising according to above-mentioned file data block and son file information, judge whether described file includes sub-folder or son file;
If so, circulate using all son files under this file or sub-folder as new target to be pulverized, repeat above-mentioned data crushing flow process;
Otherwise, wipe folder attribute, son file and/or folder information in above-mentioned file data block.
4. method as claimed in claim 2 or claim 3, is characterized in that,
Before described metadata information step of wiping target above-mentioned to be pulverized, also comprise: the related command calling in Windows application interface is deleted file or folder to be pulverized;
After described metadata information step of wiping target above-mentioned to be pulverized, also comprise: again in B+ tree, search the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof; Wipe the leaf node piece that is marked as free block in the delete procedure of above-mentioned file or folder.
5. method as claimed in claim 2 or claim 3, is characterized in that,
Described metadata information also comprises: leaf node piece LeafBlockNumbers, the byte number EntrySize of metadata and the offset address EntryOffset in leaf node piece thereof;
The method of the above-mentioned metadata information of wiping target above-mentioned to be pulverized is specially: in the leaf node piece that is LeafBlockNumbers at piece number, the position that is EntryOffset, write the 0x00 of EntrySize byte from piece bias internal address.
6. the method for claim 1, is characterized in that, according to the composition structure of Resilient file system, in B+ tree, searches the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof, is specially:
Read subregion skew meta data block information, obtain master shift meta data block number and information thereof;
According to master shift meta data block information, obtain the root node of B+ tree;
Start to travel through B+ tree from the root node of B+ tree, comprise until find the leaf node piece that needs to be pulverized target designation;
From described leaf node piece, read the metadata information of target to be pulverized and the position in this leaf node piece thereof.
7. a data crushing device for Resilient file system, is characterized in that, comprising:
The metadata information of target to be pulverized and the position in corresponding leaf node piece thereof for according to the composition structure of Resilient file system, are searched in metadata location lookup unit in B+ tree;
Metadata erase unit, for wiping the metadata information of target above-mentioned to be pulverized.
8. device as claimed in claim 7, is characterized in that,
Described metadata information comprises: the chain block address that file content is corresponding;
Described device also comprises: file content erase unit, for when described in the time pulverizing target and be file, chain block address corresponding to file content comprising according to metadata information, wipes and treats shredding documents content in data block corresponding to above-mentioned chain block address.
9. device as claimed in claim 7, is characterized in that,
Described metadata information comprises: folder identifier;
Described device also comprises: folder information erase unit, for searching in B+ tree the file data block number that includes above-mentioned folder identifier; The sub-folder comprising according to above-mentioned file data block and son file information, judge whether described file includes sub-folder or son file; If so, circulate using all son files under this file or sub-folder as new target to be pulverized, call described device and repeat data crushing process; Otherwise, wipe folder attribute, son file and/or folder information in above-mentioned file data block.
10. device as claimed in claim 7, is characterized in that, described device also comprises:
Target delete cells to be pulverized, deletes file or folder to be pulverized for calling the related command of Windows application interface;
Free block erase unit, for again searching the metadata information of target to be pulverized and the position in corresponding leaf node piece thereof in B+ tree, and wipes the leaf node piece that is marked as free block in the delete procedure of above-mentioned file or folder.
CN201410421920.0A 2014-08-25 2014-08-25 Data shredding method and device for resilient file system Pending CN104166723A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410421920.0A CN104166723A (en) 2014-08-25 2014-08-25 Data shredding method and device for resilient file system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410421920.0A CN104166723A (en) 2014-08-25 2014-08-25 Data shredding method and device for resilient file system

Publications (1)

Publication Number Publication Date
CN104166723A true CN104166723A (en) 2014-11-26

Family

ID=51910536

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410421920.0A Pending CN104166723A (en) 2014-08-25 2014-08-25 Data shredding method and device for resilient file system

Country Status (1)

Country Link
CN (1) CN104166723A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102693387A (en) * 2012-06-01 2012-09-26 北京理工大学 Data wiping method for NTFS (new technology file system)
CN102722671A (en) * 2012-06-01 2012-10-10 北京理工大学 Data defense system in windows operation system
CN103164341A (en) * 2012-07-04 2013-06-19 北京安天电子设备有限公司 Method and system for fast erasing files in mass storage device

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102693387A (en) * 2012-06-01 2012-09-26 北京理工大学 Data wiping method for NTFS (new technology file system)
CN102722671A (en) * 2012-06-01 2012-10-10 北京理工大学 Data defense system in windows operation system
CN103164341A (en) * 2012-07-04 2013-06-19 北京安天电子设备有限公司 Method and system for fast erasing files in mass storage device

Similar Documents

Publication Publication Date Title
US10430398B2 (en) Data storage system having mutable objects incorporating time
CN101937377B (en) Data recovery method and device
KR100962055B1 (en) Sharing objects between computer systems
CN102236589B (en) Data protection method for managing increment file based on digital identifiers
US8639665B2 (en) Hybrid backup and restore of very large file system using metadata image backup and traditional backup
US8250033B1 (en) Replication of a data set using differential snapshots
TWI258663B (en) Writable file system snapshot with ditto address feature
US9043334B2 (en) Method and system for accessing files on a storage system
US20180089033A1 (en) Performing data backups using snapshots
CN103279532B (en) Many set elements duplicate removal also identifies the affiliated filtration system gathered and method thereof
US8578112B2 (en) Data management system and data management method
CN102779180A (en) Operation processing method of data storage system and data storage system
GB2439578A (en) Virtual file system with links between data streams
CN105718548A (en) System and method for scalable reference management in a deduplication based storage system
CN109726044A (en) Multiple files are efficiently restored from data de-duplication storage based on data block title
EP2718825A2 (en) Storage architecture for backup application
CN110888837B (en) Object storage small file merging method and device
CN104199888A (en) Data recovery method and device for resilient file system
US11010082B2 (en) Mechanisms for performing accurate space accounting for volume families
KR20090063733A (en) Method recovering data server at the applying multiple reproduce dispersion file system and metadata storage and save method thereof
CN109522283A (en) A kind of data de-duplication method and system
CN108399047A (en) A kind of flash memory file system and its data managing method
CN103744875A (en) Data rapid transferring method and system based on file system
CN105493080A (en) Method and apparatus for context aware based data de-duplication
CN104965835A (en) Method and apparatus for reading and writing files of a distributed file system

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication

Application publication date: 20141126