Claire Elizabeth Suver

20140047040, Feb 13, 2014

Aug 8, 2012

13/570074

Kestutis Patiejunas - Sammamish WA, US
Christian L. Claiborn - Seattle WA, US
Colin L. Lazier - Seattle WA, US
Claire E. Suver - Seattle WA, US
Mark C. Seigle - Seattle WA, US

H04L 12/58

709206, 709219

An application programming interface for a data storage service provides a convenient mechanism for clients of the data storage service to access its various capabilities. An API call may be made to initiate a job and in response a job identifier may be provided. A separate API call specifying the job identifier may be made and a response providing information related to the job may result. Various API calls may be used to store data, retrieve data, obtain an inventory of stored data, and to obtain other information relating to stored data.

20200364184, Nov 19, 2020

Aug 3, 2020

16/983849

- Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US
Mark Christopher Seigle - Seattle WA, US
Bryan James Donlan - Seattle WA, US

G06F 16/16
G06F 11/10

Techniques described and suggested herein include distributed deletion request processing and verification. For example, incident to migration of original data from a first data store to a second data store, verifications and confirmations related to removing the original data from the first data store may be performed so as to ensure the integrity of the original data represented on the second data store prior to removing the actual original data on the first data store. In some embodiments, the verifications and confirmations performed in connection with a deletion request may be apportioned to multiple entities, each of which may not fully trust the others. As a result, in some embodiments, a given deletion request may only be fulfilled if all of the entities involved in the verification process individually provide authorization to execute the deletion request.

20200327113, Oct 15, 2020

Jun 25, 2020

16/912092

- Seattle WA, US
Christian L. Claiborn - Seattle WA, US
Colin L. Lazier - Seattle WA, US
Claire E. Suver Weir - Seattle WA, US
Mark C. Seigle - Seattle WA, US

G06F 16/23
H04L 12/58
G06F 16/00
G06F 16/21
G06F 16/17
G06F 11/14

An application programming interface for a data storage service provides a convenient mechanism for clients of the data storage service to access its various capabilities. An API call may be made to initiate a job and in response a job identifier may be provided. A separate API call specifying the job identifier may be made and a response providing information related to the job may result. Various API calls may be used to store data, retrieve data, obtain an inventory of stored data, and to obtain other information relating to stored data.

20180373587, Dec 27, 2018

Aug 29, 2018

16/116777

- Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US
Ryan Charles Schmitt - Seattle WA, US
Paul David Franklin - Seattle WA, US

G06F 11/10
H03M 13/00

Techniques described and suggested herein include various methods and systems for verifying integrity of redundancy coded data, such as erasure coded data shards. In some embodiments, a quantity of redundancy coded data elements, hereafter referred to as data shards (e.g., erasure coded data shards), sufficient to reconstruct the original data element from which the redundancy coded data elements are derived, is used to generate reconstructed data shards to be used for checking the validity of analogous data shards stored for the original data element.

20180246923, Aug 30, 2018

Apr 27, 2018

15/965567

- Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US
Melissa Elaine Davis - Edmonds VA, US
Paul Matthew Buddington - Charlottesville VA, US
Christopher Allen Suver - Seattle WA, US
Lukasz Wojciech Cwik - Seattle WA, US
Chelsea Celest Krueger - Seattle WA, US

Amazon Technologies, Inc. - Seattle WA

G06F 17/30
G06F 9/46

Non-blocking processing of federated transactions may be implemented for distributed data partitions. A transaction may be received that specifies keys at data nodes to lock in order to perform the transaction. Lock requests are generated and sent to the data nodes which identify sibling keys to be locked at other data nodes for the transaction. In response to receiving the lock requests, data nodes may send to lock queues indicating other lock requests for the keys at the data node. An evaluation of the lock queues based, at least in part, on an ordering of the lock requests in the lock queues may be performed to identify a particular transaction to commit. Once identified, a request to commit the identified transaction may be sent to the particular data nodes indicated by the sibling keys in a lock request for the identified transaction.

20170300384, Oct 19, 2017

Jun 30, 2017

15/640067

- Seattle WA, US
Bryan James Donlan - Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US

G06F 11/10
G06F 11/10
G06F 11/10
G06F 11/10
G06F 3/06

Techniques described and suggested herein include systems and methods for storing, indexing, and retrieving original data of data archives on data storage systems using redundancy coding techniques. For example, redundancy codes, such as erasure codes, may be applied to archives (such as those received from a customer of a computing resource service provider) so as allow the storage of original data of the individual archives available on a minimum of volumes, such as those of a data storage system, while retaining availability, durability, and other guarantees imparted by the application of the redundancy code. Sparse indexing techniques may be implemented so as to reduce the footprint of indexes used to locate the original data, once stored. The volumes may be apportioned into failure-decorrelated subsets, and archives stored thereto may be apportioned to such subsets.

20170060687, Mar 2, 2017

Nov 14, 2016

15/350946

- Seattle WA, US
Bryan James Donlan - Seattle WA, US
Colin Laird Lazier - Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US

G06F 11/10
H03M 13/00
G06F 3/06

Techniques described and suggested herein include systems and methods for precomputing regeneration information for data archives (“archives”) that have been processed and stored using redundancy coding techniques. For example, regeneration information, such as redundancy code-related matrices (such as inverted matrices based on, e.g., a generator matrix for the selected redundancy code) corresponding to subsets of the shards, is computed for each subset and, in some embodiments, stored for use in the event that one or more shards becomes unavailable, e.g., so as to more efficiently and/or quickly regenerate a replacement shard.

20170024281, Jan 26, 2017

Sep 30, 2016

15/283023

- Seattle WA, US
Bryan James Donlan - Seattle WA, US
Claire Elizabeth Suver - Seattle WA, US

G06F 11/10

Techniques described and suggested herein include systems and methods for storing, indexing, and retrieving original data of data archives on data storage systems using redundancy coding techniques. For example, redundancy codes, such as erasure codes, may be applied to archives (such as those received from a customer of a computing resource service provider) so as allow the storage of original data of the individual archives available on a minimum of volumes, such as those of a data storage system, while retaining availability, durability, and other guarantees imparted by the application of the redundancy code. Sparse indexing techniques may be implemented so as to reduce the footprint of indexes used to locate the original data, once stored. The volumes may be apportioned into failure-decorrelated subsets, and archives stored thereto may be apportioned to such subsets.