Abstract: A distributed database management system comprises a plurality of peers and maintains data on behalf of a plurality of clients. Upon receiving a request to access data, the distributed database management system identifies, from among the plurality of peers, a set of peers associated with the client issuing the request. The distributed database management system provides, to the client, a list of the set of identified peers. Access to data maintained by the distributed database system is based, at least in part, on connections between the client and the set of identified peers.

Abstract: A distributed database system maintains data for a logical table by storing, on a plurality of storage nodes, a collection of key-item pairs. The distributed database system receives a query of the logical table, and identifies one or more portions of a key specified by the query. Based on the one or more portions of the key, the distributed database causes at least one of a get, range query, or scan operation to be performed by one or more of the storage nodes. Results for the query are generated based on one or more items obtained by performance of the operation.

Abstract: A distributed database system maintains data for a database client by storing data on a plurality of storage nodes. Upon receiving a request from the database client in a first format, the database system translates the request to a second format and sends the translated request to a storage subsystem. The storage subsystem generates an exception if the translated request cannot be successfully completed. The distributed database system resends the translated request on behalf of the database client if the exception corresponds to a request that can be retried, and continues to resend the translated request until a first of an expiration of a predetermined time period or until the request completes successfully. The distributed database system sends a response to the database client based on the resent database request.

Abstract: 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.

Abstract: A service implements techniques for modifying a data table stored in a key-value or non-relational database via a table-oriented schema. In some aspects, a request to modify a table-oriented schema of a table of data may be received. In response to the request, an association between a customer identifier of elements of the table and an internal identifier of elements of the table may be stored that updates a prior association between a customer identifier and an internal identifier. The table-oriented schema of the table may be modified using one or more keys that are generated using the internal identifier.

Abstract: A geographically distributed system using a hybrid, multi-master design is disclosed. The system may use global tables, for which both reads and writes may be performed locally, but with a single region serving as a master region. All strongly consistent reads and writes may be sent to the master region, whereas eventually consistent reads and writes may be performed in any region with a replica. The master region may not be statically assigned but may move from region to region. The master region may be assigned manually by client preference or may be assigned and updated automatically based on the time of day or workload characteristics.

Abstract: A data storage service implements encoding techniques for generating compound partition keys, compound clustering keys, or a combination for more flexibility in storing data in a key-value database system. In some aspects a request to store data with multiple partition keys and/or multiple clustering keys may be received. Length information may be added to the partition keys, and the results concatenated together to form a compound partition key used to store the data in the database. Ordering information may be added to the clustering keys, and the results concatenated together to form a compound clustering key, to be used in storing and sorting data in the database. In some cases, the clustering keys may be made a uniform length, such as by padding keys, as necessary, to have a length that is a multiple of an arbitrary number, and then dividing the clustering keys into chunks of that arbitrary number.

Abstract: A geographically distributed system using a hybrid, multi-master design is disclosed. The system may use global tables, for which both reads and writes may be performed locally, but with a single region serving as a master region. All strongly consistent reads and writes may be sent to the master region, whereas eventually consistent reads and writes may be performed in any region with a replica. The master region may not be statically assigned but may move from region to region. The master region may be assigned manually by client preference or may be assigned and updated automatically based on the time of day or workload characteristics.