Time based file system for continuous data protection

• US 7,979,401 B2
• Filed: 06/26/2008
• Issued: 07/12/2011
• Est. Priority Date: 06/26/2008
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Beglin, Thomas William, Day, Kenneth Fairclough III, Boyd, Kenneth Wayne, Dewey, Douglas William
• Primary Examiner(s): Le; Uyen T.
• Application Number:
  US12/147,384
• Publication Number:
  US 20090327357A1
• Time in Patent Office: 1,111 Days
• Field of Search: None
• US Class Current: 707/674
• CPC Class Codes: G06F 11/1435 using file system or storage system metadata
• CPC Class Codes: G06F 16/1873 Versioning file systems, temporal file systems, e.g. file system supporting different historic versions of files

Abstract

Tokens corresponding to data units written to a rewritable file system are stored, where an ordering relationship is maintained among the tokens, where 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 where 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 tokens.

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, wherein the storing of the plurality of tokens further comprises;

writing, in a first set of data structures, timestamps in association with the plurality of data units, wherein a timestamp indicates a chronological time at which a data unit is written; and

generating, and writing in a second set of data structures, the plurality of tokens with numerical values in a monotonically increasing order as the plurality of data units are written into the rewritable file system; 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 via the numerical values written in the monotonically increasing order in the second set of data structures.

2. The method of claim 1, wherein the reverting of the rewritable file system is unaffected by operating system clock changes as the ordering relationship maintained among the plurality of tokens and not time indicated in the timestamps is applied to revert the rewritable file system to the indicated point in time.

3. The method of claim 1, wherein the reverting further comprises:

receiving a request to revert the rewritable file system to the indicated point in time, wherein the indicated point in time is provided by a user;

determining which token has a highest numerical value at the indicated point in time based on the timestamps written in association with the plurality of data units; and

using only data units with corresponding tokens having a numerical value less than or equal to the numerical value of the determined token to recreate directories and files at the indicated point in time.

4. The method of claim 1, wherein the storing and reverting are performed by a file system driver, and wherein the file system driver comprises:

a token generator application that generates the plurality of tokens having monotonically increasing numerical values;

a data unit writing application that writes the plurality of data units to a storage device and associates the plurality of data units with the plurality of tokens;

a token to user time association application that determines which token has a highest numerical value corresponding to the indicated point in time; and

a file system reversion application that reverts the rewritable file system to the indicated point in time by using a selected set of tokens of the plurality of tokens.

5. The method of claim 1, wherein a device on which the rewritable file system is implemented is selected from one of a write once read many storage device and a rewritable storage device, wherein no data that has been written can be physically deleted from the write once read many storage device, wherein data that has been written can be physically deleted from the rewritable storage device, and wherein continuous data protection is provided by allowing the rewritable file system to be reverted to any prior point in time.

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, wherein the storing of the plurality of tokens further comprises;

writing, in a first set of data structures, timestamps in association with the plurality of data units, wherein a timestamp indicates a chronological time at which a data unit is written; and

generating, and writing in a second set of data structures, the plurality of tokens with numerical values in a monotonically increasing order as the plurality of data units are written into the rewritable file system; 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 via the numerical values written in the monotonically increasing order in the second set of data structures.

7. The system of claim 6, wherein the reverting of the rewritable file system is unaffected by operating system clock changes as the ordering relationship maintained among the plurality of tokens and not time indicated in the timestamps is applied to revert the rewritable file system to the indicated point in time.

8. The system of claim 6, wherein the reverting further comprises:

receiving a request to revert the rewritable file system to the indicated point in time, wherein the indicated point in time is provided by a user;

determining which token has a highest numerical value at the indicated point in time based on the timestamps written in association with the plurality of data units; and

using only data units with corresponding tokens having a numerical value less than or equal to the numerical value of the determined token to recreate directories and files at the indicated point in time.

9. The system of claim 6, wherein the storing and reverting are performed by a file system driver, and wherein the file system driver comprises:

a token generator application that generates the plurality of tokens having monotonically increasing numerical values;

a data unit writing application that writes the plurality of data units to a storage device and associates the plurality of data units with the plurality of tokens;

a token to user time association application that determines which token has a highest numerical value corresponding to the indicated point in time; and

a file system reversion application that reverts the rewritable file system to the indicated point in time by using a selected set of tokens of the plurality of tokens.

