Microsoft Technology Licensing, LLC

Kristof Roomp

Chandramohan Amyangot Thekkath

Larry Marvin Wall

John David Rodrigues

John Philip MacCormick

Marcus Jon Jager

William Raymond Hoffman

Gruia Pitigoi-Aron

Glen Buhlmann

Ivaylo G Dimitrov

Nicholas Duncan

Cheng Ho

Lincoln Liu

Alok Dhariwal

Brandon Pai

Kumar Pasumarthy

Lidong Zhou

Ashok Chandrasekaran

Alexander Felsobuki Nagy

Novia Rosalinda Wijaya

Systems and techniques of de-duplicating file and/or blobs within a file system are presented. In one embodiment, an email system is disclosed wherein the email system receives email messages comprising a set of associated attachments. The system determines whether the associated attachments have been previously stored in the email system, the state of the stored attachment, and if the state of the attachment is appropriate for sharing copies of the attachment, then providing a reference to the attachment upon a request to share the attachment. In another embodiment, the system may detect whether stored attachments are corrupted and, if so, attempt to repair the attachment, and possibly, prior to sharing references to the attachment.

De-duplicating attachments on message delivery and automated repair of attachments

This document describes various techniques for efficiently sequencing structured data in a particular order to provide a sequence of data elements suitable for storage or communication. The sequence may contain values representing a number of default-value structured data elements omitted from the sequence and/or a byte length of the sequence.

Efficient encoding of structured data

A searchable storage system indexes data, such as a blob (binary large object) as it is stored. The indexes are stored simultaneously with the data by the same storage mechanism. Data cannot be stored without indexing it. Any indexing technique may be used. The indexes are then used to access the data. This ensures that any inconsistencies can handled at the local level, and are not visible to clients of the system. Data can be put in to, or taken out from, the searchable storage system. Additionally, a query on the data in the searchable storage system may be performed.

Searchable storage system

A global state management service manages replication in a distributed system. A distributed system can have several replica groups. The global state management service manages state associated with each replica group. Data replication is implemented without implementing an instance of a state machine on each device in a replica group. A replica group comprises a primary device and at least one secondary device. Each device in a replica group contains a replica of data of interest. The global state management service manages the allocation of primary and secondary devices. In the absence of a failure in either a primary device or a secondary device, read and write operations are performed without consulting the global state management service. When a failure is detected, the global state management service manages failover.

Data replication in a distributed system

Data is served from a data source to a user. The data source has a plurality of pre-defined user groups. A request is received from the user for the data from the data source and a cache key corresponding to the requesting user is generated based on a set of the user groups of such user. The generated cache key represents access rights for the user based on the set of the user groups of the user. Thereafter, it is determined whether any data that satisfies the request is stored in the cache with the generated cache key.

Caching based on access rights in connection with a content management server system or the like

Data is served from a data source to a user by way of an interface having a cache. The data source has a plurality of pre-defined user groups. The interface receives a request from the user for the data from the data source and requests the data source to provide a cache key corresponding to the requesting user. The data source generates the cache key for the requesting user based on a set of the user groups of such user and returns the generated cache key to the interface. The generated cache key represents exact access rights for the user based on the set of the user groups of the user. The interface thereafter determines whether any data that satisfies the request is stored in the cache with the generated cache key.

Growing community of inventors

Seattle, WA, United States of America

Kristof Roomp