Automatic object archiving based on user selections

An indication may be received, by a storage service, from an account, of at least a first object and a first threshold time duration, wherein the first object is to be automatically transferred from a lower-latency storage tier to a higher-latency storage tier based on object access history data and the first threshold time duration. A first determined time duration since a most recent access of the first object may be determined based on the object access history data. The first determined time duration may be compared to the first threshold time duration. It may be determined that the first determined time duration meets or exceeds the first threshold time duration. The first object may be transferred from the lower-latency storage tier to the higher-latency storage tier based on the first determined time duration meeting or exceeding the first threshold time duration.

BACKGROUND

Many customers may employ a data storage service for storing of data. Some data storages services allow data to be stored as a data storage object, referred to hereinafter as simply an object, which can refer to a smallest item of data that is referenceable by customers. Some data storage services may also allow a customer's objects to be organized into one or more buckets. In some examples, an object may be referenced using an object key, which is unique within a given bucket. Also, in some examples, two or more objects in a bucket may also share a common prefix, which is an initial portion of an object key. Additionally, in some cases, an object may also be identified using an object tag, which is a name-value pair that may be assigned to the objects, and which may also be shared by one or more other objects. In some examples, a customer may have different access patterns for different subsets of data. For example, some of a customer's objects may be accessed frequently (e.g., one or more times a day), while other objects may be accessed less frequently (e.g., on a weekly basis), while yet other objects may be accessed even less frequently (e.g., on a monthly or yearly basis).

DETAILED DESCRIPTION

Techniques for automatic object archiving based on user selections are described herein. In some examples, a storage service, such as a cloud-based storage service, may allow customers to store and retrieve objects, such as documents, photos, videos, tables, logs, etc. Additionally, in some examples, the data storage service may provide at least two storage tiers, including a lower-latency storage tier and a higher-latency storage tier. The lower-latency storage tier has a lower latency for retrieval of stored data than the higher-latency storage tier. Put another way, more time is required to retrieve data from the higher-latency storage tier than from the lower-latency storage tier. In some examples, in order to retrieve an object from the higher-latency storage tier, the object may be restored in the lower-latency storage tier (e.g., by transferring the object from the higher-latency storage tier to the lower-latency storage tier) and then accessed from the lower-latency storage tier. Additionally, in some examples, the data storage service may charge a customer for storage of data in the lower-latency storage tier and in the higher-latency storage tier, such as based on an amount of data that is stored for the customer in each tier. In some examples, there may be a higher fee charged for storing data in the lower-latency storage tier than in the higher-latency storage tier. Put another way, it may be more expensive for a customer to store the same amount of data in the lower-latency storage tier than in the higher-latency storage tier.

In some examples, the last access time of an object may be indicative of its likelihood to be used again soon in the future. For example, in some cases, when an object has been accessed recently, it may be more likely that the object will be accessed again soon in the future. By contrast, in some cases, when an object has not been accessed recently, it may be less likely that the object will be accessed again soon in the future. Thus, in some examples, when a customer has not recently accessed an object, it may be advantageous for the customer to have the object stored in the higher-latency storage tier. This may be because, when an object is unlikely to be accessed soon in the future, the cost savings provided by the higher-latency storage tier may outweigh the convenience associated with lower latency provided by the lower-latency storage tier. By contrast, in some examples, when a customer has recently accessed an object, it may be advantageous for the customer to have the object stored in the lower-latency storage tier. This may be because, when an object is likely to be accessed soon in the future, the convenience associated with lower latency provided by the lower-latency storage tier may outweigh the cost savings provided by the higher-latency storage tier.

In some examples, in order to achieve benefits such as those described above, the techniques described herein may allow a data storage service to automatically transfer data objects from the lower-latency storage tier to the higher-latency storage tier based on last access times of the objects. A last access time is a time at which an object was most recently accessed. In some examples, the data storage service may monitor the access of objects by a customer account, such as to determine the last access times for the objects. Additionally, in some examples, all of a customer's objects may initially be stored in the lower-latency storage tier. One or more of the objects may then be subsequently automatically transferred from the lower-latency storage tier to the higher-latency storage based on the last access times of the objects. Specifically, in some examples, there may be a threshold time duration associated with transferring of objects from the lower-latency storage tier to the higher-latency storage tier. In some examples, the data storage service may determine a time duration since the last access time (i.e., the most recent access) of the object. The determined time duration may then be compared to the threshold time duration. In some examples, if the determined time duration does not meet or exceed the threshold time duration, then the object may be retained in the lower-latency storage tier. By contrast, in some examples, if the determined time duration meets or exceeds the threshold time duration, then the object may be automatically transferred from the lower-latency storage tier to the higher-latency storage tier. In some examples, when a customer requests to retrieve an object that is currently being stored in the higher-latency storage tier, the object may then be transferred back to the lower-latency storage tier and then accessed from the lower-latency storage tier. Additionally, in some examples, objects having less than a threshold size may not be automatically transferred to the higher-latency storage tier.

In addition to allowing objects to be automatically archived, such as by being automatically transferred to the higher-latency storage tier, the techniques described herein may also allow a customer to control the automatic object archiving, such as based on one or more user selections. For example, in some cases, a customer may be able to control archiving at the object level, such as by indicating which objects will be automatically archived and/or which objects will not be automatically archived. Additionally, in some cases, a customer may be able to indicate a threshold time duration that is used for automatically archiving an object, for example such that the customer may select different threshold time durations for different objects. In some examples, customers may employ object prefixes to control the archiving process. For example, in some cases, a customer may provide an indication to automatically archive all objects in a bucket that share a common prefix. The customer may also provide an indication of a threshold time duration (e.g., 30 days, 60 days, etc.) for automatically archiving all objects in a bucket that share a common prefix. In yet other examples, a customer may tag objects, and the customer may provide an indication to automatically archive all objects having a given tag. The customer may also provide an indication of a threshold time duration (e.g., 30 days, 60 days, etc.) for all objects having a given tag.

