公开(公告)号：US09110797B1

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

申请号：US13535281

申请日：2012-06-27

申请人： Colin L. Lazier

发明人： Colin L. Lazier

IPC分类号： G06F11/00 ,  G06F11/07 ,  G11B20/18

CPC分类号： G06F11/0727 ,  G06F11/1048 ,  G11B20/1883

摘要： Techniques for optimizing data storage are disclosed herein. In particular, methods and systems for implementing redundancy encoding schemes with data storage systems are described. The redundancy encoding schemes may be scheduled according to system and data characteristics. The schemes may span multiple tiers or layers of a storage system. The schemes may be generated, for example, in accordance with a transaction rate requirement, a data durability requirement or in the context of the age of the stored data. The schemes may be designed to rectify entropy-related effects upon data storage. The schemes may include one or more erasure codes or erasure coding schemes. Additionally, methods and systems for improving and/or accounting for failure correlation of various components of the storage system, including that of storage devices such as hard disk drives, are described.

摘要翻译： 本文公开了用于优化数据存储的技术。 特别地，描述了用于实现具有数据存储系统的冗余编码方案的方法和系统。 可以根据系统和数据特性调度冗余编码方案。 这些方案可以跨越存储系统的多层或多层。 可以例如根据交易速率要求，数据持久性要求或者存储数据的年龄的上下文来生成这些方案。 这些方案可能被设计为纠正数据存储时的熵相关影响。 这些方案可以包括一个或多个擦除代码或擦除编码方案。 此外，描述了用于改进和/或计算存储系统的各种组件（包括诸如硬盘驱动器）的存储设备的故障相关性的方法和系统。

公开(公告)号：US20120151000A1

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

申请号：US13399781

申请日：2012-02-17

申请人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

发明人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

IPC分类号： G06F15/16

CPC分类号： H04L43/08 ,  G06F17/30893 ,  G06F17/30902 ,  H04L67/02 ,  H04L67/2847

摘要： In a system in which documents are generated dynamically in response to user requests, historical data is collected regarding data retrieval subtasks, such as service requests, that are performed to generate such documents. This data is used to predict the specific subtasks that will be performed to respond to specific document requests, such that these subtasks may be initiated preemptively at or near the outset of the associated document generation task. A subtask that would ordinarily be postponed pending the outcome of a prior subtask can thereby be performed in parallel with the prior subtask, reducing document generation times. In one embodiment, the historical data is included within, or is used to generate, a mapping table that maps document generation tasks (which may correspond to specific URLs) to the data retrieval subtasks that are frequently performed within such tasks.

摘要翻译： 在响应于用户请求而动态地生成文档的系统中，收集关于用于生成这样的文档而执行的数据检索子任务（例如服务请求）的历史数据。 该数据用于预测将被执行以响应特定文档请求的特定子任务，使得这些子任务可以在相关联的文档生成任务的开始或接近开始时被预先启动。 因此，可以在先前子任务的结果之前通常推迟等待先前子任务的结果的子任务，从而减少文件生成时间。 在一个实施例中，将历史数据包括在或用于生成将文档生成任务（其可以对应于特定URL）映射到在这些任务内经常执行的数据检索子任务的映射表。

公开(公告)号：US08869001B1

公开(公告)日：2014-10-21

申请号：US13535294

申请日：2012-06-27

申请人： Colin L. Lazier

发明人： Colin L. Lazier

IPC分类号： H03M13/00 ,  H03M13/29 ,  G06F3/06

CPC分类号： H03M13/2906 ,  G06F3/0604 ,  G06F11/1076 ,  H03M13/293 ,  H03M13/35 ,  H03M13/373

摘要： Techniques for optimizing data storage are disclosed herein. In particular, methods and systems for implementing redundancy encoding schemes with data storage systems are described. The redundancy encoding schemes may be scheduled according to system and data characteristics. The schemes may span multiple tiers or layers of a storage system. The schemes may be generated, for example, in accordance with a transaction rate requirement, a data durability requirement or in the context of the age of the stored data. The schemes may be designed to rectify entropy-related effects upon data storage. The schemes may include one or more erasure codes or erasure coding schemes. Additionally, methods and systems for improving and/or accounting for failure correlation of various components of the storage system, including that of storage devices such as hard disk drives, are described.

摘要翻译： 本文公开了用于优化数据存储的技术。 特别地，描述了用于实现具有数据存储系统的冗余编码方案的方法和系统。 可以根据系统和数据特性调度冗余编码方案。 这些方案可以跨越存储系统的多层或多层。 可以例如根据交易速率要求，数据持久性要求或者存储数据的年龄的上下文来生成这些方案。 这些方案可能被设计为纠正数据存储时的熵相关影响。 这些方案可以包括一个或多个擦除代码或擦除编码方案。 此外，描述了用于改进和/或计算存储系统的各种组件（包括诸如硬盘驱动器）的存储设备的故障相关性的方法和系统。

公开(公告)号：US09165002B1

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

申请号：US13535195

申请日：2012-06-27

申请人： Colin L. Lazier

