Amazon Technologies, Inc.

Rajesh Shanker Patel

Bryan Christopher Castillo

David Michael Packard

Arun Antony Mathews

Bradley E Marshall

James Christopher Sorenson

Jonathan Robert Collins

Timothy James Davis

Mark Robert Sieklucki

Dave Rahmany

A network-based data store may implement retention-based management techniques for data stored at the network-based data store. When data is received for storage at the network-based data store, a retention time for the data may be determined. Storage locations at persistent storage devices of the network-based data store may be selected according to the retention time. The data may then be placed at the storage locations. When a request to delete data is received, retention times of co-located data may be evaluated to determine whether the deletion may be delayed. Delayed deletions may allow the data to be subsequently deleted with at least some of the co-located data. Repair operations to maintain the data according to a durability policy may be modified according to retention time for a data suffering a loss of redundancy.

Retention-based data management in a network-based data store

A storage manager may be used to schedule requests for a data object stored in data sources of a storage system, such as an object-redundant storage system. The storage manager may iteratively request sets of corresponding blocks of the data object from storage devices of the storage system. As the corresponding blocks are received, the storage manager may store the corresponding blocks in an input buffer. In response to receiving at least a particular number of corresponding blocks, the storage manager may remove the corresponding blocks from the input buffer and decode the corresponding blocks into a block of the data object. In response to free space in the input buffer reaching a threshold amount, the storage manager may request subsequent sets of corresponding blocks of the data object such that at least some corresponding blocks are stored in the input buffer when the threshold amount is reached.

Scheduling requests from data sources for efficient data decoding

A storage manager may be used to perform a refinement operation on a coding matrix as part of a coding operation (e.g., an encoding operation or a decoding operation) in a storage system, such as an object-redundant storage system. The refinement operation may include identifying a plurality of computations to be performed as part of the coding operation, where the plurality of computations have common terms and operations. The refinement operation may include refining a coding matrix associated with the coding operation based on the identified computations and precomputing the identified computations. The precomputed computations may be used instead of performing the computations when performing the coding operation.

Computation refinement in a data storage system

A storage manager may be used to perform a coding operation (e.g., an encoding operation or a decoding operation) on a data object using a refined version of a coding matrix in a storage system, such as an object-redundant storage system. The coding operation may include identifying a coding matrix for the data object and retrieving a refined version of the identified coding matrix from a data store of pre-refined coding matrices. The refined version of the coding matrix may identify two or more computations to be performed as part of the coding operation, where the two or more computations have common terms and operations. The coding operation may include determining one or more precomputed results of the two or more identified computations. The precomputed results may be used instead of performing the computations when performing the coding operation.

Computation refinement storage in a data storage system

A storage manager may be used to perform a decoding operation using a transmission time refinement technique on a data object stored in a storage system, such as an object-redundant storage system. The decoding operation may include requesting groups of corresponding blocks from storage devices of the storage system. The storage manager may maintain connections to a connection group of the storage devices and may iteratively request corresponding blocks of the data object from one or more various request groups of the storage devices of the connection group. The storage manager may evaluate performance of the request groups in sending the corresponding blocks of the data object and may modify the membership of the request groups for requests for subsequent blocks of the data object based at least in part on the performance of the request groups.

Transmission time refinement in a storage system

Embodiments may include a payment management system that receives information indicating a first transaction is to be initiated, the information specifying a first quantity of funds. The system may determine that an additional transaction for a respective quantity of funds is expected to be initiated within a given time period. The system may, prior to initiation of the additional transaction, generate a payment authorization request for a combined quantity of funds equal to at least a sum of the first quantity of funds and the respective quantity of funds of the additional transaction. The system may, subsequent to receiving information indicating that a payment authorization for the combined quantity of funds was issued and subsequent to receiving information indicating that the additional transaction is to be initiated, initiate settlement of the first transaction and the at least one additional transaction using the combined quantity of funds of the payment authorization.

System and method for predictive payment authorizations

Embodiments may include a system configured to, for each of multiple database partitions, generate a respective value of commit latency dependent on the latency of one or more previous commit operations directed to that database partition. The system may also be configured to, for a given work item that includes a commit operation to be initiated on a given database partition of said multiple database partitions, determine whether the value of the commit latency for the given database partition exceeds a configurable commit latency threshold. The system may be configured to, in response to determining that the value of the commit latency for the given database partition exceeds the commit latency threshold, postpone the given work item to reduce load on the database partitions and perform the given work item after the postponement. If the commit latency does not exceed the threshold, the work may be performed without the postponement.

System and method for distributed back-off in a database-oriented environment

Various embodiments may include a payment management system including an authorization reusability component. The payment management system may be configured to, subsequent to a customer providing payment information for an order, receive a payment authorization that indicates funds of an account associated with the customer have been reserved as a form of payment for a given transaction associated with the order. The payment management system may be configured to assign the reserved funds of the payment authorization to the given transaction. The payment management system may be configured to, subsequent to assigning the reserved funds, reassign at least some of the reserved funds of the authorization to a one or more other transactions. The payment management system may be configured to initiate a settlement of the one or more other transactions, the settlement including the reserved funds reassigned to the one or more other transactions.

Growing community of inventors

Bellevue, WA, United States of America

Rajesh Shanker Patel