An object's last access time may be determined based on an object access history included in object access history data. In some examples, the object access history may include a hot access history and a cold access history. The hot access history may be updated at a first time interval, while the cold access history may be updated at a second time interval. The first time interval may be shorter than the second time interval. In one specific example, the hot access history may be updated once a day, while the cold access history may be updated once every two weeks. Additionally, the hot access history may retain access information about the first object for a first prior time duration, while the cold access history may retain access information about the object for a second prior time duration. The first prior time duration may be shorter than the second prior time duration. In one specific example, the hot access history may retain access information for a past 30 days, while the cold access history may retain access information permanently until an object is deleted. In some examples, to determine a last access time for an object, the hot access history may be examined first, and the cold access history may then only be examined if the last access time is no longer included in the hot access history (e.g., if the last access time was more than 30 days ago). In some examples, by compiling both a hot access history and a cold access history, the data storage service may reduce an amount of access history data that is overwritten, thereby be reducing the cost of compiling and maintaining an object's access history. For example, because the cold access history retains data for a longer period than the hot access history, more data is overwritten each time that the cold access history is updated (as compared to when the hot access history is updated). However, because the cold access history is updated less frequently than the hot access history, the cost of updating the large amounts of data associated with the cold access history are reduced.

FIG.1is a diagram illustrating an example automatic object archiving system having a first example configuration that may be used in accordance with the present disclosure. In the example ofFIG.1, a data storage service stores objects101-106for an account100, such as a customer account of the data storage service. The data storage service operates lower-latency storage tier120and higher-latency storage tier130. Each of the lower-latency storage tier120and higher-latency storage tier130may include computing data storage memory components, such as any of the memory components described in detail below in following portions of this description. The lower-latency storage tier120has a lower latency for retrieval of stored data than the higher-latency storage tier130. Put another way, more time is required to retrieve data from the higher-latency storage tier130than from the lower-latency storage tier120. In some examples, in order to retrieve an object from the higher-latency storage tier130, the object may be first restored in the lower-latency storage tier120(e.g., by transferring the object from the higher-latency storage tier130to the lower-latency storage tier120) and then accessed from the lower-latency storage tier120. Additionally, in some examples, the data storage service may charge account100for storage of data in the lower-latency storage tier120and in the higher-latency storage tier130, such as based on an amount of data that is stored for the account100in each tier. In some examples, there may be a higher fee charged for storing data in the lower-latency storage tier120than in the higher-latency storage tier130. Put another way, it may be more expensive for account100to store the same amount of data in the lower-latency storage tier120than in the higher-latency storage tier130.

As shown inFIG.1, account100has provided user-indications151-153regarding objects100-106. The user-indications151-153may be issued by one or more users of account100, such as via one or more user interfaces provided by the data storage service. The user-indications151-153correspond to user selections related to automatic archiving of objects100-106. Specifically, user-indication151indicates that objects101-102are to be automatically transferred to the higher-latency storage tier130when they have not been accessed for 30 days. This means that object101will be transferred to higher-latency storage tier130when it is determined that it has been 30 days or more since object101has been accessed by account100. This also means that object102will be transferred to higher-latency storage tier130when it is determined that it has been 30 days or more since object102has been accessed by account100. Additionally, user-indication152indicates that objects103-104are to be automatically transferred to the higher-latency storage tier130when they have not been accessed for 60 days. This means that object103will be transferred to higher-latency storage tier130when it is determined that it has been 60 days or more since object103has been accessed by account100. This also means that object104will be transferred to higher-latency storage tier130when it is determined that it has been 60 days or more since object104has been accessed by account100. Furthermore, user-indication153indicates that objects103-104will not to be automatically transferred to the higher-latency storage tier130, regardless of how long it has been since their last access by account100.

It is noted that there is no requirement that the user-indications must explicitly state the storage tiers that the objects are to be automatically transferred to and/or from. For example, inFIG.1, the user-indications151and152do not specify that the objects are being automatically transferred from the lower-latency storage tier120. The data storage service may instead infer this based on context. For example, if there are only two storage tiers, then the it may be clear that the objects are to be automatically transferred from a lower-latency tier to a higher-latency tier. In other examples, even if there are more than two storage tiers, one storage tier may only be capable of transferring data to (or having data transferred from) another storage tier. Thus, there is no requirement that a user indication to transfer data from one tier to another must explicitly state which tiers the data is being transferred to and/or from. Rather, it is enough for the user to merely issue a request indicating one or more objects for transfer, and the data storage service may infer the tiers involved in the transfer based on context.

It is also noted that there is no requirement that the user-indications151-153must identify each object individually. For example, user-indication151, which relates to objects101-102, need not necessarily identify both objects101and102individually. Rather, in some examples, the user-indication151may instead refer collectively to objects101-102, such as by using a common object key prefix that may be shared by objects101-102(as shown inFIG.4), by using a common object tag that may be shared by objects101-102(as shown inFIG.5) and/or via other techniques. In some examples, objects may, by default, not be automatically archived. Thus, user-indication153is shown with dashed lines to indicate that the user may not necessarily need to create and submit user-indication153in order to not have automatic archiving performed for objects105-106.

