-
公开(公告)号：US20150370872A1
公开(公告)日：2015-12-24
申请号：US14494413
申请日：2014-09-23
Applicant: Amazon Technologies, Inc.
Inventor： Srinivasan Sundar Raghavan , Swaminathan Sivasubramanian , Timothy Andrew Rath , Mukul Vijay Karnik , Amol Devgan , Santosh Kalki
CPC classification number: G06F17/30592 , G06F17/30221 , G06F17/30386 , G06F17/30572 , G06F17/30584 , G06F17/30589 , G06F17/30961 , G06F21/6236 , H04L63/10
Abstract: An analytics module may be embedded into an application developed, published, or used by an entity in addition to the owner of the data under analysis. An access token may be submitted by the analytics module to a provider of hosted services. The access token may correspond to an n-dimensional cube containing data at a level of granularity permitted to the application. The access token may incorporate additional policies controlling access to the corresponding n-dimensional cube.
Abstract translation: 除了被分析数据的所有者之外，分析模块可能嵌入到由实体开发，发布或使用的应用程序中。 访问令牌可能由分析模块提交给托管服务提供商。 访问令牌可以对应于包含以应用程序允许的粒度级别的数据的n维多维数据集。 访问令牌可以包含控制对相应的n维立方体的访问的附加策略。
-
公开(公告)号：US11928029B2
公开(公告)日：2024-03-12
申请号：US17019072
申请日：2020-09-11
Applicant: Amazon Technologies, Inc.
Inventor： Maximiliano Maccanti , Timothy Andrew Rath , Rama Krishna Sandeep Pokkunuri , Akshat Vig , Clarence Wing Yin Ng , Srivaths Badrinath Copparam , Rajaprabhu Thiruchi Loganathan , Wei Xiao , William Alexander Stevenson
CPC classification number: G06F11/1451 , G06F11/1464 , G06F11/1469 , G06F11/1458 , G06F11/2094 , G06F2201/80
Abstract: A system that implements a data storage service may store data for a database table in multiple replicated partitions on respective storage nodes. In response to a request to back up a table, the service may back up individual partitions of the table to a remote storage system independently and (in some cases) in parallel, and may update (or create) and store metadata about the table and its partitions on storage nodes of the data storage service and/or in the remote storage system. Backing up each partition may include exporting it from the database in which the table is stored, packaging and compressing the exported partition for upload, and uploading the exported, packaged, and compressed partition to the remote storage system. The remote storage system may be a key-value durable storage system in which each backed-up partition is accessible using its partition identifier as the key.
-
公开(公告)号：US11841844B2
公开(公告)日：2023-12-12
申请号：US13898151
申请日：2013-05-20
Applicant: Amazon Technologies, Inc.
Inventor： Wei Xiao , Clarence Wing Yin Ng , Medhavi Dhawan , Timothy Andrew Rath , Stefano Stefani
IPC: G06F16/23
CPC classification number: G06F16/2358
Abstract: Distributed database management systems may maintain collections of items spanning multiple partitions. Index structures may correspond to items on one partition or to items on multiple partitions. Item collections and indexes may be replicated. Changes to the data maintained by the distributed database management system may result in updates to multiple index structures. The changes may be compiled into an instruction set applicable to the index structures. In-memory buffers may contain the instructions prior to transmission to affected partitions. Replication logs may be combined with an acknowledgment mechanism for reliable transmission of the instructions to the affected partitions.
-
公开(公告)号：US20230280908A1
公开(公告)日：2023-09-07
申请号：US18171209
申请日：2023-02-17
Applicant: Amazon Technologies, Inc.
Inventor： Swaminathan Sivasubramanian , Stefano Stefani , Wei Xiao , Timothy Andrew Rath , Rande A. Blackman , Grant Alexander MacDonald McAlister , Raymond S. Bradford
IPC: G06F3/06
CPC classification number: G06F3/0613 , G06F3/0631 , G06F3/0683 , G06F3/0608 , H04L67/1097
Abstract: A system that implements a scaleable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain data in partitions stored on respective computing nodes in the system. The service may support multiple throughput models, including a committed throughput model and a best effort throughput model. A service request to create a table may specify that requests directed to the table should be serviced under a committed throughput model and may specify the committed throughput level in terms of logical service request units. The service may reserve low-latency storage and other resources sufficient to meet the specified committed throughput level. A client/user may request a modification to the committed throughput level in anticipation of workload changes, such as an increase or decrease in traffic or data volume. In response, the system may increase or decrease the resources reserved for the table.
-
公开(公告)号：US11601512B2
公开(公告)日：2023-03-07
申请号：US17245811
申请日：2021-04-30
Applicant: Amazon Technologies, Inc.
Inventor： Wei Xiao , David Alan Lutz , Timothy Andrew Rath , Maximiliano Maccanti , Miguel Mascarenhas Filipe , David Craig Yanacek
Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate.
-
Patent Agency Ranking
公开(公告)号：US11507480B2
公开(公告)日：2022-11-22
申请号：US16185423
申请日：2018-11-09
Applicant: Amazon Technologies, Inc.
Inventor： Michael T. Helmick , Jakub Kulesza , Timothy Andrew Rath , Stefano Stefani , David Alan Lutz
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.
-
公开(公告)号：US20210329077A1
公开(公告)日：2021-10-21
申请号：US17245811
申请日：2021-04-30
Applicant: Amazon Technologies, Inc.
Inventor： Wei Xiao , David Alan Lutz , Timothy Andrew Rath , Maximiliano Maccanti , Miguel Mascarenhas Filipe , David Craig Yanacek
IPC: H04L29/08 , G06F9/50 , G06F11/34 , H04L12/917 , H04L12/24 , H04L12/911 , H04L29/06
Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate.
-
公开(公告)号：US11086898B2
公开(公告)日：2021-08-10
申请号：US13800796
申请日：2013-03-13
Applicant: Amazon Technologies, Inc.
Inventor： Kiran-Kumar Muniswamy-Reddy , Bjorn Patrick Swift , Miguel Mascarenhas Filipe , Timothy Andrew Rath , Stefano Stefani , Yijun Lu , Wei Xiao , Stuart Henry Seelye Marshall , James R. Hamilton
Abstract: Methods and apparatus for token-based admission control for replicated writes are disclosed. Data objects are divided into partitions, and corresponding to each partition, at least a master replica and a slave replica are stored. A determination as to whether to accept a write request directed to the partition is made based at least in part on one or more of (a) available throughput capacity at the master replica, and (b) an indication, obtained using a token-based protocol, of available throughput capacity at the slave replica. If the write request is accepted, one or more data modification operations are initiated.
-
公开(公告)号：US10999381B2
公开(公告)日：2021-05-04
申请号：US16377078
申请日：2019-04-05
Applicant: Amazon Technologies, Inc.
Inventor： Wei Xiao , David Alan Lutz , Timothy Andrew Rath , Maximiliano Maccanti , Miguel Mascarenhas Filipe , David Craig Yanacek
IPC: H04L12/24 , H04L29/08 , H04L12/917 , H04L12/911 , G06F9/50 , G06F11/34 , H04L29/06
Abstract: A system that provides services to clients may receive and service requests, various ones of which may require different amounts of work. The system may determine whether it is operating in an overloaded or underloaded state based on a current work throughput rate, a target work throughput rate, a maximum request rate, or an actual request rate, and may dynamically adjust the maximum request rate in response. For example, if the maximum request rate is being exceeded, the maximum request rate may be raised or lowered, dependent on the current work throughput rate. If the target or committed work throughput rate is being exceeded, but the maximum request rate is not being exceeded, a lower maximum request rate may be proposed. Adjustments to the maximum request rate may be made using multiple incremental adjustments. Service request tokens may be added to a leaky token bucket at the maximum request rate.
-
公开(公告)号：US10831759B2
公开(公告)日：2020-11-10
申请号：US16179802
申请日：2018-11-02
Applicant: Amazon Technologies, Inc.
IPC: G06F17/00 , G06F16/2455 , G06F16/27
Abstract: A probabilistic counting structure such as a hyperloglog may be formed during a table scan for each of a selected set of columns. The columns may be selected based on an initial estimate of relatedness, which may be based on data types of the respective columns. An estimated cardinality of an intersection or union of columns may be formed based on an intersection of the probabilistic data structures. A join path may be determined based on the estimated cardinality of an intersection or union of the columns.
-
-
-
-
-
-
-
-
-
Search Results
105
records
(took 0.021 seconds)
