Managing data object versions in a storage service
First Claim
1. A computer-implemented method for managing data object versions, comprising:
- ordering a plurality of keys according to an ordering scheme, a key of the plurality of keys being a sequence of symbols and being associated with a version of a data object retained by a storage service, the ordering scheme permitting ordering the key of the plurality of keys in accordance with a creation time of the version of the data object;
providing an interface to cause retention of a plurality of versions of the data object;
scanning the ordered plurality of keys to identify, for the key of the plurality of keys, whether the associated version of the data object meets one or more criteria for removal from the storage service, the one or more criteria specifying a time period that the associated version of the data object is to be retained by the storage service; and
on a condition that the version of the data object meets the one or more criteria, processing the plurality of keys in a reverse order according to the ordering scheme and removing the key of the plurality of keys in accordance with the reverse order if the version of the data object that is associated with the key of the plurality of keys is found to meet the one or more criteria.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and apparatus for managing keys pertaining to data objects are disclosed. In the method and apparatus, a plurality of keys that are associated with a plurality of data objects are retained, whereby the plurality of keys are capable of being listed in accordance with an ordering scheme. The ordering scheme is used to inspect the plurality of keys to determine whether a data object associated with a key of the plurality of keys satisfies a criterion. One or more actions are taken on the key or associated data object based at least in part on determining that the criterion is satisfied, whereby an order of taking the one or more actions is a reverse of an order by which the key is listed in accordance with the ordering scheme.
24 Citations
20 Claims
-
1. A computer-implemented method for managing data object versions, comprising:
ordering a plurality of keys according to an ordering scheme, a key of the plurality of keys being a sequence of symbols and being associated with a version of a data object retained by a storage service, the ordering scheme permitting ordering the key of the plurality of keys in accordance with a creation time of the version of the data object; providing an interface to cause retention of a plurality of versions of the data object; scanning the ordered plurality of keys to identify, for the key of the plurality of keys, whether the associated version of the data object meets one or more criteria for removal from the storage service, the one or more criteria specifying a time period that the associated version of the data object is to be retained by the storage service; and on a condition that the version of the data object meets the one or more criteria, processing the plurality of keys in a reverse order according to the ordering scheme and removing the key of the plurality of keys in accordance with the reverse order if the version of the data object that is associated with the key of the plurality of keys is found to meet the one or more criteria. - View Dependent Claims (2, 3, 4)
-
5. A system, comprising:
at least one computing device that implements one or more services that; retain a plurality of keys, a key of the plurality of keys being associated with a data object; provide an interface to cause retention of a plurality of versions of the data object; utilize an ordering scheme to process the plurality of keys in a forward order to the ordering scheme to determine whether the data object associated with the key of the plurality of keys satisfies a criterion; and take one or more actions on the key of the plurality of keys or the associated data object based at least in part on determining that the criterion is satisfied, an order of taking the one or more actions is a reverse of an order by which the key is listed in accordance with the ordering scheme, by at least visiting each key of the plurality of keys in the reverse order. - View Dependent Claims (6, 7, 8, 9, 10, 11, 12)
-
13. A non-transitory computer-readable storage medium storing 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 in accordance with an ordering scheme, a key of the plurality of keys pertaining to a data object of a plurality of data objects; provide an interface to cause retention of a plurality of versions of the data object; identify a plurality of subsets of the plurality of keys;
a subset of the plurality of subsets including a group of keys of the plurality of keys, the plurality of subsets comprising an order that is in accordance with the ordering scheme;cause the order of sorting the plurality of keys to be reversed by at least; reversing the order of the plurality of subsets; and for each subset of the plurality of the subsets, reversing an order of the group of keys of the subset; and visit the plurality of keys in the reverse order to take one or more actions on a key, of the plurality of keys. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20)
-
Specification