10. The system of claim 6, wherein a device on which the rewritable file system is implemented is selected from one of a write once read many storage device and a rewritable storage device, wherein no data that has been written can be physically deleted from the write once read many storage device, wherein data that has been written can be physically deleted from the rewritable storage device, and wherein continuous data protection is provided by allowing the rewritable file system to be reverted to any prior point in time.

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, wherein the storing of the plurality of tokens further comprises;

writing, in a first set of data structures, timestamps in association with the plurality of data units, wherein a timestamp indicates a chronological time at which a data unit is written; and

generating, and writing in a second set of data structures, the plurality of tokens with numerical values in a monotonically increasing order as the plurality of data units are written into the rewritable file system; 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 via the numerical values written in the monotonically increasing order in the second set of data structures.

12. The article of manufacture of claim 11, wherein the reverting of the rewritable file system is unaffected by operating system clock changes as the ordering relationship maintained among the plurality of tokens and not time indicated in the timestamps is applied to revert the rewritable file system to the indicated point in time.

13. The article of manufacture of claim 11, wherein the reverting further comprises:

receiving a request to revert the rewritable file system to the indicated point in time, wherein the indicated point in time is provided by a user;

determining which token has a highest numerical value at the indicated point in time based on the timestamps written in association with the plurality of data units; and

using only data units with corresponding tokens having a numerical value less than or equal to the numerical value of the determined token to recreate directories and files at the indicated point in time.

14. The article of manufacture of claim 11, wherein the storing and reverting are performed by a file system driver, and wherein the file system driver comprises:

a token generator application that generates the plurality of tokens having monotonically increasing numerical values;

a data unit writing application that writes the plurality of data units to a storage device and associates the plurality of data units with the plurality of tokens;

a token to user time association application that determines which token has a highest numerical value corresponding to the indicated point in time; and

a file system reversion application that reverts the rewritable file system to the indicated point in time by using a selected set of tokens of the plurality of tokens.

15. The article of manufacture of claim 11, wherein a device on which the rewritable file system is implemented is selected from one of a write once read many storage device and a rewritable storage device, wherein no data that has been written can be physically deleted from the write once read many storage device, wherein data that has been written can be physically deleted from the rewritable storage device, and wherein continuous data protection is provided by allowing the rewritable file system to be reverted to any prior point in time.

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, wherein the storing of the plurality of tokens further comprises;

writing, in a first set of data structures, timestamps in association with the plurality of data units, wherein a timestamp indicates a chronological time at which a data unit is written; and

generating, and writing in a second set of data structures, the plurality of tokens with numerical values in a monotonically increasing order as the plurality of data units are written into the rewritable file system; 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 via the numerical values written in the monotonically increasing order in the second set of data structures.

17. The method for deploying computing infrastructure of claim 16, wherein the reverting of the rewritable file system is unaffected by operating system clock changes as the ordering relationship maintained among the plurality of tokens and not time indicated in the timestamps is applied to revert the rewritable file system to the indicated point in time.

18. The method for deploying computing infrastructure of claim 16, wherein the reverting further comprises:

receiving a request to revert the rewritable file system to the indicated point in time, wherein the indicated point in time is provided by a user;

determining which token has a highest numerical value at the indicated point in time based on the timestamps written in association with the plurality of data units; and

using only data units with corresponding tokens having a numerical value less than or equal to the numerical value of the determined token to recreate directories and files at the indicated point in time.

19. The method for deploying computing infrastructure of claim 16, wherein the storing and reverting are performed by a file system driver, and wherein the file system driver comprises:

a token generator application that generates the plurality of tokens having monotonically increasing numerical values;

a data unit writing application that writes the plurality of data units to a storage device and associates the plurality of data units with the plurality of tokens;

a token to user time association application that determines which token has a highest numerical value corresponding to the indicated point in time; and

a file system reversion application that reverts the rewritable file system to the indicated point in time by using a selected set of tokens of the plurality of tokens.

20. The method for deploying computing infrastructure of claim 16, wherein a device on which the rewritable file system is implemented is selected from one of a write once read many storage device and a rewritable storage device, wherein no data that has been written can be physically deleted from the write once read many storage device, wherein data that has been written can be physically deleted from the rewritable storage device, and wherein continuous data protection is provided by allowing the rewritable file system to be reverted to any prior point in time.