As shown inFIG.1, user-indications151-153are received by archiving components140, which transfer objects101-106between lower-latency storage tier120and higher-latency storage tier130based on user-indications151-153and object access history data160. Object access history data160is data that indicates times at which one or more objects were most recently accessed. Each of objects101-106has an object access history (OAH)161-166, respectively. In this example, the OAH's161-166are included in the object access history data160. Each of OAH's161-166indicates a last access time (LAT) for objects101-106, respectively. The LAT is a time at which each corresponding object was most recently accessed by the account100. As used herein, the term time may include time-related measures, such as seconds, hours, days/dates, weeks, etc. While LAT's and/or other object access times may sometimes be expressed in traditional time measures, such as hours, minutes and seconds, the use of these traditional time measures is not required. In some examples, other time measures may be employed, such as dates/days, weeks, etc. For example, in some cases, a day and/or date on which an object was accessed may be considered an object access time, even if the exact hours, minutes and/or second of the access are not known or indicated. Additionally, while universal time (UT) and/or coordinated universal time (UTC), may be employed, there is no requirement that UT and/or UTC must be used, and any relative time measurements may be used. Moreover, for dates, there is no requirement that any particular calendar must be used, and any relative measure of days/dates, weeks or any other time measurement may be employed. In the example ofFIG.1, the OAH's161-166indicate numbers of days since LAT's for respective objects101-106. For example, OAH161indicates that it has been 5 days since the LAT for object101. However, there is no requirement that the OAH's161-166must refer to the LAT's in this manner. For example, in some cases, the OAH's161-166may merely list the LAT's, and the archiving components140may then determine the time duration between the current time and the LAT. For example, in some cases, if the current date was Dec. 25, 2019, and OAH161specified that the LAT for object101was Dec. 20, 2019, then the archiving components140may calculate that it has been 5 days since the LAT for object101, without requiring this to be expressly indicated in the OAH161.

In this example, each of the objects101-106is initially stored in the lower-latency storage tier120. The archiving components140may compare the duration since the last access time of each object to its respective threshold time duration for being transferred to the higher-latency storage tier130. If the determined time duration meets or exceeds the respective threshold time duration, then the archiving components140may transfer the object to the higher-latency storage tier130. By contrast, if the determined time duration does not meet or exceed the respective threshold time duration, then the archiving components140may not transfer the object to the higher-latency storage tier130. For example, as shown inFIG.1, the threshold for transferring objects101-102to the higher-latency storage tier130is 30 days (as specified in user-indication151). The duration since the last access time for object101(11 days) does not meet or exceed the 30 day threshold. Thus, object101is retained in lower-latency storage tier120. The duration since the last access time for object102(5 days) also does not meet or exceed the 30 day threshold. Thus, object102is retained in lower-latency storage tier120. Additionally, the threshold for transferring objects103-104to the higher-latency storage tier130is 60 days (as specified in user-indication152). The duration since the last access time for object103(41 days) does not meet or exceed the 60 day threshold. Thus, object103is retained in lower-latency storage tier120. The duration since the last access time for object104(35 days) also does not meet or exceed the 60 day threshold. Thus, object104is retained in lower-latency storage tier120. Furthermore, because automatic archiving is not performed on objects105-106, they are also retained in lower-latency storage tier120.

Referring now toFIG.2, an example is shown in which 20 days have passed since the example ofFIG.1. In this 20 day period, none of the objects101-106have been accessed by account100. Thus, inFIG.2, as shown in OAH's161-166, the time durations since the last access times for each of objects101-106have increased by 20 days relative toFIG.1. For example, inFIG.1, it is 11 days since last access time for object101. By contrast, in inFIG.2, it is now 31 days since the last access time for object101, which is an increase of 20 days. In the example ofFIG.2, the archiving components140may again compare the duration since the last access time of each object to its respective threshold time duration for being transferred to the higher-latency storage tier130. If the determined time duration meets or exceeds the respective threshold time duration, then the archiving components140may transfer the object to the higher-latency storage tier130. By contrast, if the determined time duration does not meet or exceed the respective threshold time duration, then the archiving components140may not transfer the object to the higher-latency storage tier130. For example, as shown inFIG.2, the threshold for transferring objects101-102to the higher-latency storage tier130is 30 days (as specified in user-indication151). In this example, the duration since the last access time for object101(31 days) exceeds the 30 day threshold. Thus, in the example ofFIG.2, object101has been transferred from lower-latency storage tier120to higher-latency storage tier130. However, the duration since the last access time for object102(25 days) does not meet or exceed the 30 day threshold. Thus, object102is retained in lower-latency storage tier120. Additionally, the threshold for transferring objects103-104to the higher-latency storage tier130is 60 days (as specified in user-indication152). In this example, the duration since the last access time for object103(61 days) exceeds the 60 day threshold. Thus, in the example ofFIG.2, object103has been transferred from lower-latency storage tier120to higher-latency storage tier130. However, the duration since the last access time for object104(55 days) does not meet or exceed the 60 day threshold. Thus, object104is retained in lower-latency storage tier120. Furthermore, because automatic archiving is not performed on objects105-106, they are once again retained in lower-latency storage tier120.

It is noted that, whileFIGS.1-2show an example system with two storage tiers (lower-latency storage tier120and higher-latency storage tier130), the techniques described herein may be employed in combination with any number of storage tiers. Additionally, customers may be able to control which objects are (and are not) automatically archived to one or more different ones of the multiple storage tiers and to set different thresholds for archiving to different storage tiers. For example, in some cases, a system could include a second higher-latency storage tier in addition to higher-latency storage tier130. This second higher-latency storage tier could have a higher latency for object retrieval than higher-latency storage tier130. The data storage service could also charge customers an even lower fee for storing data in this second higher-latency storage tier than in higher-latency storage tier130. Additionally, the account100could create a rule that objects101and103could be automatically archived into the second higher-latency storage tier, while the other objects (objects102and104-106) are not automatically archived into the second higher-latency storage tier. Moreover, the account100could create a threshold of 90 days for object101to be archived in the second higher-latency storage tier, while also setting a longer threshold (e.g., 95 days) for object103to be archived in the second higher-latency storage tier.

