公开(公告)号：US20140280664A1

公开(公告)日：2014-09-18

申请号：US13830950

申请日：2013-03-14

Applicant: Microsoft Corporation

Inventor： Sudipta Sengupta ,  Chenguang Zhu ,  Chun Ho Cheung ,  Jin Li ,  Abhishek Gupta

IPC: H04L29/08

CPC classification number: H04L67/2842 ,  G06F12/0804 ,  G06F12/0866 ,  G06F17/30097 ,  G06F17/30132 ,  G06F17/30159

Abstract: The subject disclosure is directed towards using primary data deduplication concepts for more efficient access of data via content addressable caches. Chunks of data, such as deduplicated data chunks, are maintained in a fast access client-side cache, such as containing chunks based upon access patterns. The chunked content is content addressable via a hash or other unique identifier of that content in the system. When a chunk is needed, the client-side cache (or caches) is checked for the chunk before going to a file server for the chunk. The file server may likewise maintain content addressable (chunk) caches. Also described are cache maintenance, management and organization, including pre-populating caches with chunks, as well as using RAM and/or solid-state storage device caches.

Abstract translation: 主题公开涉及使用主重复数据删除概念，以便通过内容可寻址高速缓存更有效地访问数据。 数据块（例如重复数据删除的数据块）被维护在快速访问客户端缓存中，例如基于访问模式包含块。 分块内容可通过系统中该内容的散列或其他唯一标识符进行内容寻址。 当需要一个块时，在进入组块的文件服务器之前，将检查该组块的客户端缓存（或高速缓存）。 文件服务器可以同样保持内容可寻址（块）高速缓存。 还描述了缓存维护，管理和组织，包括具有块的预填充高速缓存，以及使用RAM和/或固态存储设备高速缓存。

公开(公告)号：US09729659B2

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

申请号：US13830950

申请日：2013-03-14

Applicant: Microsoft Corporation

Inventor： Sudipta Sengupta ,  Chenguang Zhu ,  Chun Ho Cheung ,  Jin Li ,  Abhishek Gupta

IPC: G06F15/16 ,  H04L29/08 ,  G06F17/30 ,  G06F12/0866 ,  G06F12/0804

CPC classification number: H04L67/2842 ,  G06F12/0804 ,  G06F12/0866 ,  G06F17/30097 ,  G06F17/30132 ,  G06F17/30159

Abstract: The subject disclosure is directed towards using primary data deduplication concepts for more efficient access of data via content addressable caches. Chunks of data, such as deduplicated data chunks, are maintained in a fast access client-side cache, such as containing chunks based upon access patterns. The chunked content is content addressable via a hash or other unique identifier of that content in the system. When a chunk is needed, the client-side cache (or caches) is checked for the chunk before going to a file server for the chunk. The file server may likewise maintain content addressable (chunk) caches. Also described are cache maintenance, management and organization, including pre-populating caches with chunks, as well as using RAM and/or solid-state storage device caches.

公开(公告)号：US20140244601A1

公开(公告)日：2014-08-28

申请号：US13781585

申请日：2013-02-28

Applicant: MICROSOFT CORPORATION

Inventor： Ping Xie ,  Chun Ho Cheung ,  Kashif Hasan ,  Abhishek Gupta ,  Ran Kalach ,  Daniel Hefenbrock

IPC: G06F17/30

CPC classification number: G06F17/30117 ,  G06F17/30156

Abstract: The subject disclosure is directed towards partially recalling file ranges of deduplicated files based on tracking dirty (write modified) ranges (user writes) in a way that eliminates or minimizes reading and writing already-optimized adjacent data. The granularity of the ranges does not depend on any file-system granularity for tracking ranges. In one aspect, lazy flushing of tracking data that preserves data-integrity and crash-consistency is provided. In one aspect, also described is supporting granular partial recall on an open file while a data deduplication system is optimizing that file.

