-
11.发明申请VOLUME-LEVEL REDUNDANCY CODING TECHNIQUES FOR SEQUENTIAL TRANSFER OPTIMIZED STORAGE DEVICES 有权用于顺序传输优化存储设备的容量级冗余编码技术公开(公告)号：US20160179824A1
公开(公告)日：2016-06-23
申请号：US14578130
申请日：2014-12-19
Applicant: Amazon Technologies, Inc.
Inventor： Bryan James Donlan , Paul David Franklin , Claire Elizabeth Suver
CPC classification number: G06F17/30073 , G06F11/1446 , H04L67/10
Abstract: Techniques described and suggested herein include systems and methods for storing, indexing, and retrieving original data of data archives on data storage systems using redundancy coding techniques. For example, redundancy codes, such as erasure codes, may be applied to archives (such as those received from a customer of a computing resource service provider) so as allow the storage of original data of the individual archives available on a minimum of volumes, such as those of a data storage system, while retaining availability, durability, and other guarantees imparted by the application of the redundancy code. Sparse indexing techniques may be implemented so as to reduce the footprint of indexes used to locate the original data, once stored.
Abstract translation: 本文描述和建议的技术包括使用冗余编码技术在数据存储系统上存储，索引和检索数据归档的原始数据的系统和方法。 例如，诸如擦除代码的冗余代码可以应用于存档（诸如从计算资源服务提供商的客户接收到的那些），以便允许存储最小量的可用的各个归档的原始数据， 例如数据存储系统的那些，同时保持可用性，耐用性以及由应用冗余码赋予的其他保证。 可以实现稀疏索引技术，以便一旦存储就减少用于定位原始数据的索引的占用空间。
-
公开(公告)号：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
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.
-
公开(公告)号：US10706037B2
公开(公告)日：2020-07-07
申请号：US15965567
申请日：2018-04-27
Applicant: Amazon Technologies, Inc.
Inventor： Charles Alexander Carman , Claire Elizabeth Suver , Melissa Elaine Davis , Paul Matthew Buddington , Christopher Allen Suver , Lukasz Wojciech Cwik , Chelsea Celest Krueger
Abstract: Non-blocking processing of federated transactions may be implemented for distributed data partitions. A transaction may be received that specifies keys at data nodes to lock in order to perform the transaction. Lock requests are generated and sent to the data nodes which identify sibling keys to be locked at other data nodes for the transaction. In response to receiving the lock requests, data nodes may send to lock queues indicating other lock requests for the keys at the data node. An evaluation of the lock queues based, at least in part, on an ordering of the lock requests in the lock queues may be performed to identify a particular transaction to commit. Once identified, a request to commit the identified transaction may be sent to the particular data nodes indicated by the sibling keys in a lock request for the identified transaction.
-
公开(公告)号：US10417190B1
公开(公告)日：2019-09-17
申请号：US14496377
申请日：2014-09-25
Applicant: Amazon Technologies, Inc.
Inventor： Bryan James Donlan , Claire Elizabeth Suver
Abstract: A system and method for obtaining a request to perform a data operation with a volume, wherein the volume is a logical storage space in which data objects may be stored, determining a plurality of zones for performing the data operation with the volume, wherein each zone of the plurality of zones comprises a series of sectors of a computer-readable storage medium that forms an append-only section of the computer-readable storage medium, and performing the data operation with the volume on the plurality of zones.
-
Patent Agency Ranking
公开(公告)号：US10089179B2
公开(公告)日：2018-10-02
申请号：US15640067
申请日：2017-06-30
Applicant: Amazon Technologies, Inc.
Inventor： Paul David Franklin , Bryan James Donlan , Claire Elizabeth Suver
Abstract: Techniques described and suggested herein include systems and methods for storing, indexing, and retrieving original data of data archives on data storage systems using redundancy coding techniques. For example, redundancy codes, such as erasure codes, may be applied to archives (such as those received from a customer of a computing resource service provider) so as allow the storage of original data of the individual archives available on a minimum of volumes, such as those of a data storage system, while retaining availability, durability, and other guarantees imparted by the application of the redundancy code. Sparse indexing techniques may be implemented so as to reduce the footprint of indexes used to locate the original data, once stored. The volumes may be apportioned into failure-decorrelated subsets, and archives stored thereto may be apportioned to such subsets.
-
公开(公告)号：US10073730B1
公开(公告)日：2018-09-11
申请号：US14548182
申请日：2014-11-19
Applicant: Amazon Technologies, Inc.
CPC classification number: G06F11/1004 , H03M13/00 , H03M13/3761
Abstract: Techniques described and suggested herein include various methods and systems for verifying integrity of redundancy coded data, such as erasure coded data shards. In some embodiments, a quantity of redundancy coded data elements, hereafter referred to as data shards (e.g., erasure coded data shards), sufficient to reconstruct the original data element from which the redundancy coded data elements are derived, is used to generate reconstructed data shards to be used for checking the validity of analogous data shards stored for the original data element.
-
公开(公告)号：US09697080B2
公开(公告)日：2017-07-04
申请号：US15283023
申请日：2016-09-30
Applicant: Amazon Technologies, Inc.
Inventor： Paul David Franklin , Bryan James Donlan , Claire Elizabeth Suver
CPC classification number: G06F11/1076 , G06F3/06 , G06F11/1068 , G06F11/1072 , G06F11/1088
Abstract: Techniques described and suggested herein include systems and methods for storing, indexing, and retrieving original data of data archives on data storage systems using redundancy coding techniques. For example, redundancy codes, such as erasure codes, may be applied to archives (such as those received from a customer of a computing resource service provider) so as allow the storage of original data of the individual archives available on a minimum of volumes, such as those of a data storage system, while retaining availability, durability, and other guarantees imparted by the application of the redundancy code. Sparse indexing techniques may be implemented so as to reduce the footprint of indexes used to locate the original data, once stored. The volumes may be apportioned into failure-decorrelated subsets, and archives stored thereto may be apportioned to such subsets.
-
18.发明申请公开(公告)号：US20170060687A1
公开(公告)日：2017-03-02
申请号：US15350946
申请日：2016-11-14
Applicant: Amazon Technologies, Inc.
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F11/1088 , G06F11/167 , G06F2211/1028 , G06F2211/104 , H03M13/1515 , H03M13/154 , H03M13/616
Abstract: Techniques described and suggested herein include systems and methods for precomputing regeneration information for data archives (“archives”) that have been processed and stored using redundancy coding techniques. For example, regeneration information, such as redundancy code-related matrices (such as inverted matrices based on, e.g., a generator matrix for the selected redundancy code) corresponding to subsets of the shards, is computed for each subset and, in some embodiments, stored for use in the event that one or more shards becomes unavailable, e.g., so as to more efficiently and/or quickly regenerate a replacement shard.
Abstract translation: 本文描述和提出的技术包括用于使用冗余编码技术预处理和存储的数据归档（“档案”）的再计算再生信息的系统和方法。 例如，针对每个子集计算对应于碎片子集的冗余代码相关矩阵（诸如基于例如用于所选择的冗余码的生成矩阵的倒排矩阵）的再生信息，并且在一些实施例中， 存储用于在一个或多个分片变得不可用的情况下使用，例如，以便更有效地和/或快速地再生替换分片。
-
19.发明授权公开(公告)号：US09495249B1
公开(公告)日：2016-11-15
申请号：US14675471
申请日：2015-03-31
Applicant: Amazon Technologies, Inc.
CPC classification number: G06F11/1076 , G06F3/0619 , G06F3/064 , G06F3/067 , G06F11/1088 , G06F11/167 , G06F2211/1028 , G06F2211/104 , H03M13/1515 , H03M13/154 , H03M13/616
Abstract: Techniques described and suggested herein include systems and methods for precomputing regeneration information for data archives (“archives”) that have been processed and stored using redundancy coding techniques. For example, regeneration information, such as redundancy code-related matrices (such as inverted matrices based on, e.g., a generator matrix for the selected redundancy code) corresponding to subsets of the shards, is computed for each subset and, in some embodiments, stored for use in the event that one or more shards becomes unavailable, e.g., so as to more efficiently and/or quickly regenerate a replacement shard.
Abstract translation: 本文描述和提出的技术包括用于使用冗余编码技术预处理和存储的数据归档（“档案”）的再计算再生信息的系统和方法。 例如，针对每个子集计算对应于碎片子集的冗余代码相关矩阵（诸如基于例如用于所选择的冗余码的生成矩阵的倒排矩阵）的再生信息，并且在一些实施例中， 存储用于在一个或多个分片变得不可用的情况下使用，例如，以便更有效地和/或快速地再生替换分片。
-
-
-
-
-
-
-
-
Search Results
19
records
(took 0.023 seconds)