Thus, as shown inFIGS.1-2, the techniques described herein may allow a customer (e.g., corresponding to account100) to control the automatic object archiving, such as based on one or more user selections (e.g., user-indications151-153). For example, in some cases, a customer may be able to control archiving at the object level, such as by indicating which objects will be automatically archived and/or which objects will not be automatically archived. Additionally, in some cases, a customer may be able to indicate a threshold time duration that is used for automatically archiving an object, for example such that the customer may select different threshold time durations for different objects. In some examples, customers may employ object prefixes to control the archiving process. An object may be referenced using an object key, which is unique within a given bucket. Also, in some examples, two or more objects in a bucket may also share a common prefix, which is an initial portion of an object key.

Referring now toFIG.3, some examples of customer selections using object prefixes will now be described in detail. In the example ofFIG.3, objects101-106are included in a bucket300.FIG.3also indicates example object keys for each of objects101-106. For example, the object key for object101is photos/project1/example1.jpg. In this example objects101-102share a common prefix, which is photos/project1. Additionally, objects103-104share a common prefix, which is photos/project2. Furthermore, objects104-105share a common prefix, which is photos/project3. In the example ofFIG.3, user-indication351indicates that objects in bucket300with prefix photos/project1 are to be automatically transferred to the higher-latency storage tier130when their last access time (LAT) is greater than or equal to 30 days. Because objects101-102share the prefix photos/project1, the user-indication351will therefore apply to objects101-102. It is noted, however, that the use of the object prefix photos/project1 in the user-indication351allows the customer to provide instructions for objects101-102without requiring the user to individually list each of objects101-102. Although, in this example, only two objects (objects101-102) share the prefix photos/project1, it should be appreciated that the benefits of identifying multiple objects using an object prefix may be particularly advantageous for prefixes that include large numbers of objects, thereby saving the customer from having to individually list a large number of objects. Additionally, in the example ofFIG.3, user-indication352indicates that objects in bucket300with prefix photos/project2 are to be automatically transferred to the higher-latency storage tier130when their last access time is greater than or equal to 60 days. Because objects103-104share the prefix photos/project2, the user-indication352will therefore apply to objects103-104. It is noted, however, that the use of the object prefix photos/project2 in the user-indication352allows the customer to provide instructions for objects103-104without requiring the user to individually list each of objects103-104.

In some other examples, customers may employ object tags to control the archiving process. An object tag is a name-value pair that may be assigned to an object, and which may also be shared by one or more other objects. Referring now toFIG.4, some examples of customer selections using object tags will now be described in detail. In the example ofFIG.4, tags401-404are assigned to objects101-104, respectively. Tags401-402include the name-value pair Classification=Red, while tags403-404include the name-value pair Classification=Blue. In the example ofFIG.4, user-indication451indicates that objects with tag Classification=Red are to be automatically transferred to the higher-latency storage tier130when their last access time (LAT) is greater than or equal to 30 days. Because objects101-102share the tag Classification=Red, the user-indication451will therefore apply to objects101-102. It is noted, however, that the use of the object tag Classification=Red in the user-indication451allows the customer to provide instructions for objects101-102without requiring the user to individually list each of objects101-102. Although, in this example, only two objects (objects101-102) share the tag Classification=Red, it should be appreciated that the benefits of identifying multiple objects using an object tag may be particularly advantageous for tags that are assigned to large numbers of objects, thereby saving the customer from having to individually list a large number of objects. Additionally, In the example ofFIG.4, user-indication452indicates that objects with tag Classification=Blue are to be automatically transferred to the higher-latency storage tier130when their last access time is greater than or equal to 60 days. Because objects103-104share the tag Classification=Blue, the user-indication452will therefore apply to objects103-104. It is noted, however, that the use of the object tag Classification=Blue in the user-indication452allows the customer to provide instructions for objects103-104without requiring the user to individually list each of objects103-104. It is noted that, in some examples, the use of object tags may be particularly advantageous when a customer wishes to apply an object archiving rule to objects that are spread across multiple different prefixes, but which could be potentially identified using only a single object tag (or small number of object tags).

In some examples, objects having less than a threshold size may not be automatically transferred to the higher-latency storage tier. This is because, for smaller objects, when a customer is charged based on an amount of data being stored, the cost savings of moving an object to the higher-latency storage tier may be unlikely to justify the inconvenience associated with the added retrieval latency of the higher-latency storage tier. In some cases, this threshold size limit may apply even to groups of objects (e.g., prefixes, tags, etc.) that the customer has requested to be archived. Thus, for example, if a customer has requested archiving for a given prefix, and if one of the objects within that prefix is a small object that is smaller than the threshold size, the small object may not be archived (despite being included within a prefix for which archiving has been requested). This may save the customer from having to manually determine those objects that are smaller than the threshold and create rules that exclude those objects.

Thus, the techniques described above may allow automatic archiving of an object based on object access history data. Referring now toFIG.5, an example system for generating an object access history will now be described in detail. As shown inFIG.5, accounts500of a data storage service may access objects504that are stored by the data storage service. In this example, the accounts500may access the objects504by issuing get requests for the objects504, thereby resulting in get events502. In the example ofFIG.5, the data storage service generates get event information506related to the get events502. For example, for each event, the get event information506may include metadata, such as a time of the event, a key for the object that is accessed, and other properties of the access. In this example, the get event information may be included in a data stream508and then stored in an event information archive510. A key aggregation component512may then review events in the event information archive510for a given time period and sort the events based on object keys. The results of this aggregation may be provided to object-specific history architectures540A-N. Each of the objects504may have its own respective one of object-specific history architectures540A-N.

