公开(公告)号：US10127123B2

公开(公告)日：2018-11-13

申请号：US15413764

申请日：2017-01-24

Applicant: Amazon Technologies, Inc.

Inventor： Michael T. Helmick ,  Jakub Kulesza ,  Timothy Andrew Rath ,  Stefano Stefani ,  David Alan Lutz

IPC: G06F11/00 ,  G06F11/20

Abstract: Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item that is subject to a data item update request is updated from a master node to a plurality of slave notes. The update of the data item is determined to be locality-based durable based at least in part on acknowledgements received from the slave nodes. Upon detection that the master node has failed, a new master candidate is determined via an election among the plurality of slave nodes.

公开(公告)号：US09754009B2

公开(公告)日：2017-09-05

申请号：US15250435

申请日：2016-08-29

Applicant: Amazon Technologies, Inc.

Inventor： Swaminathan Sivasubramanian ,  Stefano Stefani ,  Chiranjeeb Buragohain ,  Rande A. Blackman ,  Timothy Andrew Rath ,  Raymond S. Bradford ,  Grant Alexander MacDonald McAlister ,  Jakub Kulesza ,  James R. Hamilton ,  Luis Felipe Cabrera

IPC: G06F17/30 ,  G06F9/50 ,  H04L29/08 ,  G06F12/0846

CPC classification number: G06F17/30584 ,  G06F9/5061 ,  G06F12/0848 ,  G06F17/30286 ,  G06F17/30289 ,  G06F17/30303 ,  G06F17/30306 ,  G06F17/30321 ,  G06F17/30339 ,  G06F17/3056 ,  H04L67/02 ,  H04L67/1097 ,  H04L67/2804 ,  Y10S707/968 ,  Y10S707/972

Abstract: A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

公开(公告)号：US09602590B1

公开(公告)日：2017-03-21

申请号：US14475190

申请日：2014-09-02

Applicant: Amazon Technologies, Inc.

Inventor： Yijun Lu ,  Stuart Henry Seelye Marshall ,  Timothy Andrew Rath ,  Rande Anthony Blackman ,  Wei Xiao

IPC: G06F15/16 ,  H04L29/08 ,  H04L12/911

CPC classification number: H04L67/10 ,  G06F9/50 ,  H04L47/70

Abstract: Partitions of a hosted computing service may be maintained on a computing node. Processing of requests to access the partition may be limited to constrain capacity utilization to a provisioned amount of capacity reserved for the partition. A second, additional amount of capacity may be associated with the partition and may reflect potential future changes to the provisioned amount of capacity. A sum of provisioned and additional capacities associated with partitions on a computing node may be calculated. The computing node may be ranked, relative to other computing nodes, for maintaining new or relocated partitions based on the sum.

公开(公告)号：US09432459B2

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

申请号：US14579602

申请日：2014-12-22

Applicant: Amazon Technologies, Inc.

Inventor： Swaminathan Sivasubramanian ,  Stefano Stefani ,  Chiranjeeb Buragahain ,  Rande A. Blackman ,  Timothy Andrew Rath ,  Raymond S. Bradford ,  Grant Alexander MacDonald McAlister ,  Jakub Kulesza ,  James R. Hamilton ,  Luis Felipe Cabrera

IPC: G06F17/30 ,  H04L29/08 ,  G06F9/50 ,  G06F12/08

CPC classification number: G06F17/30584 ,  G06F9/5061 ,  G06F12/0848 ,  G06F17/30286 ,  G06F17/30289 ,  G06F17/30303 ,  G06F17/30306 ,  G06F17/30321 ,  G06F17/30339 ,  G06F17/3056 ,  H04L67/02 ,  H04L67/1097 ,  H04L67/2804 ,  Y10S707/968 ,  Y10S707/972

Abstract: A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies.

公开(公告)号：US09419904B2

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

申请号：US14617671

申请日：2015-02-09

Applicant: Amazon Technologies, Inc.

Inventor： Wei Xiao ,  David Alan Lutz ,  Timothy Andrew Rath ,  Maximiliano Maccanti ,  Miguel Mascarenhas Filipe ,  David Craig Yanacek

IPC: H04L12/819 ,  H04L12/801 ,  H04L29/08

CPC classification number: H04L47/215 ,  H04L47/12 ,  H04L67/327

Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. An admission control mechanism may manage requests based on tokens, each of which represents a fixed amount of work. The tokens may be added to a token bucket at rate that is dependent on a target work throughput rate while the number of tokens in the bucket does not exceed its maximum capacity. If at least a pre-determined minimum number of tokens is present in the bucket when a service request is received, it may be serviced. Servicing a request may include deducting an initial number of tokens from the bucket, determining that the amount of work performed in servicing the request is different than that represented by the initially deducted tokens, and deducting additional tokens from or replacing tokens in the bucket to reflect the difference.

公开(公告)号：US20160179921A1

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

申请号：US14578786

申请日：2014-12-22

Applicant: Amazon Technologies, Inc.

Inventor： Anurag Windlass Gupta ,  Timothy Andrew Rath ,  Srinivasan Sundar Raghavan ,  Santosh Kalki

IPC: G06F17/30

Abstract: A corpus of information describing queries used to access a transactional data store may be used to identify analytical relationships that are not explicitly defined in a schema or supplied by a user. Join relationships may be identified based on field coincidence in elements of queries in the corpus. Join relationships may be indicative of dimensions and attributes of a dimension. Hierarchy levels for a dimension may be identified based on factors including data type, reference in an aggregating clause, and reference in a grouping clause.

