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: Non-relational database operations are invoked to provide results consistent with commands specified in a relational query language. A request to access data in a non-relational database is received that includes one or more commands specified in a query language for accessing data according to a relational data scheme. The request may be evaluated to determine one or more Application Programming Interfaces (APIs) to invoke operations at the non-relational database that provide a result consistent with the commands specified in the query language. The determined APIs are executed and a result returned for the request based on the execution of the APIs.

Abstract: Schema incompatibilities are generating views at target data stores are detected. A view definition may be received at a view management system that specifies data to obtain from source data stores and identifies a target data store to store the view. The view management system may identify an incompatibility between a schema for the data, specified in the view definition, with a type system for the target data store. The view management system may provide an indication of the incompatibility with the type system for the target data store.

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 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 system that implements a data storage system may store data for a database table in multiple replicated partitions on respective storage nodes. An export of an active database partition may generate an exported copy of the database partition. A first exported copy may be stored locally on a source node and a second exported copy of the database partition may be sent to a recipient node. The source node may validate the first copy responsive to sending the second copy and may perform the validation while the second copy is being sent and processed at the recipient node. If the first copy cannot be validated, the source node may cause the second copy to be invalidated and abort further processing of the second copy. The source node may also cause the second copy to be marked as invalid to prevent reliance on an invalid database partition copy.