公开(公告)号：US10747719B2

公开(公告)日：2020-08-18

申请号：US15836108

申请日：2017-12-08

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jose A. Barreto ,  Clement B. Fauchere ,  Meir E. Abergel ,  Steven J. Rayson ,  Jiashan Song ,  Andrew Sean Watson ,  Shaun W. Kimber ,  Ronakkumar N. Desai ,  Andrew Glover

IPC: G06F11/14 ,  G06F16/11 ,  G06F16/16 ,  G06F16/18 ,  G06F21/57 ,  G06F11/30

Abstract: 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.

公开(公告)号：US09785666B2

公开(公告)日：2017-10-10

申请号：US14797890

申请日：2015-07-13

Applicant: Microsoft Technology Licensing, LLC

Inventor： Jin Li ,  Sudipta Sengupta ,  Ran Kalach ,  Ronakkumar N. Desai ,  Paul Adrian Oltean ,  James Robert Benton

IPC: G06F17/30

CPC classification number: G06F17/30371 ,  G06F17/30156 ,  G06F17/30303 ,  G06F17/30327 ,  G06F17/3033 ,  G06F17/30489

Abstract: 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.

公开(公告)号：US10664170B2

公开(公告)日：2020-05-26

申请号：US15379467

申请日：2016-12-14

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Andrew K. Glover ,  Jose A. Barreto ,  Ronakkumar N. Desai

IPC: G06F3/06 ,  G06F16/182 ,  G06F16/17 ,  G06F16/13

Abstract: 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.

公开(公告)号：US20180165018A1

公开(公告)日：2018-06-14

申请号：US15379467

申请日：2016-12-14

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Andrew K. Glover ,  Jose A. Barreto ,  Ronakkumar N. Desai

IPC: G06F3/06 ,  G06F17/30

Abstract: 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.

公开(公告)号：US20160012098A1

公开(公告)日：2016-01-14

申请号：US14797890

申请日：2015-07-13

Applicant: MICROSOFT TECHNOLOGY LICENSING, LLC

Inventor： Jin Li ,  Sudipta Sengupta ,  Ran Kalach ,  Ronakkumar N. Desai ,  Paul Adrian Oltean ,  James Robert Benton

IPC: G06F17/30

CPC classification number: G06F17/30371 ,  G06F17/30156 ,  G06F17/30303 ,  G06F17/30327 ,  G06F17/3033 ,  G06F17/30489

Abstract: 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.

Abstract translation: 本发明涉及一种数据重复数据删除技术，其中散列索引服务的索引被分割成子空间索引，其中小于整个散列索引服务的索引来缓存存储器。 访问子空间索引以确定数据块是否已经存在或需要进行索引和存储。 索引可以根据与索引的数据相关联的标准被划分为子空间，例如文件类型，数据类型，上次使用的时间等等。 还描述了子空间协调，其中检测子空间中的重复条目，以便从重复数据删除系统中删除条目和块。 当更多的系统资源可用时，子空间协调可以在非高峰时间执行，并且如果需要资源，则可能被中断。 调和的子空间可以基于相似性，包括通过每个紧密地表示子空间的散列的签名的相似性。