知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

65 records (took 0.027 seconds)

    Non-parity in grid encoded data storage systems
    31.
    发明授权
    Non-parity in grid encoded data storage systems 有权

    公开(公告)号：US09998539B1

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

    申请号：US14789815

    申请日：2015-07-01

    Applicant: Amazon Technologies, Inc.

    Inventor： Adam Frederick Brock ,  Bryan James Donlan ,  James Caleb Kirschner

    IPC: G06F15/167 ,  H04L29/08

    CPC classification number: H04L67/1097 ,  G06F11/08

    Abstract: Techniques for encoding data storage systems using grid-encoded data storage systems with non-parity linear redundancy encoding schemes are described herein. A grid of shards with derived shards and data shards is generated that is indexed by a first index and a second index and is configured so that each shard is reproducible from other shards with the same first index and is also reproducible from other shards with the same second index. The grid of shards is further configured so that each data row of the grid of shards has at least two derived shards and at least twice as many data shards as derived shards.

    Rebundling grid encoded data storage systems
    32.
    发明授权
    Rebundling grid encoded data storage systems 有权

    公开(公告)号：US09959167B1

    公开(公告)日：2018-05-01

    申请号：US14789825

    申请日：2015-07-01

    Applicant: Amazon Technologies, Inc.

    Inventor： Bryan James Donlan ,  Colin Laird Lazier

    IPC: G06F11/00 ,  G06F11/10 ,  H04L29/08

    CPC classification number: G06F11/1076 ,  H04L67/1095 ,  H04L67/1097

    Abstract: Techniques for rebundling grid encoded data storage systems are described herein. A new grid of shards is created based in part on shards from a first grid of shards. The second grid of shards contains data shards, including one or more data shards from the first grid of shards, and derived shards that are indexed by row and column and is configured so that shards in the second grid are reproducible from shards in the same row using a first redundancy code and are also reproducible from shards in the same column using a second redundancy code. The derived shards of the second grid of shards are then derived from other shards in the second grid of shards using the first redundancy code and the second redundancy code.

    Recovery of corrupted erasure-coded data files
    34.
    发明授权
    Recovery of corrupted erasure-coded data files 有权
    恢复损坏的擦除编码数据文件

    公开(公告)号：US09098447B1

    公开(公告)日：2015-08-04

    申请号：US13898071

    申请日：2013-05-20

    Applicant: Amazon Technologies, Inc.

    Inventor： Bryan James Donlan ,  Paul David Franklin

    IPC: G06F11/14 ,  H03M13/29 ,  H03M13/37 ,  H03M13/03 ,  H03M13/09 ,  H03M13/15 ,  H03M13/11 ,  H03M13/00 ,  H03M13/35

    CPC classification number: H03M13/35 ,  G06F11/1451 ,  G06F11/1456 ,  G06F11/2094 ,  G06F2201/83 ,  H03M13/03 ,  H03M13/09 ,  H03M13/1102 ,  H03M13/1111 ,  H03M13/1191 ,  H03M13/15 ,  H03M13/1515 ,  H03M13/2906 ,  H03M13/293 ,  H03M13/356 ,  H03M13/373 ,  H03M13/3761 ,  H03M13/6356 ,  H03M13/6362

    Abstract: If none of the fragments of an erasure-coded data file have become corrupted then the original data file can be readily reconstructed. If one or more fragments of an erasure-coded data file have become corrupted it may still be possible to find a combination of fragments that reconstruct the original data file, but the number of possible combinations may be impracticably large. If an attempt with a first set of fragments fails, an efficient approach is to use an independent set of fragments for the second attempt. Then, for further attempts, the results of a current attempt are compared with previous results. If a match is found then the original data file has been reconstructed. An original data file may also be reconstructed by separately recovering each data block of the data file from corresponding fragment blocks and assembling the data file from the recovered data blocks.

    Abstract translation: 如果擦除编码的数据文件的片段都没有被破坏，则可以容易地重构原始数据文件。 如果擦除编码的数据文件的一个或多个片段已经被破坏，则仍然可能找到重建原始数据文件的片段的组合，但是可能的组合的数量可能是不切实际的。 如果尝试使用第一组片段失败，则有效的方法是使用独立的片段来进行第二次尝试。 然后，为了进一步尝试，将当前尝试的结果与先前的结果进行比较。 如果发现匹配，则原始数据文件已被重构。 原始数据文件也可以通过从相应的分段块单独地恢复数据文件的每个数据块并从恢复的数据块组装数据文件来重建。

    Techniques for distributing verification checks incident to data deletion
    37.
    发明授权
    Techniques for distributing verification checks incident to data deletion 有权

    公开(公告)号：US10733145B1

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

    申请号：US14572603

    申请日：2014-12-16

    Applicant: Amazon Technologies, Inc.

    Inventor： Ryan Charles Schmitt ,  Claire Elizabeth Suver ,  Mark Christopher Seigle ,  Bryan James Donlan

    IPC: G06F16/16 ,  G06F11/10

    Abstract: Techniques described and suggested herein include distributed deletion request processing and verification. For example, incident to migration of original data from a first data store to a second data store, verifications and confirmations related to removing the original data from the first data store may be performed so as to ensure the integrity of the original data represented on the second data store prior to removing the actual original data on the first data store. In some embodiments, the verifications and confirmations performed in connection with a deletion request may be apportioned to multiple entities, each of which may not fully trust the others. As a result, in some embodiments, a given deletion request may only be fulfilled if all of the entities involved in the verification process individually provide authorization to execute the deletion request.

    Volume cohorts in object-redundant storage systems
    38.
    发明授权
    Volume cohorts in object-redundant storage systems 有权

    公开(公告)号：US10685037B2

    公开(公告)日：2020-06-16

    申请号：US14133522

    申请日：2013-12-18

    Applicant: Amazon Technologies, Inc.

    Inventor： Paul David Franklin ,  Bryan James Donlan

    IPC: G06F16/27

    Abstract: Cohorts may be created on storage nodes in an object-redundant storage system that uses replication and/or a redundant encoding technique. In a cohort with N nodes, M data elements (replicas or shards) of an object are stored to M of the nodes that are randomly (or otherwise) selected from the N nodes. Metadata for locating other data elements for an object in the cohort may be stored with one or more of the data elements in the cohort. To retrieve an object from a cohort, a subset of the nodes may be queried; the subset may be randomly or otherwise selected. If enough data elements are retrieved for the object from the queried nodes, the object is provided to the requester. Otherwise, additional data elements may be retrieved according to the metadata returned with a data element or by querying additional nodes.

Patent Agency Ranking