中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.021 seconds)

    Opportunistic fragmentation repair
    1.
    发明授权
    Opportunistic fragmentation repair 有权
    机会分裂修复

    公开(公告)号：US09483494B1

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

    申请号：US13828266

    申请日：2013-03-14

    Applicant: EMC Corporation

    Inventor： Hung Hing Anthony Pang ,  Fabiano Botelho ,  Dhanabal Ekambaram ,  Nitin Garg

    IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30 ,  G06F3/06

    CPC classification number: G06F17/30215 ,  G06F11/00 ,  G06F11/1453

    Abstract: Opportunistic repair of fragmentation in a synthetic backup is disclosed. In various embodiments, data generated to perform processing other than fragmentation repair is received. At least a portion of the received data is used to compute a locality measure with respect to a group of segments comprising a portion of a file. A decision whether to repair fragmentation of segments comprising the group is made based at least in part on the computed locality measure.

    Abstract translation: 披露了合成备份中碎片化的机会性修复。 在各种实施例中，接收生成用于执行除碎片修复之外的处理的数据。 所接收的数据的至少一部分用于计算关于包括文件的一部分的一组段的位置度量。 是否至少部分地基于所计算的局部性度量来确定是否修复包括该组的段的分片。

    Selective fragmentation repair
    2.
    发明授权
    Selective fragmentation repair 有权
    选择性碎片修复

    公开(公告)号：US09195672B1

    公开(公告)日：2015-11-24

    申请号：US13828185

    申请日：2013-03-14

    Applicant: EMC Corporation

    Inventor： Hung Hing Anthony Pang ,  Fabiano Botelho ,  Dhanabal Ekambaram ,  Nitin Garg

    IPC: G06F17/30

    CPC classification number: G06F17/30135 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30371

    Abstract: Selective repair of fragmentation in a synthetic backup, based at least in part on a dynamically-determined repair criteria, is disclosed. In various embodiments, a locality measure is computed with respect to a group of segments comprising a portion of a file. The computed locality measure is compared to an at least partly dynamically determined fragmentation repair criteria, and a repair decision is made based at least in part on the comparison.

    Abstract translation: 公开了至少部分地基于动态确定的修复标准来选择性地修复合成备份中的碎片。 在各种实施例中，相对于包括文件的一部分的一组段来计算位置度量。 将计算的局部度量度与至少部分动态确定的分段修复标准进行比较，并且至少部分地基于比较进行修复决定。

    Memory efficient sanitization of a deduplicated storage system using a perfect hash function
    4.
    发明授权
    Memory efficient sanitization of a deduplicated storage system using a perfect hash function 有权
    使用完美散列函数对重复数据删除的存储系统进行内存高效的清理

    公开(公告)号：US09317218B1

    公开(公告)日：2016-04-19

    申请号：US13763522

    申请日：2013-02-08

    Applicant: EMC Corporation

    Inventor： Fabiano C. Botelho ,  Nitin Garg ,  Philip N. Shilane ,  Grant Wallace

    IPC: G06F12/00 ,  G06F3/06

    CPC classification number: G06F3/0655 ,  G06F17/30156 ,  G06F17/30159 ,  G06F17/30949

    Abstract: Techniques for sanitizing a storage system are described herein. In one embodiment, for each of fingerprints representing data chunks stored in a first container of the storage system, a lookup operation in a live bit vector based on the fingerprint is performed to determine whether a corresponding data chunk is live. In one embodiment, a bit in a copy bit vector corresponding to the data chunk is populated based on the lookup operation. In one embodiment, after all of the bits corresponding to the data chunks of the first container have been populated in the CBV, data chunks represented by the CBV are copied from the first container to a second container, and records of the data chunks in the first container are erased.

    Abstract translation: 本文描述了用于消毒存储系统的技术。 在一个实施例中，对于代表存储在存储系统的第一容器中的数据块的每个指纹，执行基于指纹的实时比特向量中的查找操作，以确定对应的数据块是否是活的。 在一个实施例中，基于查找操作填充与数据块对应的复制位向量中的位。 在一个实施例中，在对应于第一容器的数据块的所有位已经被填充到CBV之后，由CBV表示的数据块从第一容器复制到第二容器，并将数据块的记录在 第一个容器被擦除。

    Method and system for container data recovery in a storage system
    5.
    发明授权
    Method and system for container data recovery in a storage system 有权

    公开(公告)号：US10019323B1

    公开(公告)日：2018-07-10

    申请号：US14225188

    申请日：2014-03-25

    Applicant: EMC Corporation

    Inventor： Lan Bai ,  Fabiano C. Botelho ,  Mahesh Kamat ,  Nitin Garg

    IPC: G06F17/30 ,  G06F11/14

    CPC classification number: G06F11/1469 ,  G06F11/1004 ,  G06F11/1435 ,  G06F16/184

    Abstract: A computer-implemented method is disclosed. The method starts with determining a first container of a storage system is invalid. The method continues with the storage system setting a data recovery state for the first container to be en-queue, which indicates that data of at least one of the data segments needs to be recovered from the first container, and executing a process to recover any container having an en-queue data recovery state, and for each of the containers, to recover any valid data segment from the corresponding container. The process includes scanning the data segments of the first container to find valid data segments, moving or replicating the valid data segments to a second container, and setting the data recovery state for the first container to be complete once all the valid data segments are moved or replicated to the second container.

    Method and system for garbage collection of data storage systems
    7.
    发明授权
    Method and system for garbage collection of data storage systems 有权
    数据存储系统垃圾收集方法与系统

    公开(公告)号：US09424185B1

    公开(公告)日：2016-08-23

    申请号：US13909871

    申请日：2013-06-04

    Applicant: EMC Corporation

    Inventor： Fabiano C. Botelho ,  Dheer Moghe ,  Guilherme Vale Ferreira Menezes ,  Nitin Garg ,  Srikant Varadan

    IPC: G06F17/30 ,  G06F12/02

    CPC classification number: G06F12/0253 ,  G06F2212/401

    Abstract: A garbage collector of a storage system traverses a namespace of a file system of the storage system to identify segments that are alive in a breadth-first manner. The namespace includes information identifying files that are represented by segments arranged in a plurality of levels in a hierarchy, where an upper level segment includes one or more references to one or more lower level segments, and at least one segment is referenced by multiple files. All live segments of an upper level are identified before any of live segments of a lower level are identified. Upon all live segments of all levels have been identified, the live segments are copied from their original storage locations to a new storage location, and a storage space associated with the original storage locations is reclaimed.

    Abstract translation: 存储系统的垃圾回收器遍历存储系统的文件系统的命名空间以识别以广度优先的方式活着的段。 命名空间包括标识由分层中多个级别排列的段表示的文件的信息，其中上级段包括对一个或多个较低级别段的一个或多个引用，并且至少一个段由多个文件引用。 识别较低级别的任何实时段之前，上级的所有实时段都被识别。 在所有级别的所有实时段都已被识别后，实时段将从其原始存储位置复制到新的存储位置，并且回收与原始存储位置相关联的存储空间。

    SELECTIVE FRAGMENTATION REPAIR
    8.
    发明申请
    SELECTIVE FRAGMENTATION REPAIR 有权
    选择性分类修复

    公开(公告)号：US20160034487A1

    公开(公告)日：2016-02-04

    申请号：US14884560

    申请日：2015-10-15

    Applicant: EMC Corporation

    Inventor： Hung Hing Anthony Pang ,  Fabiano Botelho ,  Dhanabal Ekambaram ,  Nitin Garg

    IPC: G06F17/30

    CPC classification number: G06F17/30135 ,  G06F11/1448 ,  G06F11/1453 ,  G06F17/30371

    Abstract: Selective repair of fragmentation in a synthetic backup, based at least in part on a dynamically-determined repair criteria, is disclosed. In various embodiments, a locality measure is computed with respect to a group of segments comprising a portion of a file. The computed locality measure is compared to an at least partly dynamically determined fragmentation repair criteria, and a repair decision is made based at least in part on the comparison.

    Abstract translation: 公开了至少部分地基于动态确定的修复标准来选择性地修复合成备份中的碎片。 在各种实施例中，相对于包括文件的一部分的一组段来计算位置度量。 将计算的局部度量度与至少部分动态确定的分段修复标准进行比较，并且至少部分地基于比较进行修复决定。

    Content aware hierarchical encryption for secure storage systems
    10.
    发明授权
    Content aware hierarchical encryption for secure storage systems 有权

    公开(公告)号：US10223544B1

    公开(公告)日：2019-03-05

    申请号：US15222435

    申请日：2016-07-28

    Applicant: EMC Corporation

    Inventor： Prashant Pogde ,  Fabiano C. Botelho ,  Nitin Garg

    IPC: G06F21/62

    Abstract: In one embodiment, in response to a request received from a client for retrieving a data object stored in a storage system, a root key is obtained from the request. The data object is represented by metadata in a hierarchical structure having a plurality of levels. Each level includes a plurality of nodes and each node being one of a root node, a leaf node and an intermediate node. The hierarchical structure of metadata associated with the data object is traversed in a top-down approach to decrypt each of a plurality of nodes in the hierarchical structure using a key provided from its parent node, starting from the root node to the leaf nodes, including decrypting the root node using the root key. Decrypted data associated with the plurality of nodes is transmitted to the client.

Patent Agency Ranking