In the example ofFIG.5, object-specific history architecture540A is shown in detail. Other object specific history architectures540B-N are not shown in detail, but they may include similar components as shown in object-specific history architecture540A. In this example, object-specific history architecture540A generates object access history (OAH)161corresponding to object101. Specifically, the key aggregation system540may generate key-specific history updates550, which include object access history information for a given time period for object101. Although not shown inFIG.5, the key aggregation system540may generate other key-specific history updates for other objects.

As shown inFIG.5, the OAH161includes a hot access history561and a cold access history562. The hot access history561may be updated at a first time interval, while the cold access history562may be updated at a second time interval. The first time interval may be shorter than the second time interval. In one specific example, the hot access history561may be updated once a day, while the cold access history562may be updated once every two weeks. Additionally, the hot access history561may retain access information about object101for a first prior time duration, while the cold access history562may retain access information about object101for a second prior time duration. The first prior time duration may be shorter than the second prior time duration. In one specific example, the hot access history561may retain access information for a past 30 days, while the cold access history562may retain access information permanently until object101is deleted. The hot access history561may be compiled by hot view builder551, which may compile the key-specific history updates550for a given update period (e.g., 1 day) for the hot access history561. The hot view builder551may then create a new version (e.g., a new 30 day sliding window) of hot access history561by dropping information for an oldest stored update period (e.g., day 30) from the prior version and adding information for the newest update period e.g., (the most recent day) to the prior version. The cold access history562may be compiled by cold view builder552, which may compile the key-specific history updates550for a given update period (e.g., two weeks) for the cold access history562. The cold view builder552may then create a new version of cold access history562by adding information for the newest update period (e.g., the most recent two weeks) to the prior version.

In some examples, to determine a last access time for object101, the hot access history561may be examined first, and the cold access history562may then only be examined if the last access time is no longer included in the hot access history (e.g., if the last access time was more than 30 days ago). In some examples, by compiling both a hot access history561and a cold access history562, the data storage service may reduce an amount of access history data that is overwritten, thereby be reducing the cost of compiling and maintaining an object's access history. For example, because the cold access history562retains data for a longer period than the hot access history561, more data is overwritten each time that the cold access history562is updated (as compared to when the hot access history561is updated). However, because the cold access history562is updated less frequently than the hot access history561, the cost of updating the large amounts of data associated with the cold access history562are reduced.

In some examples, when account100requests access to an object that is stored in the higher-latency storage tier130, the object may be first restored in the lower-latency storage tier120(e.g., by transferring the object from the higher-latency storage tier130to the lower-latency storage tier120) and then accessed from the lower-latency storage tier120. In some cases, the account100may issue a restore request in order to cause the object to be transferred from the higher-latency storage tier130to the lower-latency storage tier120. In some examples, the account100may then be notified when the object is restored in the lower-latency storage tier120, at which point the account100may issue a get request to retrieve the object from the lower-latency storage tier120. In other examples, when an object is stored in the higher-latency storage tier130, the account100may issue a get request for the object, and the get request may cause the object to be restored in the lower-latency storage tier120and then provided to the account100. This may be advantageous by allowing the account100to access the object by issuing only a get request, as opposed to requiring the account100to first issue a restore request and then subsequently issue a get request for the object. Referring now toFIG.6, an example of a restoring of an object in the lower-latency storage tier120will now be described in detail. As shown inFIG.6, the account100issues a get request654for object101. In this example, the issuing of the get request654causes the object101to be restored in the lower-latency storage tier120by performing a return600of the object from the higher-latency storage tier130back to the lower-latency storage tier120. Upon being restored in the lower-latency storage tier120, the object101may be accessed by the account100. Additionally, in the example ofFIG.6, once the object101is accessed by the account100, the last access time for the object may be reset to 0 days, for example as shown in OAH161. It is noted that, whileFIG.6provides an example in which object101is restored in the lower-latency storage tier120and then accessed from the lower-latency storage tier120, there may be some other examples in which objects that are stored in the higher-latency storage tier130may be accessed directly from the higher-latency storage tier130(without the need to restore the objects in the lower-latency storage tier120).

Thus, in some examples, a first indication of a first subset of objects and a first threshold time duration may be received, by a storage service, from an account, wherein individual objects within the first subset of objects are to be automatically transferred from a lower-latency storage tier of the storage service to a higher-latency storage tier of the storage service based on object access history data and the first threshold time duration, wherein the account has a plurality of objects that are stored by the storage service, wherein the plurality of objects includes the first subset of objects, and wherein at least a second subset of objects of the plurality of objects is not automatically transferred to the higher-latency storage tier based on the first threshold time duration. A first determined time duration since a most recent access of a first object in the first subset of objects may be determined, based on the object access history data. The first determined time duration may be compared to the first threshold time duration. It may be determined that the first determined time duration meets or exceeds the first threshold time duration. Based on the first determined time duration meeting or exceeding the first threshold time duration, the first object may be transferred from the lower-latency storage tier to the higher-latency storage tier. In some examples, the first indication may specify an object key prefix that identifies the first subset of objects. Also, in some examples, the first indication may specify an object tag that identifies the first subset of objects.

Additionally, a second indication of the second subset of objects and a second threshold time duration may be received, by the storage service, from the account, wherein individual objects within the second subset of objects are to be automatically transferred from the lower-latency storage tier of the storage service to the higher-latency storage tier of the storage service based on the object access history data and the second threshold time duration. The second threshold time duration may be different from the first threshold time duration. A second determined time duration since a most recent access of a second object in the second subset of objects may be determined, based on the object access history data. The second determined time duration may be compared to the second threshold time duration. It may be determined that the second determined time duration meets or exceeds the second threshold time duration. Based on the second determined time duration meeting or exceeding the second threshold time duration, the second object may be transferred from the lower-latency storage tier to the higher-latency storage tier.

