Microsoft Technology Licensing, LLC

Michael Wilde

Rui Chen

Neelamadhaba Mahapatro

Charles Glenn Jeffries

Ricardo Soares Stern

Nakul Garg

Ashvin Mathew

Charles Lamanna

Krishna Kumar Parthasarathy

Hao Zhang

Yongjun Xie

David Alexander Blyth

Matthew G Humphrey

Costel Radu

Ian Miers

JiYe Gao

Techniques for isolating a portion of an online computing service referred to as a deployment unit and configured with a complete build of the online computing service may include routing production traffic away from the deployment unit, applying one or more changes to the complete build, and after applying one or more changes to the complete build, using the deployment unit for testing these changes using end-to-end tests. In one embodiment, the deployment unit may be dedicated to a specific group of tenants that require at least some isolation from other tenants.

Isolating a portion of an online computing service for testing

Techniques to isolating a portion of an online computing service are described. The following description may refer to the isolated portion as a deployment unit configured with a complete build of the online computing service. In one embodiment, after applying one or more changes to the complete build, the deployment unit may be used for testing these changes using end-to-end tests. In another embodiment, the deployment unit may be dedicated to a specific group of tenants that require at least some isolation from other tenants. Other embodiments are described and claimed.

Techniques to isolating a portion of an online computing service

A notification is received at a workload that indicates that a compliance policy update is available for the workload at a compliance policy management system. A synchronization manager on the workload pulls the compliance policy update from the compliance policy management system and deploys it to the workload.

Synchronized distribution of compliance policy updates

An application asynchronously flattens a graph in a relational store to provide fast access to node relationship queries. The application may implement an algorithm that retrieves forward paths of a start node. The algorithm may also retrieve reverse paths of end node. The application may cross-join the forward and reverse paths to determine link paths connecting the start and end nodes. The application may merge the link paths with existing paths. The application may increment path reference counts. The application may store the link paths as a link between the nodes to represent a relationship between the nodes.

Asynchronously flattening graphs in relational stores

A secure storage system secures information of a client by first encrypting the information with a first key to generate first-key encrypted data. The secure storage system then encrypts with a second key the first-key encrypted data and the first key to generate second-key encrypted data. The system provides the client with a first portion of the second-key encrypted data. The system stores a second portion of the second-key encrypted data and the second key. When the confidential information is needed, the client provides the first portion. The system retrieves the second portion. The system then decrypts with the second key the first portion and the second portion to generate the first-key encrypted data and the first key. The system then decrypts with the first key the first-key encrypted data to generate the unsecure confidential information.

Two-party storage of encrypted sensitive information

Growing community of inventors

Bothell, WA, United States of America

Michael Wilde