Microsoft Technology Licensing, LLC

Other

Arshish C Kapadia

Tarkan Sevilmis

Peter Adam Outcalt

Jonah Sarbin Burke

Targo Tennisberg

Tittu Jose

David Koronthaly

Howard Morrison Crow, Iii

Mark Jeremy Zeller

Mohammed Nazeeruddin

Wei-Lun Lo

Rolando Jimenez-Salgado

Sundaravadivelan Paranthaman

Ryan Yandle

Shajan Dasan

Hardik V Shah

Sreekanth Lingannapeta

Maxim Lukiyanov

Marius Bunescu

Stephen John Clark

Gheorghita Irimescu

Janak Madhusudan Agarwal

Jason Matthew Cahill

Alexander Hopmann

Eric B Fox

Rolando Jimenez Salgado

Karthik Kalyanaraman

Michael Thomas McLean

Marc Keith Windle

Erick Raymundo Lerma

Zach Rosenfield

Jiajun Hua

Jonathan Adam Kauffman

Kshamta Jerath

Doron Bar-Caspi

Kaushik Raj

Sundar Paranthaman

Ricardo Prates De Oliveira

Howard M Crow, Iii

Ricard Roma-Dalfo

Nazeeruddin Mohammed

Andre Makram

R Daniel Parke

Mark Zellner

Colin Daniel Eugene Jeanne

Paul Gaston Shealy

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.

Replication of structured data records among partitioned data storage spaces

An intelligent conflict detection system. The system provides semantic expression of edits and history-aware conflict detection in a large-scale service allowing multiple users to simultaneously work with the same document, which may result in conflicting edits. When submitted, changes to a version of a document are compared to all versions of the document created since the document was sourced. Edits to documents are expressed as intents describing the changes in terms of an action and object of that action based on a characteristic of the data being edited. Comparing the intent of current edits against the historical intent of the edits made in prior versions originating from the same source document allows the system to intelligently assess whether the edits are in conflict. History-aware semantic analysis results in users being prompted less frequently to resolve conflicts, which improves the user experience.

Intelligent conflict detection and semantic expression of document edits

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.

Replication control among redundant data centers

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.

Consistent views of partitioned data in eventually consistent systems

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.

Promoted properties in relational structured data

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.

Reminder processing of structured data records among partitioned data storage spaces

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. The system models membership and containment relationships between documents in manner allowing document writes ultimately impacting more than one document to be efficiently handled through the journal as an edit to a single document.

Scalable eventual consistency system using logical document journaling

Technologies are described herein for integrating external data from an external system into a client system. A subscription filed is selected. The subscription filed may include a read method and a query method. The read method may define fields of a client cache operating on the client system. The query method may be executed to retrieve, from the external system, field values corresponding to at least a subset of the fields. Upon executing the query method, the read method may also be executed to retrieve, from the external system, additional field values corresponding to a remaining subset of the fields that were not retrieved by executing the query method. The client cache is populated with the field values and the additional field values according to the fields.

Subscription for integrating external data from external system

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.

Failure mode identification and reporting

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 then executes () its other instructions. If the component completes its instructions so that it can terminate normally (), then 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, 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 () 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.

A software application written for a server environment is transformed into one which runs in a rich client environment. An entity model defines data sources as they are accessed from the server and as they are accessed from the clients. An application programming interface defines stereotyped interfaces which provide the same functionality on the server and the clients. A metadata model describes the components which make up the application and defines the differences in structure between the server and clients. The metadata model also defines mappings between components used on the server and clients. Settings and context information which tailor the activation and functionality of the components is also captured in the metadata model. Automated transformation is performed by using the mappings to identify the component set to use for the clients, selecting the client version of the application programming interfaces, and selecting the appropriate settings and context information.

Projecting software and data onto client

Methods and computer-readable media are provided for associating security trimmers with documents in an enterprise search system. According to one method, a search index is maintained that includes one or more document identifiers corresponding to documents stored at back-end computing systems. Each document identifier in the search index is associated with one or more security trimmer implementations. When a query request is received from a user, the search index is queried to identify documents referenced by the search index that match search terms provided with the query request. For each document that matches the search terms, the associated security trimmer implementations are identified and executed to retrieve the access rights to view the document for the current user from the back-end computing system where the document is stored.

Associating security trimmers with documents in an enterprise search system

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.

Efficient paging of search query results

Growing community of inventors

Redmond, WA, United States of America

Arshish C Kapadia