Abstract: Index management for non-relational database systems may be automatically performed. Performance of queries to a non-relational database may be evaluated to determine whether to create or remove an additional index. An additional index may be automatically created to store a subset of data projected from the non-relational database to utilize when performing a query to the non-relational database instead of accessing data in the non-relational database.

Abstract: Updates to projected data subsets may be ordered using conditional operations. When updates to a data set are received, a determination is made according to a schema for a projected subset of the data set as to whether the update is to be propagated to the projected subset of the data set. If the update is to be propagated, a comparison of a version identifier for the update may be made with a version identifier for the subset to determine whether performance of the update is consistent with an ordering of updates performed to the first data set. If the comparison indicates the performance of the update is consistent, then the update may be performed to the projected subset. If not, then the update may not be performed.

Abstract: Columns of a non-relational data store may be efficiently dropped. A drop column request for a table stored in a non-relational database may be received. In response to the drop column request, schema information for the table may be updated to filter out the column from subsequent read responses to read requests. A backup of the table is created and evaluated to identify those items in the table that include the column. The column is then deleted from the identified items.

Abstract: A distributed database encrypts tables using table encryption keys protected by a client master encryption key. The client may revoke and subsequently restore authorization to access the client master encryption key. A sweeper process of the distributed database examines encrypted tables and identifies changes to the status of a corresponding client master encryption key. A response to an identified change in status is initiated.

Abstract: Offline building of a projected data subset may be performed. A request to create a data set that is a projected subset of data from a source data set may be received. A data store separate from the data store storing the source data set may store a copy of the source data set that is used to replicate items to the projected subset of data according to a schema for the projected data subset. Updates made to the source data set may also be replicated to the projected data subset according to the schema. Conflicts between replicated items and replicated updates to the projected data set may be resolved by comparing a version identifier for the replicated update and replicated item to determine what to store in the projected data subset.

Abstract: A database system may associate functions with a database table. A request to associate a function with a table in a database system may be received. An association between the table and the function may be created. The function may include parameters that are determined from values within the table which are then invoked by a request to perform the function. The associated function may cause the collection of the values prior to performance of the function.

Abstract: Replicas may be added to a multi-leader replica group for a data set. A new replica may be added to a group of replicas by copying a version of the data set according to a point in time to the new replica. As updates may occur at different ones of the replicas when the new replica is added, updates that occurred at a source replica for the snapshot and other replicas may be replicated by the different replicas according to the point in time at which the snapshot is created without blocking updates at any of the replicas in the replica group.

Abstract: A system receives a request to import data file(s) from a source data store into a target database. The system reserves a first portion of computing resources that host the target database to import the data file(s). The reservation of the first portion of computing resources permits the import throughput rate of the data file(s) through the first portion of computing resources while maintaining a second portion of the computing resources to support client access to the target database at an access throughput rate. The system initiates import of the data file(s) from the source data store to the target database through one or more storage nodes at the import throughput rate according to the first portion of computing resources. The target database is able to receive access requests from one or more clients during the import of the data file(s) to the target database.

Abstract: A distributed database encrypts a table using a table encryption key protected by a client master encryption key. The encrypted table is replicated among a plurality of nodes of the distributed database. The table encryption key is replicated among the plurality of nodes, and is stored on each node in a respective secure memory. In the event of node failure, a copy of the stored key held by another member of the replication group is used to restore a node to operation. The replication group may continue operation in the event of a revocation of authorization to access the client master encryption key.

Abstract: A distributed database encrypts tables using table encryption keys protected by a client master encryption key. The client may revoke authorization to access the client master encryption key. Subsequent to a revocation of authority to access the client master encryption key, the distributed database generates interim snapshots of the table using the table encryption key. Also subsequent to the revocation, the distributed database generates a backup of the table using a backup encryption key protected by the client master encryption key.

Abstract: A transmission format cache may be implemented at a database storage node. Versions of data items stored in a database at the database storage node may be processed according to anticipated access requests to generate an anticipated access responses. The anticipated access responses are then stored in a transmission format cache to provide low latency reads of the data items. The versions of the data items may be processed as a result of updates to the database items. The database storage node may be one of a plurality of database storage nodes implementing a distributed database system with the transmission format cache implementing a portion of a distributed response cache providing low latency, eventually consistent or consistent reads of data items in a distributed database.

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

Abstract: Methods, systems, and computer-readable media for renaming a database table with minimized application downtime are disclosed. A database receives a table rename request for a table having a first table name. Routing metadata comprises a mapping of the first table name to a table identifier and a mapping of the table identifier to one or more partitions. The table rename request indicates a second table name. The database generates updated routing metadata responsive to the table rename request. The updated routing metadata comprises a mapping of the second table name to the table identifier and the mapping of the table identifier to the one or more partitions. The database receives, from a client application, one or more access requests indicating the second table name. The database routes the one or more access requests to the one or more partitions based at least in part on the updated routing metadata.

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

Abstract: A service provider network may provider one or more global cloud services across multiple regions. A client may submit a request to create multiple replicas of a service resource in respective instantiations of a service in the multiple regions. The receiving region of the request may determine the capacities of the multiple regions as to serving respective replicas of the service resource. The receiving region may provide a response to the client based on the determined capacities of the regions.

Abstract: Offline building of a projected data subset may be performed. A request to create a data set that is a projected subset of data from a source data set may be received. A data store separate from the data store storing the source data set may store a copy of the source data set that is used to replicate items to the projected subset of data according to a schema for the projected data subset. Updates made to the source data set may also be replicated to the projected data subset according to the schema. Conflicts between replicated items and replicated updates to the projected data set may be resolved by comparing a version identifier for the replicated update and replicated item to determine what to store in the projected data subset.

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

Abstract: Offline building of a projected data subset may be performed. A request to create a data set that is a projected subset of data from a source data set may be received. A data store separate from the data store storing the source data set may store a copy of the source data set that is used to replicate items to the projected subset of data according to a schema for the projected data subset. Updates made to the source data set may also be replicated to the projected data subset according to the schema. Conflicts between replicated items and replicated updates to the projected data set may be resolved by comparing a version identifier for the replicated update and replicated item to determine what to store in the projected data subset.

Abstract: Localized lookups for performing access requests to a database may be implemented. Mapping information for storage nodes of a network-based service storing different data for different databases may be obtained by a routing application co-hosted with a client application of the database at a same container host. Access requests from the client application are handled by the routing application and sent to storage nodes identified using the mapping information. An authorization token may be included along with the requests to verify authorization to perform the access request at the storage nodes.