Abstract: Systems, methods, and computer readable media for decentralized two-phase commit in a datastore or database where the methods include determining pre-validating a transaction, writing first metadata to a leader partition, the first metadata including a state indicating preparing and mutations of the transaction, and writing second metadata of a follower partition to indicate the follower partition is locked by the leader partition. The methods further include updating the state of the first metadata to indicate committed and performing the transaction on the leader partition, performing the transaction on the follower partition and unlocking the follower partition, and updating the first metadata to remove the mutations of the transaction and updating the state of the first metadata to indicate the transaction is completed. The methods may further include selecting a leader partition key and updating the state of the first metadata to indicate committed unapplied.

Abstract: A decentralized two-phase commit in a datastore or database includes determining pre-validating a transaction, writing first metadata to a leader partition, the first metadata including a state indicating preparing and mutations of the transaction, and writing second metadata of a follower partition to indicate the follower partition is locked by the leader partition. The decentralized two-phase commit further includes updating the state of the first metadata to indicate committed and performing the transaction on the leader partition, performing the transaction on the follower partition and unlocking the follower partition, and updating the first metadata to remove the mutations of the transaction and updating the state of the first metadata to indicate the transaction is completed. The decentralized two-phase commit may further include selecting a leader partition key and updating the state of the first metadata to indicate committed unapplied.

Abstract: Systems, methods, and computer readable media for decentralized two-phase commit in a datastore or database where the methods include determining pre-validating a transaction, writing first metadata to a leader partition, the first metadata including a state indicating preparing and mutations of the transaction, and writing second metadata of a follower partition to indicate the follower partition is locked by the leader partition. The methods further include updating the state of the first metadata to indicate committed and performing the transaction on the leader partition, performing the transaction on the follower partition and unlocking the follower partition, and updating the first metadata to remove the mutations of the transaction and updating the state of the first metadata to indicate the transaction is completed. The methods may further include selecting a leader partition key and updating the state of the first metadata to indicate committed unapplied.

Abstract: Systems, methods, and computer readable media for a live data migration system where the methods include accessing a command to perform a live data migration of a source datastore to a target datastore, accessing a delete operation, the delete operation indicating first data to be deleted from a datastore, and determining the datastore is stored in a source datastore. The methods further includes performing a two-phase commit delete of the first data from the source datastore and the target datastore, accessing a write operation, the write operation indicating second data, and performing a two-phase commit write of the second data to the source datastore and to the target datastore. The methods further include copying the source datastore to the target datastore, accessing a read operation, the read operation indicating third data to be read from the datastore, and performing the read operation of the third data from the target datastore.

Abstract: Systems, methods, and software for management of partitioned data storage spaces are provided herein. An exemplary method includes storing sets of structured data records among partitioned data storage spaces, with data fields of the structured data records correlated among the sets by relational associations. The method includes maintaining data fields in a first set of structured data records, the data fields comprising promoted data fields that reference properties of data fields of a second set of structured data records. Responsive to an update to a data field of a first structured data record, the method includes determining if the update relates to a promoted data field, implementing a portion of the update in the second set of structured data records, and propagating the update to associated promoted data fields in the first set of structured data records along with any intervening changes received for the associated promoted data fields.

Abstract: Systems, methods, and software for management of partitioned data storage spaces is provided herein. An exemplary method includes storing sets of structured data records among partitioned data storage spaces, with data fields of the structured data records correlated among the sets by relational associations. The method includes receiving a change action related to a selected structured data record, and responsive to the change action, scheduling execution of the change action in a reminder index. The method includes executing the change action according to at least scheduling indicated by the reminder index.

Abstract: When a software component is starting, such as but not limited to a task or a subtask, the component pushes its identification (ID) onto a stack. The component executes its other instructions. If the component completes its instructions so that it can terminate normally, it pops the stack, which removes its ID from the stack. If the component fails, such as by not being able to complete its instructions, it will not be able to pop the stack so its ID will remain in the stack. Another software process can read the IDs in the stack to identify which components have failed and can automatically take a specified action, such as by sending an email message to, sending a text message to, or calling by telephone, a person or persons responsible for that software component.

