Abstract: A transaction directed to a hierarchy of data objects stored in a non-transactional data store may be executed. The transaction may be received and description of the transaction stored in a parent data object of the hierarchy. Upon storing the description of the transaction, the transaction may be acknowledged as committed. Access requests for the hierarchy of data objects may be serviced by accessing the description of the transaction and applying to child data objects in the hierarchy returned for servicing a query directed to the hierarchy. A new transaction that is received may initiate application of the transaction according to the description in the parent data object with respect to child data objects.

Abstract: A secondary index may be implemented for a distributed data set that is strongly consistent. Updates to a distributed data set that add or remove items from the distributed data set may be reflected in the secondary index as part of performing the update. Pointers to items to be added to a distributed data set may be included in the secondary index as part of processing an insertion request for the new items. Pointers to items removed from a distributed data set may be removed from the secondary index as part of processing a deletion request. Changes to the secondary index may be performed so that the secondary index does not fail to identify items that are present in the distributed data set.

Abstract: A computing resource associated with a user is scheduled to undergo a transition. Prior to the scheduled transition, the computing resource is placed in a pending state. The user is notified that the computing resource is scheduled to undergo the transition. In response to an input received from the user, the computing resource is allowed to undergo the transition when the input indicates that the transition can proceed.

Abstract: A computing resource associated with a user is scheduled to undergo a transition. Prior to the scheduled transition, the computing resource is placed in a pending state. The user is notified that the computing resource is scheduled to undergo the transition. In response to an input received from the user, the computing resource is allowed to undergo the transition when the input indicates that the transition can proceed.