FIG.7is a flowchart illustrating an example automatic object archiving process that may be used in accordance with the present disclosure. The process ofFIG.7is initiated at operation710, at which an indication of at least a first object and a first threshold time duration are received, by a storage service, from a customer account, wherein the first object is to be automatically transferred from a lower-latency storage tier of the storage service to a first higher-latency storage tier of the storage service based on object access history data and the first threshold time duration. For example, as shown inFIG.1, a user-indication151is received by archiving components140of a data storage service. The user-indication151includes instructions from account100to automatically transfer objects101-102to higher-latency storage tier130when they have not been accessed for 30 days. Thus, in this example, 30 days is the first threshold time duration. As described above, there is no requirement that the indication received at operation710must explicitly state which tiers the objects are being transferred to and/or from. Rather, this may be inferred by the data storage service based on context. In some examples, the account has a plurality of objects that are stored by the storage service, and the plurality of objects may include the first object. In some examples, at least one other object of the plurality of objects may not be automatically transferred to the first higher-latency storage tier. For example, inFIG.1, user-indication153includes instructions from account100to not automatically transfer objects105-106to higher-latency storage tier130. In some examples, the indication received at operation710may specify an object key prefix that identifies a subset of objects of the plurality of objects for automatic transfer to the first higher-latency storage tier, and the first object (as well as one or more other objects) may have the specified object key prefix. Also, in some examples, the indication received at operation710may specify an object tag that identifies a subset of objects of the plurality of objects for automatic transfer to the first higher-latency storage tier, and the object tag may be assigned to the first object (as well as one or more other objects).

At operation712, a first determined time duration since a most recent access of the first object may be determined based on the object access history data. For example, as shown inFIG.2, the object access history data160may include an object access history (OAH)161for object101. The OAH161may indicate a last access time (LAT) for object101, which is a time at which the object101was most recently accessed by account100. The archiving components may calculate the first determined time duration based on a difference between a current time and the last access time. For example, inFIG.2, it has been 31 days since the most recent access of object101by account100. Thus, the first determined time duration for object101is 31 days. It is noted, however, that, in some examples, no objects having object data sizes that are less than a threshold data size may transferred from the lower-latency storage tier to the first higher-latency storage tier. For example, in some cases, the indication received at operation710may identify a subset of objects including the first object and a second object, and the second object may be less than a threshold size that prevents transfer of the second object from the lower-latency storage tier to the first higher-latency storage tier.

As described above, in some examples, a hot access history and a cold access history may be compiled and may be included in the object access history data. The hot access history may be updated at a first time interval, and the cold access history may be updated at a second time interval, and the first time interval may be shorter than the second time interval. The hot access history may retain first access information about the first object for a first prior time duration, and the cold access history may retain second access information about the first object for a second prior time duration. The first prior time duration may be shorter than the second prior time duration. The last access time for the first object may be determined based on the hot access history and/or the cold access history. For example, in some cases, to determine a last access time for the first object, the hot access history may be examined first, and the cold access history may then only be examined if the last access time is no longer included in the hot access history.

At operation714, the first determined time duration is compared to the first threshold time duration. For example, inFIG.2, the first determined time duration for object101is 31 days, which is the time duration since the last access time for object101. The first threshold time duration is associated with the first higher-latency storage tier. As shown in user-indication151, the first threshold time duration is 30 days, which is the duration of time after which objects101-102are moved to higher-latency storage tier130. Thus, for object101, the first determined time duration of 31 days is compared to the first threshold time duration of 30 days. In some examples, a selection of the first threshold time duration may be received from an account. For example, as shown inFIG.2, user-indication151, which indicates a selection of 30 days as the first threshold time duration for objects101-102, is received from account100. Additionally, in some examples, a selection of a second threshold time duration for transferring at least one other object of the plurality of objects to the first higher-latency storage tier may be received from an account. The second threshold time duration may be different from the first threshold time duration. For example, as shown inFIG.2, user-indication152, which indicates a selection of 60 days as a second threshold time duration for objects103-104, is also received from account100.

At operation716, it is determined whether the first determined time duration meets or exceeds the first threshold time duration. If the first determined time duration meets or exceeds the first threshold time duration, then it may be determined that the first determined time duration meets or exceeds the first threshold time duration. For example, as shown inFIG.2, for object101, the first determined time duration of 31 days exceeds the first threshold time duration of 30 days. If, at operation716, it is determined that the first determined time duration meet or exceeds the first threshold time duration, then the process may proceed to operation718, at which the first object is automatically transferred, based on the first determined time duration meeting or exceeding the first threshold time duration, from the lower-latency storage tier to the first higher-latency storage tier. For example, as shown inFIG.2, object101has been transferred from lower-latency storage tier120to higher-latency storage tier130.

If, on the other hand, the first determined time duration does not meet or exceed the first threshold time duration, then it may be determined that the first determined time duration does not meet or exceed the first threshold time duration. For example, as shown inFIG.2, for object102, the first determined time duration of 25 days does not meet or exceed the first threshold time duration of 30 days. If, at operation716, it is determined that the first determined time duration does not meet or exceed the first threshold time duration, then the process may proceed to operation720, at which the first object is retained, based on the first determined time duration not meeting or exceeding the first threshold time duration, in the lower-latency storage. For example, as shown inFIG.2, object102is retained in the lower-latency storage tier120.

As described above, in some examples, a different threshold may optionally be employed for automatic archiving of other objects. For example, a second indication of at least a second object and a second threshold time duration may be received, by the storage service, from the account, wherein the second object is to be automatically transferred from the lower-latency storage tier of the storage service to the first higher-latency storage tier of the storage service based on the object access history data and the second threshold time duration. The second threshold time duration may be different from the first threshold time duration. A second determined time duration since a most recent access of the second object may be determined based on the object access history data. The second determined time duration may be compared to the second threshold time duration. It may be determined that the second determined time duration meets or exceeds the second threshold time duration. Based on the second determined time duration meeting or exceeding the second threshold time duration, the second object may be transferred from the lower-latency storage tier to the second higher-latency storage tier.

