Criterion-based retention of data object versions
First Claim
1. A computer-implemented method for managing storage of data object versions, comprising:
- under the control of one or more computer systems configured with executable instructions,for a data object having a plurality of versions including a current version and one or more non-current versions, receiving a policy including a current version age parameter for the current version and a non-current timespan parameter for the one or more non-current versions, the current version age parameter specifying a first time limit for determining whether a designation of the current version is to be changed to a non-current version, the non-current timespan parameter specifying a second time limit for use in determining whether a non-current version of the one or more non-current versions is to be removed from storage;
on a condition that a first period of time elapsing from a creation time of the current version exceeds the first time limit, causing the current version to be designated as the non-current version; and
for the non-current version of the one or more non-current versions, on a condition that a second period of time elapsing from a creation time of a successor of the non-current version exceeds the second time limit, removing the non-current version from storage.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and apparatus for criterion-based retention of data object versions are disclosed. In the method and apparatus, a plurality of keys are sorted in accordance with an ordering scheme, whereby a key of the plurality of keys has an associated version of a data object and a timestamp. The key is inspected in accordance with the ordering scheme to determine based at least in part on the timestamp whether a criterion for performing an action on the associated version of the data object is satisfied. If the criterion is satisfied, a marker key is added to the plurality of keys, whereby the marker key precedes the inspected key according to the ordering scheme and indicates that the criterion is satisfied.
24 Citations
20 Claims
-
1. A computer-implemented method for managing storage of data object versions, comprising:
-
under the control of one or more computer systems configured with executable instructions, for a data object having a plurality of versions including a current version and one or more non-current versions, receiving a policy including a current version age parameter for the current version and a non-current timespan parameter for the one or more non-current versions, the current version age parameter specifying a first time limit for determining whether a designation of the current version is to be changed to a non-current version, the non-current timespan parameter specifying a second time limit for use in determining whether a non-current version of the one or more non-current versions is to be removed from storage; on a condition that a first period of time elapsing from a creation time of the current version exceeds the first time limit, causing the current version to be designated as the non-current version; and for the non-current version of the one or more non-current versions, on a condition that a second period of time elapsing from a creation time of a successor of the non-current version exceeds the second time limit, removing the non-current version from storage. - View Dependent Claims (2, 3, 4)
-
-
5. A system, comprising:
at least one computing device having executable instructions that, as a result of being executed by one or more processors, implement one or more services to; identify that a version of a data object, of a plurality of versions of the data object, is eligible for a first action to be taken, the version of the data object associated with a first key that is retained by the one or more services in accordance with a policy indicating a lifespan parameter specifying a first limit for determining a designation of the version of the data object as current; create a second key based at least in part on identifying that the version of the data object is eligible for the first action and retain the second key together with the first key, the second key associated with a timestamp; and perform, based at least in part on the timestamp and the lifespan parameter, a second action to the version of the data object. - View Dependent Claims (6, 7, 8, 9, 10, 11, 12)
-
13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by one or more processors of a computer system, cause the computer system to at least:
-
sort a plurality of keys associated with a plurality of versions of a data object in accordance with an ordering scheme, a key of the plurality of keys associated with a timestamp; determine, based at least in part on a policy indicating a first age parameter and a second age parameter, the timestamp, and the ordering scheme, for the key of the plurality of keys whether a criterion for performing one or more actions on an associated version of the data object is satisfied; and in response to determining that the criterion is satisfied, add a marker key to be stored with the plurality of keys, the marker key being located adjacent to the key according to the ordering scheme and indicating that the criterion is satisfied for performance of a deletion action to at least the associated version of the data object. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20)
-
Specification