TIME BASED FILE SYSTEM FOR CONTINUOUS DATA PROTECTION
First Claim
1. A method comprising:
- storing a plurality of tokens corresponding to a plurality of data units written to a rewritable file system, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit; and
reverting the rewritable file system to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens.
1 Assignment
0 Petitions
Accused Products
Abstract
A plurality of tokens corresponding to a plurality of data units written to a rewritable file system is stored, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit. The rewritable file system is reverted to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens.
31 Citations
20 Claims
-
1. A method comprising:
-
storing a plurality of tokens corresponding to a plurality of data units written to a rewritable file system, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit; and reverting the rewritable file system to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system, comprising:
-
a memory; and a processor coupled to the memory, wherein the processor performs operations, the operations comprising; (i) storing a plurality of tokens corresponding to a plurality of data units written to a rewritable file system, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit; and (ii) reverting the rewritable file system to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens. - View Dependent Claims (7, 8, 9, 10)
-
-
11. An article of manufacture, wherein code is stored in the article of manufacture, and wherein the code when executed on a processor causes operations, the operations comprising:
-
storing a plurality of tokens corresponding to a plurality of data units written to a rewritable file system, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit; and reverting the rewritable file system to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens. - View Dependent Claims (12, 13, 14, 15)
-
-
16. A method for deploying computing infrastructure, comprising integrating machine-readable code into a machine, wherein the code in combination with the machine is capable of performing:
-
storing a plurality of tokens corresponding to a plurality of data units written to a rewritable file system, wherein an ordering relationship is maintained among the plurality of tokens, wherein the ordering relationship is such that a first token corresponding to a first data unit is of a lesser numerical value in comparison to a second token corresponding to a second data unit, and wherein the first data unit is written at an earlier point in time in comparison to the second data unit; and reverting the rewritable file system to an indicated point in time based on the ordering relationship that is maintained among the stored plurality of tokens. - View Dependent Claims (17, 18, 19, 20)
-
Specification