Abstract: Systems, methods, and software for management of partitioned data storage spaces is provided herein. An exemplary method includes storing sets of structured data records among partitioned data storage spaces, with data fields of the structured data records correlated among the sets by relational associations. The method includes receiving a change action related to a selected structured data record, and responsive to the change action, scheduling execution of the change action in a reminder index. The method includes executing the change action according to at least scheduling indicated by the reminder index.

Abstract: Systems, methods, and software for management of partitioned data storage spaces are provided herein. An exemplary method includes storing sets of structured data records among partitioned data storage spaces, with data fields of the structured data records correlated among the sets by relational associations. The method includes maintaining data fields in a first set of structured data records, the data fields comprising promoted data fields that reference properties of data fields of a second set of structured data records. Responsive to an update to a data field of a first structured data record, the method includes determining if the update relates to a promoted data field, implementing a portion of the update in the second set of structured data records, and propagating the update to associated promoted data fields in the first set of structured data records along with any intervening changes received for the associated promoted data fields.

Abstract: When a software component is starting, such as but not limited to a task or a subtask, the component pushes its identification (ID) onto a stack. The component executes its other instructions. If the component completes its instructions so that it can terminate normally, it pops the stack, which removes its ID from the stack. If the component fails, such as by not being able to complete its instructions, it will not be able to pop the stack so its ID will remain in the stack. Another software process can read the IDs in the stack to identify which components have failed and can automatically take a specified action, such as by sending an email message to, sending a text message to, or calling by telephone, a person or persons responsible for that software component.

Abstract: When a software component is starting (305), such as but not limited to a task or a subtask, the component pushes (310) its identification (ID) onto a stack. The component then executes (315) its other instructions. If the component completes its instructions so that it can terminate normally (320), then it pops (325) the stack, which removes its ID from the stack. If the component fails, such as by not being able to complete its instructions, then it will not be able to pop the stack so its ID will remain in the stack. Another software process can then read the IDs in the stack to identify (330) which components have failed and can automatically take a specified action (335), such as by sending an email message to, sending a text message to, or calling by telephone, a person or persons responsible for that software component.

Abstract: When a software component is starting (305), such as but not limited to a task or a subtask, the component pushes (310) its identification (ID) onto a stack. The component then executes (315) its other instructions. If the component completes its instructions so that it can terminate normally (320), then it pops (325) the stack, which removes its ID from the stack. If the component fails, such as by not being able to complete its instructions, then it will not be able to pop the stack so its ID will remain in the stack. Another software process can then read the IDs in the stack to identify (330) which components have failed and can automatically take a specified action (335), such as by sending an email message to, sending a text message to, or calling by telephone, a person or persons responsible for that software component.

Abstract: Disclosed herein are systems, methods, and software for facilitating technology upgrades. In at least one implementation, an incomplete upgrade to service units within a service environment is initiated. An upgrade health of each of the service units is evaluated based at least in part on results of the incomplete upgrade. A complete upgrade of the service environment is then initiated based at least in part on the upgrade health of each of the plurality of service units.

Abstract: A machine manager controls the deployment and management of machines (physical and virtual) for an online service. Multi-tier server groups are arranged in farms that each may include different configurations. For example, their may be content farms, federated services farms and SQL farms that are arranged to perform operations for the online service. When the multiple farms are upgraded, new farms are deployed and the associated content databases from the old farms are moved to the newly deployed farms. During the upgrade of the farms, requests may continue to be processed by the farms. The farms may be automatically load balanced during an upgrade. As content becomes available on the new farm, requests for the content may be automatically redirected to the new farm.

Abstract: A machine manager controls the deployment and management of machines (physical and virtual) for an online service. Multi-tier server groups are arranged in farms that each may include different configurations. For example, their may be content farms, federated services farms and SQL farms that are arranged to perform operations for the online service. When the multiple farms are upgraded, new farms are deployed and the associated content databases from the old farms are moved to the newly deployed farms. During the upgrade of the farms, requests may continue to be processed by the farms. The farms may be automatically load balanced during an upgrade. As content becomes available on the new farm, requests for the content may be automatically redirected to the new farm.