METHODS AND SYSTEMS FOR DATA RECOVERY
First Claim
Patent Images
1. A method for recovering deleted files in a data store, comprising:
- identifying candidate blocks of a data store;
determining for each of the candidate blocks a probability that the candidate block contains a directory entry; and
extracting directory entry metadata for candidate blocks that have a determined probability that is greater than a predetermined probability threshold.
12 Assignments
0 Petitions
Accused Products
Abstract
To recover deleted files in a data store, candidate blocks of the data store may be identified and, for each of the candidate blocks, a probability that the candidate block contains a directory entry may be determined. Directory entry metadata for candidate blocks that have a determined probability that is greater than a predetermined probability threshold may then be extracted.
69 Citations
31 Claims
-
1. A method for recovering deleted files in a data store, comprising:
-
identifying candidate blocks of a data store; determining for each of the candidate blocks a probability that the candidate block contains a directory entry; and extracting directory entry metadata for candidate blocks that have a determined probability that is greater than a predetermined probability threshold. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A system for recovering deleted files in a data store, comprising:
-
a candidate block identification module for identifying candidate blocks of a data store; a determination module for determining for each of the candidate blocks a probability that the candidate block contains a directory entry; and an extraction module for extracting directory entry metadata for candidate blocks that have a determined probability that is greater than a predetermined probability threshold. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
-
-
23. A method for determining whether candidate blocks of a data store are likely to contain a directory entry, comprising:
-
identifying candidate blocks of a data store; assigning initial probabilities to candidate blocks by testing portions of each block to determine whether such portion meets criteria associated with a directory entry; assigning a final probability that is higher than the initial probability to each candidate block in a contiguous group of candidate blocks that each have high initial probabilities; reporting candidate blocks with a final probability greater than a predetermined threshold as a list of blocks that are likely to contain a directory entry. - View Dependent Claims (24, 25, 26, 27, 28, 29, 30, 31)
-
Specification