As also described above, in some examples, there may be additional storage tiers, such as a second higher-latency storage tier. For example, in some cases, the first object may be transferred from the first higher-latency storage tier to a second higher-latency storage tier of the storage service when the first object has not been accessed for a second determined time duration that meets or exceeds a second threshold time duration associated with the second higher-latency storage tier. In this case, the second threshold time duration may be the same or different from the first threshold time duration. As also described above, in some examples, during a time that the first object is stored in the first higher-latency storage tier, a request may be received to get the first object. Based on the request, the first object may be transferred from the first higher-latency storage tier to the lower-latency storage tier. For example, as shown inFIG.6, object101is returned to lower-latency storage tier120based on get request654. The object101may then be accessed from the lower-latency storage tier120.

An example system for transmitting and providing data will now be described in detail. In particular,FIG.8illustrates an example computing environment in which the embodiments described herein may be implemented.FIG.8is a diagram schematically illustrating an example of a data center85that can provide computing resources to users70aand70b(which may be referred herein singularly as user70or in the plural as users70) via user computers72aand72b(which may be referred herein singularly as computer72or in the plural as computers72) via a communications network73. Data center85may be configured to provide computing resources for executing applications on a permanent or an as-needed basis. The computing resources provided by data center85may include various types of resources, such as gateway resources, load balancing resources, routing resources, networking resources, computing resources, volatile and non-volatile memory resources, content delivery resources, data processing resources, data storage resources, data communication resources and the like. Each type of computing resource may be available in a number of specific configurations. For example, data processing resources may be available as virtual machine instances that may be configured to provide various web services. In addition, combinations of resources may be made available via a network and may be configured as one or more web services. The instances may be configured to execute applications, including web services, such as application services, media services, database services, processing services, gateway services, storage services, routing services, security services, encryption services, load balancing services, application services and the like. These services may be configurable with set or custom applications and may be configurable in size, execution, cost, latency, type, duration, accessibility and in any other dimension. These web services may be configured as available infrastructure for one or more clients and can include one or more applications configured as a platform or as software for one or more clients. These web services may be made available via one or more communications protocols. These communications protocols may include, for example, hypertext transfer protocol (HTTP) or non-HTTP protocols. These communications protocols may also include, for example, more reliable transport layer protocols, such as transmission control protocol (TCP), and less reliable transport layer protocols, such as user datagram protocol (UDP). Data storage resources may include file storage devices, block storage devices and the like.

Data center85may include servers76aand76b(which may be referred herein singularly as server76or in the plural as servers76) that provide computing resources. These resources may be available as bare metal resources or as virtual machine instances78a-d (which may be referred herein singularly as virtual machine instance78or in the plural as virtual machine instances78).

Referring toFIG.8, communications network73may, for example, be a publicly accessible network of linked networks and possibly operated by various distinct parties, such as the Internet. In other embodiments, communications network73may be a private network, such as a corporate or university network that is wholly or partially inaccessible to non-privileged users. In still other embodiments, communications network73may include one or more private networks with access to and/or from the Internet.

Communication network73may provide access to computers72. User computers72may be computers utilized by users70or other customers of data center85. For instance, user computer72aor72bmay be a server, a desktop or laptop personal computer, a tablet computer, a wireless telephone, a personal digital assistant (PDA), an e-book reader, a game console, a set-top box or any other computing device capable of accessing data center85. User computer72aor72bmay connect directly to the Internet (e.g., via a cable modem or a Digital Subscriber Line (DSL)). Although only two user computers72aand72bare depicted, it should be appreciated that there may be multiple user computers.

User computers72may also be utilized to configure aspects of the computing resources provided by data center85. In this regard, data center85might provide a gateway or web interface through which aspects of its operation may be configured through the use of a web browser application program executing on user computer72. Alternately, a stand-alone application program executing on user computer72might access an application programming interface (API) exposed by data center85for performing the configuration operations. Other mechanisms for configuring the operation of various web services available at data center85might also be utilized.

Servers76shown inFIG.8may be servers configured appropriately for providing the computing resources described above and may provide computing resources for executing one or more web services and/or applications. In one embodiment, the computing resources may be virtual machine instances78. In the example of virtual machine instances, each of the servers76may be configured to execute an instance manager80aor80b(which may be referred herein singularly as instance manager80or in the plural as instance managers80) capable of executing the virtual machine instances78. The instance managers80may be a virtual machine monitor (VMM) or another type of program configured to enable the execution of virtual machine instances78on server76, for example. As discussed above, each of the virtual machine instances78may be configured to execute all or a portion of an application.

In the example data center85shown inFIG.8, a router71may be utilized to interconnect the servers76aand76b. Router71may also be connected to gateway74, which is connected to communications network73. Router71may be connected to one or more load balancers, and alone or in combination may manage communications within networks in data center85, for example, by forwarding packets or other data communications as appropriate based on characteristics of such communications (e.g., header information including source and/or destination addresses, protocol identifiers, size, processing requirements, etc.) and/or the characteristics of the private network (e.g., routes based on network topology, etc.). It will be appreciated that, for the sake of simplicity, various aspects of the computing systems and other devices of this example are illustrated without showing certain conventional details. Additional computing systems and other devices may be interconnected in other embodiments and may be interconnected in different ways.