Abstract translation: 主题公开旨在基于消除或最小化已经优化的相邻数据的读取和写入的方式基于跟踪脏（写修改）范围（用户写入）来部分地调用重复数据删除的文件的文件范围。 范围的粒度不依赖于跟踪范围的任何文件系统粒度。 在一方面，提供了保持数据完整性和崩溃一致性的跟踪数据的延迟刷新。 在一个方面，还描述了在重新数据删除系统优化该文件的同时，在打开的文件上支持粒度部分调用。

公开(公告)号：US10180943B2

公开(公告)日：2019-01-15

申请号：US13781585

申请日：2013-02-28

Applicant: Microsoft Corporation

Inventor： Ping Xie ,  Chun Ho Cheung ,  Kashif Hasan ,  Abhishek Gupta ,  Ran Kalach ,  Daniel Hefenbrock

IPC: G06F17/30

Abstract: The subject disclosure is directed towards partially recalling file ranges of deduplicated files based on tracking dirty (write modified) ranges (user writes) in a way that eliminates or minimizes reading and writing already-optimized adjacent data. The granularity of the ranges does not depend on any file-system granularity for tracking ranges. In one aspect, lazy flushing of tracking data that preserves data-integrity and crash-consistency is provided. In one aspect, also described is supporting granular partial recall on an open file while a data deduplication system is optimizing that file.

公开(公告)号：US09152502B2

公开(公告)日：2015-10-06

申请号：US13724464

申请日：2012-12-21

Applicant: Microsoft Corporation

Inventor： Ran Kalach ,  Kashif Hasan ,  Paul Adrian Oltean ,  James R. Benton ,  Chun Ho Cheung ,  Ahmed Moustafa El-Shimi

IPC: G06F11/14

CPC classification number: G06F11/1435 ,  G06F11/1402 ,  G06F11/1415 ,  G06F2201/83

Abstract: The subject disclosure is directed towards a data storage service that uses hash values, such as substantially collision-free hash values, to maintain data integrity. These hash values are persisted in the form of mappings corresponding to data blocks in one or more data stores. If a data error is detected, these mappings allow the data storage service to search the one or more data stores for data blocks having matching hash values. If a data block is found that corresponds to a hash value for a corrupted or lost data block, the data storage service uses that data block to repair the corrupted or lost data block.

Abstract translation: 主题公开涉及使用诸如基本上无冲突的哈希值之类的散列值来维持数据完整性的数据存储服务。 这些哈希值以对应于一个或多个数据存储中的数据块的映射的形式保持。 如果检测到数据错误，这些映射允许数据存储服务搜索具有匹配散列值的数据块的一个或多个数据存储。 如果找到对应于损坏或丢失的数据块的哈希值的数据块，则数据存储服务使用该数据块来修复已损坏或丢失的数据块。

公开(公告)号：US20140181575A1

公开(公告)日：2014-06-26

申请号：US13724464

申请日：2012-12-21

Applicant: MICROSOFT CORPORATION

Inventor： Ran Kalach ,  Kashif Hasan ,  Paul Adrian Oltean ,  James R. Benton ,  Chun Ho Cheung ,  Ahmed Moustafa El-Shimi

IPC: G06F11/14

CPC classification number: G06F11/1435 ,  G06F11/1402 ,  G06F11/1415 ,  G06F2201/83

Abstract: The subject disclosure is directed towards a data storage service that uses hash values, such as substantially collision-free hash values, to maintain data integrity. These hash values are persisted in the form of mappings corresponding to data blocks in one or more data stores. If a data error is detected, these mappings allow the data storage service to search the one or more data stores for data blocks having matching hash values. If a data block is found that corresponds to a hash value for a corrupted or lost data block, the data storage service uses that data block to repair the corrupted or lost data block.

Abstract translation: 主题公开涉及使用诸如基本上无冲突的哈希值之类的散列值来维持数据完整性的数据存储服务。 这些哈希值以对应于一个或多个数据存储中的数据块的映射的形式保持。 如果检测到数据错误，这些映射允许数据存储服务搜索具有匹配散列值的数据块的一个或多个数据存储。 如果找到对应于损坏或丢失的数据块的哈希值的数据块，则数据存储服务使用该数据块来修复已损坏或丢失的数据块。