Microsoft Technology Licensing, LLC

Naresh Kannan

Simon Skaria

Simon Clarke

Andrew Sean Watson

Mitesh Patel

Jonathan Bailor

Mark Rolland Knight

Christopher James Antos

Miko Arnab Sakhya Singha Bose

Andrew Grey Carlson

Seshadri Mani

Don Adam Hedgpeth

Elena Petrova

Dmitriy Meyerzon

Benjamin N Truelove

Murli D Satagopan

Nikita Voronkov

Ziyi Wang

Patrick Miller

William James Griffin

Aninda Ray

Ryan Antoine Nakhoul

Willard Bruce Jones

David M Cohen

David R Quick

Jeffrey Lamar McDowell

Hongzhou Ma

Negin Arhami

Zi Gu

Wei-ting Timothy Woo

Miko Arnab Sakya Singha Bose

W Bruce Jones

Vladimir Fesich

The techniques disclosed herein enable applications to seamlessly consume cloud-based services while minimizing exposure to security vulnerabilities. Specifically, an application is enabled to access a cloud service on behalf of a user without the user's active user token. Access is granted in a way that does not also grant access to any other user's cloud service. In some configurations, during an active user session, an artifact token is generated that caches the user's permissions. The artifact token may later be redeemed to gain access to the user's cloud service. For example, an application may request that a cloud service generate an artifact token. The request may be in response to a user scheduling the application to perform a task that depends on the cloud service. When the scheduled task is performed, the application may redeem the artifact token to access the user's cloud service.

Cloud service artifact tokens

A histogram slider application accesses, from a data storage of a machine, file activities performed on the machine as a function of time. The histogram slider application determines points in time at which a level of file activities exceeds an activity level threshold that is based on historical levels of file activities on the machine. The histogram slider application generates a graphical user interface comprising a histogram indicative of the file activities over time and the determined points in time, a slider configured to move along a timeline that is parallel to the histogram, and a list of file activities corresponding to a first position of the slider on the timeline, the first position indicating a first time on the histogram.

Histogram slider for quick navigation of a time-based list

Directory information and content for two separate tenants are merged by identifying a first of tenants as a hub tenant and a second of the tenants as a satellite tenant. The hub tenant is modified to include two instances, or data containers, one instance for the hub tenant and another instance for the satellite tenant. Directory merger logic re-associates identity account items in the satellite instance, with the hub instance, by replacing a tenant identifier in the identity account items of the satellite instance with a tenant identifier corresponding to the hub instance. Unique identifiers for users of the satellite instance are maintained unchanged. Content merger logic re-associates content items of the satellite instance with the hub instance by setting a tenant identifier for all satellite content items to the tenant identifier corresponding to the hub instance. A tenant identifier corresponding to backend services that support the content items can be updated to the tenant identifier corresponding to the hub instance as well.

Single multi-instance tenant computing system

A cache that can be stored in a user partitioned region of storage and utilized to reduce the amount of time required to present content responsive to content requests is described. A request for content associated with a region of a user interface can be received and data corresponding to a list item in a cache can be accessed. Content associated with the data can be presented in the region of the user interface via a same presentation as a most recent presentation of the content. At a time subsequent to when the content is initially presented in the region, new data associated with the list item can be retrieved. In examples where the new data corresponds to updated data, the presentation can be modified based partly on the updated data and the new data can be written to the cache in a location corresponding to the list item.

Reduced page load time utilizing cache storage

Example systems and methods are directed at maintaining and retrieving presence metadata. One example method includes receiving a request from a first client to edit a document file, and sending short-term check out metadata to the first client to begin an editing session. The method also includes writing the transition ID to a transition table stored in a cache, wherein the presence of another transition ID in the cache indicates that a document has switched from a single-client mode to a multi-client mode. An example system includes a processing unit operative to receive a document, the document including short-term check out metadata indicating an editing session has begun, ping a cache to determine if another transition ID is stored in the cache, and send a transition ID to a transition table stored in a cache to switch from a single-client mode to a multi-client mode.

Caching infrastructure

Tools and techniques for indexing and querying data stores using concatenated terms are provided. These tools may receive input queries that include at least two query terms. The query terms are correlated respectively with fields contained within records within a data store, with these fields being populated with respective field values. The query terms are arranged according to an indexing priority according to which the fields are ranked within an indexing table, which is associated with the data store. The tools then concatenate the query terms as arranged according to the indexing priority. In turn, the tools search the index table for any entries that are responsive to the concatenated query terms.

Indexing and querying data stores using concatenated terms

Examples are related to systems and methods for controlling access to document files on a document server. One example system includes document files stored on a document server, at least one of the document files referencing a file lock, and a document access processing module. The example document access processing module includes a file sharing processing module that determines a coauthoring status of a software application of a client computer requesting access to the document file, and a file lock processing module that stores one or more file locks and that controls the setting and resetting of file locks. The example document access processing module uses the coauthoring status of the software application and the file lock status of a document file to determine whether a software application is permitted to have write access to the document file.

Controlling access to documents using file locks

A storage system according to one embodiment for managing a first file includes a blob storage and a handler. The blob storage may be configured to store data related to the first file temporarily. The handler may be configured to store in the blob storage any data related to the first file and received from an application. The handler also may be configured to transfer at least a portion of the data from the blob storage to persistent storage in response to a commit instruction received from an application or generated by the handler. The handler also may be configured to retrieve any portion of the data stored in the blob storage and to send the same to a requesting application in response to an access request.

Data storage for file updates

Architecture for security trimming results in a document version environment. Versioned documents are stored with metadata that includes associated access rights. All versions are searched using multiple user accounts of varying levels of access that correspond to the document versions. Result sets are returned for each user account and trimmed during a merge process by considering the user rights associated with each of multiple versions of objects or documents. Each document metadata includes a scope ID that defines security rights for that document. In a two-version document (major and minor) implementation, successive queries are run as a user with rights to all minor versions, and as a user with rights to all major items, but not the minor items. The result sets are merged into a final trimmed result set by examining the rights to each item in the versioned sets that align with rights of the current user.

Trimmed and merged search result sets in a versioned data environment

Growing community of inventors

Seattle, WA, United States of America

Naresh Kannan