Patents by Inventor PRAVEEN KUMAR GATTU
PRAVEEN KUMAR GATTU has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11947510Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.Type: GrantFiled: March 10, 2023Date of Patent: April 2, 2024Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 11899595Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.Type: GrantFiled: September 2, 2022Date of Patent: February 13, 2024Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Publication number: 20230281181Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.Type: ApplicationFiled: March 10, 2023Publication date: September 7, 2023Applicant: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Publication number: 20230092106Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.Type: ApplicationFiled: September 2, 2022Publication date: March 23, 2023Applicant: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 11604781Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.Type: GrantFiled: September 17, 2021Date of Patent: March 14, 2023Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 11531658Abstract: 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.Type: GrantFiled: December 9, 2019Date of Patent: December 20, 2022Assignee: Amazon Technologies, Inc.Inventors: Praveen Kumar Gattu, Aykud Gonen, Jonathan Jorge Nadal, Abhilasha Seth, Joseph Thomas Selman
-
Patent number: 11436163Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.Type: GrantFiled: January 10, 2020Date of Patent: September 6, 2022Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Publication number: 20220075767Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.Type: ApplicationFiled: September 17, 2021Publication date: March 10, 2022Applicant: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 11232106Abstract: Windowed queries with event-based open times are described for use in data analytics for streaming data. A window semantic may be used to define windowed queries of an analytics application that, when executed against an incoming data stream, open a window at a time when a first event associated with a grouping key is received by a windowed query. The window remains open for a predefined duration specified in the windowed query, and query results may be generated based on any events associated with the grouping key that are received while the window remains open. After a lapse of the predefined duration, the window closes, and the query results may be output in association with the window.Type: GrantFiled: March 23, 2018Date of Patent: January 25, 2022Assignee: Amazon Technologies, Inc.Inventors: Praveen Kumar Gattu, Nagesh V. Honnalli, Gaurav D. Ghare, Christopher James Bradfield, Ryan Nienhuis
-
Patent number: 11126605Abstract: A distributed storage system may store data object instances in persistent storage and may store keymap information for those data object instances in a distributed hash table on multiple computing nodes. Each data object instance may include a composite key containing a user key. The keymap information for each data object instance may map the user key to a locator and the locator to the data object instance. A request to store or retrieve keymap information for a data object instance may be routed to a particular computing node based on a consistent hashing scheme in which a hash function is applied to a portion of the composite key of the data object instance. Thus, related entries may be clustered on the same computing nodes. The portion of the key to which the hash function is applied may include a pre-determined number of bits or be identified using a delimiter.Type: GrantFiled: March 15, 2019Date of Patent: September 21, 2021Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Publication number: 20210081383Abstract: Methods and apparatus for lifecycle support for storage objects are disclosed. A storage medium stores program instructions that when executed on a processor implement a storage lifecycle manager of a multi-tenant storage service. The lifecycle manager determines a lifecycle policy to be implemented for a storage object. The policy indicates lifecycle transitions of the object, including a transition from a first service level to a second service level. The lifecycle manager initiates modification operations corresponding to the storage object's data in accordance with the lifecycle policy, and verifies that the modification operations succeeded. The lifecycle manager provides, in response to a query, an indication of a current service level of the storage object.Type: ApplicationFiled: November 25, 2020Publication date: March 18, 2021Applicant: Amazon Technologies, Inc.Inventors: Jeffrey Michael Barber, Praveen Kumar Gattu, Derek Ernest Denny-Brown, II, Christopher Henning Elving, Carl Yates Perry
-
Patent number: 10853337Abstract: Methods and apparatus for lifecycle support for storage objects are disclosed. A storage medium stores program instructions that when executed on a processor implement a storage lifecycle manager of a multi-tenant storage service. The lifecycle manager determines a lifecycle policy to be implemented for a storage object. The policy indicates lifecycle transitions of the object, including a transition from a first service level to a second service level. The first service level and the second service level may each specify a maximum number of versions of the storage object. The lifecycle manager initiates modification operations corresponding to the storage object's data in accordance with the lifecycle policy, and verifies that the modification operations succeeded. The lifecycle manager provides, in response to a query, an indication of a current service level of the storage object.Type: GrantFiled: May 22, 2017Date of Patent: December 1, 2020Assignee: Amazon Technologies, Inc.Inventors: Jeffrey Michael Barber, Praveen Kumar Gattu, Derek Ernest Denny-Brown, II, Christopher Henning Elving, Carl Yates Perry
-
Publication number: 20200228574Abstract: A customer of a resource provider environment can apply policies at the data object level that will live with a data object during its lifecycle, even as the object moves across trusted boundaries. A customer can classify data, causing tags and/or predicates to be applied to the corresponding data object. Each tag corresponds to a policy, with predicates relating to various actions that can be performed on the data. A chain of custody is maintained for each data object, such that any changes to the object, tags, or policies for the data can be determined, as may be required for various audit processes. The support of such policies also enables the resource provider environment to function as an intermediary, whereby a third party can receive the data along with the tags, policies, and chain of custody as long as the environment trusts the third party to receive the data object.Type: ApplicationFiled: March 31, 2020Publication date: July 16, 2020Inventors: Carl Wesley Summers, Jonathan Jorge Nadal, Praveen Kumar Gattu, Syed Omair Zafar Gillani
-
Publication number: 20200151114Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.Type: ApplicationFiled: January 10, 2020Publication date: May 14, 2020Applicant: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 10645120Abstract: A customer of a resource provider environment can apply policies at the data object level that will live with a data object during its lifecycle, even as the object moves across trusted boundaries. A customer can classify data, causing tags and/or predicates to be applied to the corresponding data object. Each tag corresponds to a policy, with predicates relating to various actions that can be performed on the data. A chain of custody is maintained for each data object, such that any changes to the object, tags, or policies for the data can be determined, as may be required for various audit processes. The support of such policies also enables the resource provider environment to function as an intermediary, whereby a third party can receive the data along with the tags, policies, and chain of custody as long as the environment trusts the third party to receive the data object.Type: GrantFiled: September 24, 2015Date of Patent: May 5, 2020Assignee: AMAZON TECHNOLOGIES, INC.Inventors: Carl Wesley Summers, Jonathan Jorge Nadal, Praveen Kumar Gattu, Syed Omair Zafar Gillani
-
Patent number: 10642654Abstract: Methods and apparatus for a pipelined architecture for storage lifecycles are disclosed. A method includes identifying, during a transition candidate discovery iteration, storage objects of a multi-tenant service for which respective lifecycle transitions are to be scheduled, including a particular storage object identified as being a candidate for a particular lifecycle transition. The method includes generating transition job objects, each job comprising respective indications of one or more of the storage objects identified during the discovery iteration. The method includes assigning, during a transition execution iteration, resources to initiate storage operations for the particular lifecycle transition, and initiating, using the assigned resources, storage operations for the particular lifecycle transition.Type: GrantFiled: August 7, 2017Date of Patent: May 5, 2020Assignee: Amazon Technologies, inc.Inventors: Jeffrey Michael Barber, Derek Ernest Denny-Brown, II, Carl Yates Perry, Christopher Henning Elving, Praveen Kumar Gattu
-
Publication number: 20200110733Abstract: 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.Type: ApplicationFiled: December 9, 2019Publication date: April 9, 2020Inventors: Praveen Kumar Gattu, Aykud Gonen, Jonathan Jorge Nadal, Abhilasha Seth, Joseph Thomas Selman
-
Patent number: 10534726Abstract: Systems and methods for providing object versioning in a storage system may support the logical deletion of stored objects. In response to a delete operation specifying both a user key and a version identifier, the storage system may permanently delete the specified version of an object having the specified key. In response to a delete operation specifying a user key, but not a version identifier, the storage system may create a delete marker object that does not contain object data, and may generate a new version identifier for the delete marker. The delete marker may be stored as the latest object version of the user key, and may be addressable in the storage system using a composite key comprising the user key and the new version identifier. Subsequent attempts to retrieve the user key without specifying a version identifier may return an error, although the object was not actually deleted.Type: GrantFiled: May 14, 2018Date of Patent: January 14, 2020Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II
-
Patent number: 10528536Abstract: 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.Type: GrantFiled: May 19, 2014Date of Patent: January 7, 2020Assignee: Amazon Technologies, Inc.Inventors: Praveen Kumar Gattu, Aykud Gonen, Jonathan Jorge Nadal, Abhilasha Seth, Huan Sun, Derek Ernest Denny-Brown, II
-
Patent number: 10528537Abstract: A distributed storage system may store data object instances in persistent storage and may cache keymap information for those data object instances. The system may cache a latest symbolic key entry for some user keys of the data object instances. When a request is made for the latest version of stored data object instances having a specified user key, the latest version may be determined dependent on whether a latest symbolic key entry exists for the specified user key, and keymap information for the latest version may be returned. When storing keymap information, a flag may be set to indicate that a corresponding latest symbolic key entry should be updated. The system may delete a latest symbolic key entry for a particular user key from the cache in response to determining that no other requests involving the keymap information for data object instances having the particular user key are pending.Type: GrantFiled: January 22, 2018Date of Patent: January 7, 2020Assignee: Amazon Technologies, Inc.Inventors: Jason G. McHugh, Praveen Kumar Gattu, Michael A. Ten-Pow, Derek Ernest Denny-Brown, II