Microsoft Technology Licensing, LLC

Ronakkumar N Desai

Paul Adrian Oltean

Jin Li

Sudipta Sengupta

Ran Kalach

James Robert Benton

Jose Araujo Barreto

Biplob Kumar Debnath

Andrew Keith Glover

Abhishek Gupta

David A Nichols

John E Brezak

Andrew Sean Watson

Albert Peter Hwang

Meir Elie Abergel

Patrick Jakubowski

Oded Yehuda Shekel

Steven James Rayson

Kevin Andrew Chan

Gyorgy K Schadt

Chun Ho Cheung

Patrick Moulhaud

Clement Basile Fauchere

Jyotsana Rathore

Deepak Sreenivas Pemmaraju

Chun Ho (Ian) Cheung

Robert C Turner

Shaun W Kimber

Jiashan Song

Meir E Abergel

Andrew K Glover

Andrew Glover

A system is provided for facilitating access to data stored in a cloud-based storage service. Data associated with a user account is stored at the cloud-based storage service. A portion of the data is associated with a heightened authentication protocol. A request for an application to receive data that is associated with the heightened authentication protocol is received at the cloud-based storage service. In response to the request, the request is authenticated based on the heightened authentication protocol. In response to authenticating the request, permission is granted for the application to receive the data that is associated with the heightened authentication protocol. In response to a locking of the data that is associated with the heightened authentication protocol, an indication that the data is unavailable is sent to the application.

Synchronization in a file storage system using authentication-state-based permissions

Systems and methods for restoring a file system to a point-in-time without relying on a backup. One system includes an electronic processor configured to automatically restore a file system to a specified point-in-time by (a) automatically restoring, from a recycle bin, items deleted from the file system after the point-in-time, (b) automatically deleting, from the file system, items created within the file system after the point-in-time, (c) automatically moving items moved within the file system after the point-in-time to a location within the file system associated with the point-in-time, (d) automatically deleting, from the file system, items copied within the file system after the point-in-time, (e) automatically renaming items renamed within the file system after the point-in-time to a name associated with the point-in-time, and (f) automatically restoring, from a version history, a version associated with the point-in-time for items with content modified after the point-in-time.

File system point-in-time restore using recycle bin and version history

Variety of approaches to provide partial storage of large files in distinct storage systems are described. A storage service initiates operations to provide storage of large files by determining a rapid access portion and a slow access portion of a file. The rapid access portion of the file is stored in a rapid access storage system and the slow access portion of the file (or an entirety of the file) is stored in a slow access storage system. In response to an access request to the file, the rapid access portion of the file is provided from the rapid access storage system. Next, the slow access portion of the file is retrieved from the slow access storage system to be provided while providing the rapid access portion of the file.

Partial storage of large files in distinct storage systems

Data streams may be stored in a chunk store in the form of stream maps and data chunks. Data chunks corresponding to a data stream may be stored in a chunk container, and a stream map corresponding to the data stream may point to the data chunks in the chunk container. Multiple stream maps may be stored in a stream container, and may point to the data chunks in the chunk container in a manner that duplicate data chunks are not present. Techniques are provided herein for localizing the storage of related data chunks in such chunk containers, for locating data chunks stored in chunk containers, for storing data streams in chunk stores in localized manners that enhance locality and decrease defragmentation, and for reorganizing stored data streams in chunks stores.

Scalable chunk store for data deduplication

The subject disclosure is directed towards a data deduplication technology in which a hash index service's index is partitioned into subspace indexes, with less than the entire hash index service's index cached to save memory. The subspace index is accessed to determine whether a data chunk already exists or needs to be indexed and stored. The index may be divided into subspaces based on criteria associated with the data to index, such as file type, data type, time of last usage, and so on. Also described is subspace reconciliation, in which duplicate entries in subspaces are detected so as to remove entries and chunks from the deduplication system. Subspace reconciliation may be performed at off-peak time, when more system resources are available, and may be interrupted if resources are needed. Subspaces to reconcile may be based on similarity, including via similarity of signatures that each compactly represents the subspace's hashes.

Using index partitioning and reconciliation for data deduplication

Techniques for data synchronization policies are described. In one or more implementations, techniques may be employed to set data synchronization ('sync') policies for devices in a data sync environment. The sync policies specify parameters for sync operations in the sync environment, such as how frequently data sync operations are performed, what types of data are synced to particular devices, how frequently particular types of data are synced, and so on. In implementations, the sync policies consider the number of devices that are participating in a sync environment and attributes of the devices in specifying parameters for sync operations. Data can be synchronized among devices in the sync environment based on the sync policies.

Data synchronization policies

The subject disclosure is directed towards a data deduplication technology in which a hash index service's index maintains a hash index in a secondary storage device such as a hard drive, along with a compact index table and look-ahead cache in RAM that operate to reduce the I/O to access the secondary storage device during deduplication operations. Also described is a session cache for maintaining data during a deduplication session, and encoding of a read-only compact index table for efficiency.

Fast and low-RAM-footprint indexing for data deduplication

Growing community of inventors

Redmond, WA, United States of America

Ronakkumar N Desai