发明人： Colin L. Lazier

IPC分类号： G06F17/30

CPC分类号： G06F17/30085 ,  G06F17/30117

摘要： Systems and methods are provided herein for storing data to enable inexpensive and/or guaranteed deletion of data. In various embodiments, a customer specifies a data deletion indication associated with a data object to be stored, specifying when and/or how to delete the data object. Such a data deletion indication may be based, for example, on a regulatory compliance requirement. Based at least in part on the data deletion indication, the storage system may select, from a plurality of storage devices, a storage device to store the data object. Data objects with similar data deletion indications may be stored in the same storage device. In some embodiments, a data object stored in a storage device using the methods described herein may be deleted as part of the deletion of all or a portion of the storage device near a time specified by the data deletion indication of the data object.

摘要翻译： 本文提供的系统和方法用于存储数据以实现数据的廉价和/或有保证的删除。 在各种实施例中，客户指定与要存储的数据对象相关联的数据删除指示，指定何时和/或如何删除数据对象。 这样的数据删除指示可以例如基于法规遵从性要求。 至少部分地基于数据删除指示，存储系统可以从多个存储设备中选择存储设备来存储数据对象。 具有类似数据删除指示的数据对象可以存储在同一存储设备中。 在一些实施例中，使用本文描述的方法存储在存储设备中的数据对象可以被删除，作为在由数据对象的数据删除指示指定的时间附近删除所有或一部分存储设备的一部分。

公开(公告)号：US08935221B1

公开(公告)日：2015-01-13

申请号：US13558070

申请日：2012-07-25

申请人： Colin L. Lazier ,  Brian J. Deen

发明人： Colin L. Lazier ,  Brian J. Deen

IPC分类号： G06F7/00 ,  G06F17/00 ,  G06F17/30

CPC分类号： G06F17/30386 ,  G06F11/00 ,  G06F11/14 ,  G06F17/30303

摘要： In response to receiving a request from a client to store an object, a key-durable storage system may assign the object to a volume in its data store, generate a key for the object (e.g., an opaque identifier that encodes information for locating the object in the data store), store the object on one disk in the assigned volume, store the key redundantly in the assigned volume (e.g., using a replication or erasure coding technique), and may return the key to the client. To retrieve the object, the client may send a request including the key, and the system may return the object to the client. If a disk fails, the system may determine which objects were lost, and may return the corresponding keys to the appropriate clients in a notification. The system may be used to back up a more expensive object-redundant storage system.

摘要翻译： 响应于从客户端接收到存储对象的请求，密钥持久存储系统可以将对象分配给其数据存储中的卷，生成对象的密钥（例如，编码用于定位对象的信息的不透明标识符 对象在数据存储中），将对象存储在分配的卷中的一个磁盘上，将密钥冗余地存储在分配的卷中（例如，使用复制或擦除编码技术），并且可以将密钥返回给客户端。 为了检索对象，客户端可以发送包括密钥的请求，并且系统可以将对象返回给客户端。 如果磁盘发生故障，系统可能会确定丢失哪些对象，并可能会在通知中将相应的密钥返回给相应的客户端。 该系统可用于备份更昂贵的对象冗余存储系统。

公开(公告)号：US08806296B1

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

申请号：US13535200

申请日：2012-06-27

申请人： Colin L. Lazier

发明人： Colin L. Lazier

IPC分类号： G11C29/00 ,  G06F3/06 ,  H03M13/29 ,  G06F17/30 ,  G06F11/08 ,  H03M13/03

CPC分类号： G06F3/0604 ,  G06F3/06 ,  G06F3/0614 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/085 ,  G06F11/1076 ,  G06F17/30073 ,  H03M13/03 ,  H03M13/293

摘要： Techniques for optimizing data storage are disclosed herein. In particular, methods and systems for implementing redundancy encoding schemes with data storage systems are described. The redundancy encoding schemes may be scheduled according to system and data characteristics. The schemes may span multiple tiers or layers of a storage system. The schemes may be generated, for example, in accordance with a transaction rate requirement, a data durability requirement or in the context of the age of the stored data. The schemes may be designed to rectify entropy-related effects upon data storage. The schemes may include one or more erasure codes or erasure coding schemes. Additionally, methods and systems for improving and/or accounting for failure correlation of various components of the storage system, including that of storage devices such as hard disk drives, are described.

摘要翻译： 本文公开了用于优化数据存储的技术。 特别地，描述了用于实现具有数据存储系统的冗余编码方案的方法和系统。 可以根据系统和数据特性调度冗余编码方案。 这些方案可以跨越存储系统的多层或多层。 可以例如根据交易速率要求，数据持久性要求或者存储数据的年龄的上下文来生成这些方案。 这些方案可能被设计为纠正数据存储时的熵相关影响。 这些方案可以包括一个或多个擦除代码或擦除编码方案。 此外，描述了用于改进和/或计算存储系统的各种组件（包括诸如硬盘驱动器）的存储设备的故障相关性的方法和系统。

公开(公告)号：US08566788B2

公开(公告)日：2013-10-22