In the example data center85shown inFIG.8, a server manager75is also employed to at least in part direct various communications to, from and/or between servers76aand76b. WhileFIG.8depicts router71positioned between gateway74and server manager75, this is merely an exemplary configuration. In some cases, for example, server manager75may be positioned between gateway74and router71. Server manager75may, in some cases, examine portions of incoming communications from user computers72to determine one or more appropriate servers76to receive and/or process the incoming communications. Server manager75may determine appropriate servers to receive and/or process the incoming communications based on factors such as an identity, location or other attributes associated with user computers72, a nature of a task with which the communications are associated, a priority of a task with which the communications are associated, a duration of a task with which the communications are associated, a size and/or estimated resource usage of a task with which the communications are associated and many other factors. Server manager75may, for example, collect or otherwise have access to state information and other information associated with various tasks in order to, for example, assist in managing communications and other operations associated with such tasks.

It should also be appreciated that data center85described inFIG.8is merely illustrative and that other implementations might be utilized. It should also be appreciated that a server, gateway or other computing device may comprise any combination of hardware or software that can interact and perform the described types of functionality, including without limitation: desktop or other computers, database servers, network storage devices and other network devices, PDAs, tablets, cellphones, wireless phones, pagers, electronic organizers, Internet appliances, television-based systems (e.g., using set top boxes and/or personal/digital video recorders) and various other consumer products that include appropriate communication capabilities.

In at least some embodiments, a server that implements a portion or all of one or more of the technologies described herein may include a computer system that includes or is configured to access one or more computer-accessible media.FIG.9depicts a computer system that includes or is configured to access one or more computer-accessible media. In the illustrated embodiment, computing device15includes one or more processors10a,10band/or10n(which may be referred herein singularly as “a processor10” or in the plural as “the processors10”) coupled to a system memory20via an input/output (I/O) interface30. Computing device15further includes a network interface40coupled to I/O interface30.

In various embodiments, computing device15may be a uniprocessor system including one processor10or a multiprocessor system including several processors10(e.g., two, four, eight or another suitable number). Processors10may be any suitable processors capable of executing instructions. For example, in various embodiments, processors10may be embedded processors implementing any of a variety of instruction set architectures (ISAs), such as the x86, PowerPC, SPARC or MIPS ISAs or any other suitable ISA. In multiprocessor systems, each of processors10may commonly, but not necessarily, implement the same ISA.

System memory20may be configured to store instructions and data accessible by processor(s)10. In various embodiments, system memory20may be implemented using any suitable memory technology, such as static random access memory (SRAM), synchronous dynamic RAM (SDRAM), nonvolatile/Flash®-type memory or any other type of memory. In the illustrated embodiment, program instructions and data implementing one or more desired functions, such as those methods, techniques and data described above, are shown stored within system memory20as code25and data26.

In one embodiment, I/O interface30may be configured to coordinate I/O traffic between processor10, system memory20and any peripherals in the device, including network interface40or other peripheral interfaces. In some embodiments, I/O interface30may perform any necessary protocol, timing or other data transformations to convert data signals from one component (e.g., system memory20) into a format suitable for use by another component (e.g., processor10). In some embodiments, I/O interface30may include support for devices attached through various types of peripheral buses, such as a variant of the Peripheral Component Interconnect (PCI) bus standard or the Universal Serial Bus (USB) standard, for example. In some embodiments, the function of I/O interface30may be split into two or more separate components, such as a north bridge and a south bridge, for example. Also, in some embodiments some or all of the functionality of I/O interface30, such as an interface to system memory20, may be incorporated directly into processor10.

Network interface40may be configured to allow data to be exchanged between computing device15and other device or devices60attached to a network or networks50, such as other computer systems or devices, for example. In various embodiments, network interface40may support communication via any suitable wired or wireless general data networks, such as types of Ethernet networks, for example. Additionally, network interface40may support communication via telecommunications/telephony networks, such as analog voice networks or digital fiber communications networks, via storage area networks such as Fibre Channel SANs (storage area networks) or via any other suitable type of network and/or protocol.

In some embodiments, system memory20may be one embodiment of a computer-accessible medium configured to store program instructions and data as described above for implementing embodiments of the corresponding methods and apparatus. However, in other embodiments, program instructions and/or data may be received, sent or stored upon different types of computer-accessible media. Generally speaking, a computer-accessible medium may include non-transitory storage media or memory media, such as magnetic or optical media—e.g., disk or DVD/CD coupled to computing device15via I/O interface30. A non-transitory computer-accessible storage medium may also include any volatile or non-volatile media, such as RAM (e.g., SDRAM, DDR SDRAM, RDRAM, SRAM, etc.), ROM (read only memory) etc., that may be included in some embodiments of computing device15as system memory20or another type of memory. Further, a computer-accessible medium may include transmission media or signals such as electrical, electromagnetic or digital signals conveyed via a communication medium, such as a network and/or a wireless link, such as those that may be implemented via network interface40.

A compute node, which may be referred to also as a computing node, may be implemented on a wide variety of computing environments, such as commodity-hardware computers, virtual machines, web services, computing clusters and computing appliances. Any of these computing devices or environments may, for convenience, be described as compute nodes.

As set forth above, content may be provided by a content provider to one or more clients. The term content, as used herein, refers to any presentable information, and the term content item, as used herein, refers to any collection of any such presentable information. A content provider may, for example, provide one or more content providing services for providing content to clients. The content providing services may reside on one or more servers. The content providing services may be scalable to meet the demands of one or more customers and may increase or decrease in capability based on the number and type of incoming client requests. Portions of content providing services may also be migrated to be placed in positions of reduced latency with requesting clients. For example, the content provider may determine an “edge” of a system or network associated with content providing services that is physically and/or logically closest to a particular client. The content provider may then, for example, “spin-up,” migrate resources or otherwise employ components associated with the determined edge for interacting with the particular client. Such an edge determination process may, in some cases, provide an efficient technique for identifying and employing components that are well suited to interact with a particular client, and may, in some embodiments, reduce the latency for communications between a content provider and one or more clients.

In addition, certain methods or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments.