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, in a data center that receives change actions related to the structured data records, selectively placing the change actions into a plurality of change feeds, where the change feeds can be commutatively executed in parallel to implement the change actions. The method further includes implementing the change actions and propagating replication data comprising the change actions in the plurality of change feeds.

Abstract: Systems, methods, and software for management of redundant data storage centers is provided herein. An exemplary method includes redundantly storing data records across the redundant data storage centers, with a first data storage center operating as a primary data storage center configured to respond to at least user input related to the data records. The method includes placing the first data storage center into an intermediate mode which comprises ceasing response to the user input by the first data storage center and executing pending operations related to previous user input received by the first data storage center, and designating the second data storage center as the primary data storage center configured to respond to at least further user input related to the data records.

Abstract: A consistent user view system. The system incorporates any changes made by a user in any views shown to that user even when the changes have not propagated to the partitions supplying the view. The system separates the authority for edits from the replicated storage allowing efficient transactions and linear scalability. Documents are read from view-based partitions of a store. Document writes are written to a document-specific partition in a journal and applied to the store. The system stores a copy of pending changes in a user-specific partition. When a user requests a view, the system checks that user's cache for any pending changes applicable to the view. If any applicable changes are found, the changes are applied before showing the view to the user. Pending changes that have been successfully applied to the store are trimmed from the user-specific partition to free up resources.

Abstract: A consistent user view system. The system incorporates any changes made by a user in any views shown to that user even when the changes have not propagated to the partitions supplying the view. The system separates the authority for edits from the replicated storage allowing efficient transactions and linear scalability. Documents are read from view-based partitions of a store. Document writes are written to a document-specific partition in a journal and applied to the store. The system stores a copy of pending changes in a user-specific partition. When a user requests a view, the system checks that user's cache for any pending changes applicable to the view. If any applicable changes are found, the changes are applied before showing the view to the user. Pending changes that have been successfully applied to the store are trimmed from the user-specific partition to free up resources.

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: A scalable eventual consistency system. The system uses logical document journaling to provide eventual consistency across partitions in a large-scale service. The system allows for transactional edits to massively interconnected graphs of documents through parallelization without sacrificing linear scalability. The system separates the authority for edits from the replicated storage allowing efficient transactions and linear scalability. All document writes are written to document-specific partitions in a journal where they are queued until the changes are propagated to view-based partitions of a store. By continually checking the journal and attempting to replicate any pending document writes to the store, the system provides eventual consistency without complicated synchronization mechanisms.

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, in a data center that receives change actions related to the structured data records, selectively placing the change actions into a plurality of change feeds, where the change feeds can be commutatively executed in parallel to implement the change actions. The method further includes implementing the change actions and propagating replication data comprising the change actions in the plurality of change feeds.

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 redundant data storage centers is provided herein. An exemplary method includes redundantly storing data records across the redundant data storage centers, with a first data storage center operating as a primary data storage center configured to respond to at least user input related to the data records. The method includes placing the first data storage center into an intermediate mode which comprises ceasing response to the user input by the first data storage center and executing pending operations related to previous user input received by the first data storage center, and designating the second data storage center as the primary data storage center configured to respond to at least further user input related to the data records.

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: A scalable eventual consistency system. The system uses logical document journaling to provide eventual consistency across partitions in a large-scale service. The system allows for transactional edits to massively interconnected graphs of documents documents through parallelization without sacrificing linear scalability. The system separates the authority for edits from the replicated storage allowing efficient transactions and linear scalability. All document writes are written to document-specific partitions in a journal where they are queued until the changes are propagated to view-based partitions of a store. By continually checking the journal and attempting to replicate any pending document writes to the store, the system provides eventual consistency without complicated synchronization mechanisms.

Abstract: A consistent user view system. The system incorporates any changes made by a user in any views shown to that user even when the changes have not propagated to the partitions supplying the view. The system separates the authority for edits from the replicated storage allowing efficient transactions and linear scalability. Documents are read from view-based partitions of a store. Document writes are written to a document-specific partition in a journal and applied to the store. The system stores a copy of pending changes in a user-specific partition. When a user requests a view, the system checks that user's cache for any pending changes applicable to the view. If any applicable changes are found, the changes are applied before showing the view to the user. Pending changes that have been successfully applied to the store are trimmed from the user-specific partition to free up resources.

Abstract: A fault monitoring, detection and analysis system obtains data (e.g. online service facts) from different data sources. Many times the data obtained from the different data sources is in different formats. The data is classified (e.g. into error, performance and usage events/facts) based on user configured multi-dimensional (time, topology, functional area) filter criteria. The data from the different data sources is normalized into a standard format and stored. The data may also be grouped and duplicates may be removed before and/or after the normalized data is stored. Analysis is performed on the normalized data. For example, the analysis may monitor for expected events, unexpected events, detect abnormal behavior of the system, and the like. Different users may submit different jobs to the system to obtain data from the data store. A reporting service exposes one or more views of the data and/or the analysis of the data.

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: Methods and computer-readable media provide for efficient paging of search results in accordance with the access rights of a user. According to various implementations, a request for a search query results in a calculated number of search results being retrieved and analyzed for user access rights. As documents having user access rights are located, session state information corresponding to the number of located documents having user access rights and to the number of analyzed documents required to locate the number of documents having user access rights is maintained. This information is used to dynamically alter the number of subsequent documents that are retrieved in order to fill a page of results. This minimizes redundant determinations of user access rights and minimizes the number of documents required to be retrieved and analyzed in order to fulfill a search query request.

Abstract: Platform management may be provided. First, a package may be received. The received package may then be separated into a plurality of deployment groups. Next, a plurality of tasks may be created for deploying the plurality of deployment groups. Then the plurality of tasks may be executed.

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.

Abstract: Methods and computer-readable media provide for efficient paging of search results in accordance with the access rights of a user. According to various implementations, a request for a search query results in a calculated number of search results being retrieved and analyzed for user access rights. As documents having user access rights are located, session state information corresponding to the number of located documents having user access rights and to the number of analyzed documents required to locate the number of documents having user access rights is maintained. This information is used to dynamically alter the number of subsequent documents that are retrieved in order to fill a page of results. This minimizes redundant determinations of user access rights and minimizes the number of documents required to be retrieved and analyzed in order to fulfill a search query request.