申请号：US13399781

申请日：2012-02-17

申请人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

发明人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

IPC分类号： G06F9/44 ,  G06F15/16 ,  G06F15/167 ,  G06F17/30

CPC分类号： H04L43/08 ,  G06F17/30893 ,  G06F17/30902 ,  H04L67/02 ,  H04L67/2847

摘要： In a system in which documents are generated dynamically in response to user requests, historical data is collected regarding data retrieval subtasks, such as service requests, that are performed to generate such documents. This data is used to predict the specific subtasks that will be performed to respond to specific document requests, such that these subtasks may be initiated preemptively at or near the outset of the associated document generation task. A subtask that would ordinarily be postponed pending the outcome of a prior subtask can thereby be performed in parallel with the prior subtask, reducing document generation times. In one embodiment, the historical data is included within, or is used to generate, a mapping table that maps document generation tasks (which may correspond to specific URLs) to the data retrieval subtasks that are frequently performed within such tasks.

摘要翻译： 在响应于用户请求而动态地生成文档的系统中，收集关于用于生成这样的文档而执行的数据检索子任务（例如服务请求）的历史数据。 该数据用于预测将被执行以响应特定文档请求的特定子任务，使得这些子任务可以在相关联的文档生成任务的开始或接近开始时被预先启动。 因此，可以在先前子任务的结果之前通常推迟等待先前子任务的结果的子任务，从而减少文件生成时间。 在一个实施例中，将历史数据包括在或用于生成将文档生成任务（其可以对应于特定URL）映射到在这些任务内经常执行的数据检索子任务的映射表。

公开(公告)号：US08136089B2

公开(公告)日：2012-03-13

申请号：US11954175

申请日：2007-12-11

申请人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

发明人： Ryan J. Snodgrass ,  Colin L. Lazier ,  Paul G. Nordstrom

IPC分类号： G06F9/44 ,  G06F15/16 ,  G06F15/167 ,  G06F17/30

CPC分类号： H04L43/08 ,  G06F17/30893 ,  G06F17/30902 ,  H04L67/02 ,  H04L67/2847

摘要： In a system in which documents are generated dynamically in response to user requests, historical data is collected regarding data retrieval subtasks, such as service requests, that are performed to generate such documents. This data is used to predict the specific subtasks that will be performed to respond to specific document requests, such that these subtasks may be initiated preemptively at or near the outset of the associated document generation task. A subtask that would ordinarily be postponed pending the outcome of a prior subtask can thereby be performed in parallel with the prior subtask, reducing document generation times. In one embodiment, the historical data is included within, or is used to generate, a mapping table that maps document generation tasks (which may correspond to specific URLs) to the data retrieval subtasks that are frequently performed within such tasks.

摘要翻译： 在响应于用户请求而动态地生成文档的系统中，收集关于用于生成这样的文档而执行的数据检索子任务（例如服务请求）的历史数据。 该数据用于预测将被执行以响应特定文档请求的特定子任务，使得这些子任务可以在相关联的文档生成任务的开始或接近开始时被预先启动。 因此，可以在先前子任务的结果之前通常推迟等待先前子任务的结果的子任务，从而减少文件生成时间。 在一个实施例中，将历史数据包括在或用于生成将文档生成任务（其可以对应于特定URL）映射到在这些任务内经常执行的数据检索子任务的映射表。

公开(公告)号：US07331038B1

公开(公告)日：2008-02-12

申请号：US10612529

申请日：2003-07-02

申请人： Ryan J. Snodgrass ,  Colin L. Lazier

发明人： Ryan J. Snodgrass ,  Colin L. Lazier

IPC分类号： G06F9/44 ,  G06F3/00

CPC分类号： H04L43/08 ,  G06F17/30893 ,  G06F17/30902 ,  H04L67/02 ,  H04L67/2847

摘要： In a system in which documents are generated dynamically in response to user requests, historical data is collected regarding data retrieval subtasks, such as service requests, that are performed to generate such documents. This data is used to predict the specific subtasks that will be performed to respond to specific document requests, such that these subtasks may be initiated preemptively at or near the outset of the associated page generation task. A subtask that would ordinarily be postponed pending the outcome of a prior subtask can therefore be performed in parallel with the prior subtask, reducing document generation times. In one embodiment, the historical data is included within, or is used to generate, a mapping table that maps document generation tasks (which may correspond to specific URLs) to the data retrieval subtasks that are frequently performed within such tasks.

摘要翻译： 在响应于用户请求而动态地生成文档的系统中，收集关于用于生成这样的文档而执行的数据检索子任务（例如服务请求）的历史数据。 该数据用于预测将被执行以响应特定文档请求的特定子任务，使得这些子任务可以在关联的页面生成任务的开始或接近开始时被初始化地发起。 因此，可以与先前的子任务并行地执行通常在先前子任务的结果之前推迟的子任务，从而减少了文档生成时间。 在一个实施例中，将历史数据包括在或用于生成将文档生成任务（其可以对应于特定URL）映射到在这些任务内经常执行的数据检索子任务的映射表。