Abstract translation: 描述用于访问事务数据存储的查询的信息语料库可用于识别在模式中未明确定义或由用户提供的分析关系。 可以基于语料库中的查询元素中的字段重合来识别加入关系。 连接关系可以表示维度的维度和属性。 可以基于包括数据类型，聚合子句中的引用和分组子句中的引用的因素来标识维的层次结构级别。

公开(公告)号：US09367252B2

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

申请号：US14834392

申请日：2015-08-24

Applicant: Amazon Technologies, Inc.

Inventor： Timothy Andrew Rath ,  Jakub Kulesza ,  David Alan Lutz

IPC: G06F11/00 ,  G06F3/06 ,  G06F11/20 ,  H04L29/08

CPC classification number: H04L41/0668 ,  G06F3/0617 ,  G06F3/0653 ,  G06F3/0659 ,  G06F3/0683 ,  G06F11/1425 ,  G06F11/1662 ,  G06F11/2028 ,  G06F11/2041 ,  G06F11/2048 ,  G06F11/2094 ,  G06F11/2097 ,  G06F2201/825 ,  H04L67/1097 ,  H04L67/16

Abstract: A system that implements a data storage service may store data on behalf of storage service clients. The system may maintain data in multiple replicas of various partitions that are stored on respective computing nodes in the system. The system may employ a single master failover protocol, usable when a replica attempts to become the master replica for a replica group of which it is a member. Attempting to become the master replica may include acquiring a lock associated with the replica group, and gathering state information from the other replicas in the group. The state information may indicate whether another replica supports the attempt (in which case it is included in a failover quorum) or stores more recent data or metadata than the replica attempting to become the master (in which case synchronization may be required). If the failover quorum includes enough replicas, the replica may become the master.

公开(公告)号：US09239852B1

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

申请号：US13802069

申请日：2013-03-13

Applicant: Amazon Technologies, Inc.

Inventor： David Alan Lutz ,  Xianglong Huang ,  Wei Xiao ,  Stefano Stefani ,  Timothy Andrew Rath ,  Somasundaram Perianayagam

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30584 ,  G06F17/3033

Abstract: A distributed database management system comprising a plurality of computing nodes may distribute data evenly across all nodes. A definition of a primary key that divides the primary key into at least a first key portion and a second key portion may be utilized to locate items related by a first key portion to a specific computing node. Application-consistent queries, local transactions and pivoting operations may be performed on items related by a first key portion.

Abstract translation: 包括多个计算节点的分布式数据库管理系统可以在所有节点上均匀分布数据。 将主密钥划分为至少第一密钥部分和第二密钥部分的主密钥的定义可以用于将由第一密钥部分相关的条目定位到特定计算节点。 应用程序一致性查询，本地事务和枢转操作可以在与第一关键部分相关的项目上执行。

公开(公告)号：US20150370883A1

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

申请号：US14494524

申请日：2014-09-23

Applicant: Amazon Technologies, Inc.

Inventor： Santosh Kalki ,  Srinivasan Sundar Raghavan ,  Timothy Andrew Rath ,  Mukul Vijay Karnik ,  Amol Devgan ,  Swaminathan Sivasubramanian

IPC: G06F17/30

Abstract: An online analytical processing system may comprise an n-dimensional cube partitioned into slices, in which each slice may represent data points at the intersections of fixed and variable dimensions. Computation of data points within a slice may be deferred. A dependency graph may be initially constructed, in which the dependency graph is utilized in a subsequent computation. Calculation of data points may be prioritized based on information indicative of a chance that the data points will be accessed.

Abstract translation: 在线分析处理系统可以包括分割成切片的n维立方体，其中每个切片可以表示固定和可变维度的交点处的数据点。 切片内数据点的计算可能会延迟。 可以最初构建依赖图，其中在随后的计算中使用依赖图。 可以基于指示将访问数据点的机会的信息来优先考虑数据点的计算。

公开(公告)号：US20150370882A1

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

申请号：US14494513

申请日：2014-09-23

Applicant: Amazon Technologies, Inc.

Inventor： Santosh Kalki ,  Srinivasan Sundar Raghavan ,  Mukul Vijay Karnik ,  Timothy Andrew Rath ,  Amol Devgan ,  Swaminathan Sivasubramanian

IPC: G06F17/30

Abstract: An online analytical processing system may comprise an n-dimensional cube structured using slice-based partitioning in which each slice comprises data points corresponding to a set of dimension values fixed across the slice and a set of dimension values allowed to vary. Slices may be partitioned and replicated across computing nodes. Views of the n-dimensional cube may be partially materialized by determining dependencies between slices. A central data dictionary may maintain information about slices and slice dependencies. Dimensions may be added by adding a new slice without requiring immediate recomputation of existing data points.

Abstract translation: 在线分析处理系统可以包括使用基于片段的分区结构的n维立方体，其中每个切片包括对应于跨越切片固定的一组维度值的数据点和允许变化的一组维度值。 切片可以跨计算节点进行分区和复制。 可以通过确定切片之间的依赖性来部分地实现n维立方体的视图。 中央数据字典可以维护有关切片和切片依赖关系的信息。 可以通过添加新切片而不需要立即重新计算现有数据点来添加尺寸。