Amazon Technologies, Inc.

Nathan Pellegrom Riley

Akshat Vig

Somasundaram Perianayagam

Rishabh Jain

Vaibhav Jain

Alexander Richard Keyes

Stefano Stefani

James Christopher Sorenson

Amit Gupta

Douglas Brian Terry

Tate Andrew Certain

Ming-Chuan Wu

Almero Gouws

Derek William Richard Chen-Becker

Lewis Bruck

Tony Petrossian

Anshul Gupta

Jin Kyoung Kwon

A request to perform a batch of operations is provided to a distributed database. The request comprises instructions for validating a condition. An association between the request and a unique identifier is stored. An item in the distributed database is locked and the condition is validated. The system that initiates processing of the batch of operations. A second request, comprising the identifier, is received. The second request is responded to by providing information indicative of the status of processing the first request, based on the stored association. The lock is released when processing of the first request has completed.

Idempotent transaction requests

A distributed database maintains a table on a first plurality of partitions. A request to restore the table to a point-in-time is received. The database determines, based on log data of the partitions, a maximum version number of an operation processed by the partitions. The log data is processed to exclude, from the restoration, operations whose transactions were started after the point-in-time, by setting the version number of those operations to be greater than the maximum version number. The log data is then applied to a second plurality of partitions, where the version number of each applied operation is less than or equal to the determined maximum version number.

Transactionally consistent point-in-time restore

A distributed database system maintains data for a logical table by storing, on a plurality of storage nodes, a collection of key-item pairs. An operation to delete a range of these items is processed by first storing, on each of the plurality of storage nodes, a tombstone record indicative of the items to be deleted. The tombstones are committed once each of the plurality of nodes has stored the tombstone. Items within the range are treated as deleted. A cleanup operation deletes items within the range and updates the tombstone.

Range deletes on a distributed database

Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.

Ordering transaction requests in a distributed database according to an independently assigned sequence

Growing community of inventors

Seattle, WA, United States of America

Nathan Pellegrom Riley