Input-Output Prioritization for Database Workload
    1.
    发明申请
    Input-Output Prioritization for Database Workload 有权
    数据库工作负载的输入输出优先级

    公开(公告)号:US20140344312A1

    公开(公告)日:2014-11-20

    申请号:US13897232

    申请日:2013-05-17

    CPC classification number: G06F17/30595 G06F17/30289 G06F17/30386

    Abstract: A database management system may be operated by a third-party provider that hosts the system in a datacenter and provides access to the system to end users on behalf of various entities. Limits on total capacity consumption may be imposed, but may result in service outages when capacity consumption exceeds those limits. Requests to perform operations on the system may be classified. The request classifications may be associated with policies for admitting or rejecting the request. One or more token buckets representative of capacity available to the request to perform the operation may be used to determine to admit the request and updated based on the cost of performing the operation.

    Abstract translation: 数据库管理系统可以由在数据中心中承载系统的第三方提供商来操作,并且代表各种实体向终端用户提供对系统的访问。 总容量消耗的限制可能会受到限制,但是当容量消耗超过这些限制时可能导致服务中断。 可以对在系统上执行操作的请求进行分类。 请求分类可能与允许或拒绝请求的策略相关联。 可以使用表示可用于执行操作的请求的容量的一个或多个令牌桶来确定承认请求并且基于执行操作的成本来更新。

    Storage device selection for database partition replicas

    公开(公告)号:US09460185B2

    公开(公告)日:2016-10-04

    申请号:US14733887

    申请日:2015-06-08

    CPC classification number: G06F17/30584 G06F17/30575

    Abstract: A system that implements a data storage service may store data in multiple replicated partitions on respective storage nodes. The selection of the storage nodes (or storage devices thereof) on which to store the partition replicas may be performed by administrative components that are responsible for partition management and resource allocation for respective groups of storage nodes (e.g., based on a global view of resource capacity or usage), or the selection of particular storage devices of a storage node may be determined by the storage node itself (e.g., based on a local view of resource capacity or usage). Placement policies applied at the administrative layer or storage layer may be based on the percentage or amount of provisioned, reserved, or available storage or IOPS capacity on each storage device, and particular placements (or subsequent operations to move partition replicas) may result in an overall resource utilization that is well balanced.

    Range query capacity allocation
    3.
    发明授权
    Range query capacity allocation 有权
    范围查询容量分配

    公开(公告)号:US09330158B1

    公开(公告)日:2016-05-03

    申请号:US13898201

    申请日:2013-05-20

    CPC classification number: G06F17/30584 H04L67/1008 H04L67/1095 H04L67/1097

    Abstract: Distributed database management systems may perform range queries over the leading portion of a primary key. Non-random distribution of data may improve performance related to the processing of range queries, but may tend to cause workload to be concentrated on particular partitions. Groups of partitions may be expanded and collapsed based on detection of disproportionate workload. Disproportionate write workload may be distributed among a group of partitions that can subsequently be queried using a federated approach. Disproportionate read workload may be distributed among a group of read-only replicated partitions.

    Abstract translation: 分布式数据库管理系统可以在主键的前导部分上执行范围查询。 数据的非随机分布可以提高与范围查询的处理相关的性能,但可能倾向于使工作负载集中在特定分区上。 基于检测不成比例的工作负载,可能会将分区组扩展和折叠。 不成比例的写入工作负载可能会分布在一组分区中,随后可以使用联合方法进行查询。 不成比例的读取工作负载可能会分布在一组只读复制分区中。

    Input-output prioritization for database workload
    4.
    发明授权
    Input-output prioritization for database workload 有权
    数据库工作负载的输入输出优先级

    公开(公告)号:US09262505B2

    公开(公告)日:2016-02-16

    申请号:US13897232

    申请日:2013-05-17

    CPC classification number: G06F17/30595 G06F17/30289 G06F17/30386

    Abstract: A database management system may be operated by a third-party provider that hosts the system in a datacenter and provides access to the system to end users on behalf of various entities. Limits on total capacity consumption may be imposed, but may result in service outages when capacity consumption exceeds those limits. Requests to perform operations on the system may be classified. The request classifications may be associated with policies for admitting or rejecting the request. One or more token buckets representative of capacity available to the request to perform the operation may be used to determine to admit the request and updated based on the cost of performing the operation.

    Abstract translation: 数据库管理系统可以由在数据中心中承载系统的第三方提供商来操作,并且代表各种实体向终端用户提供对系统的访问。 总容量消耗的限制可能会受到限制,但是当容量消耗超过这些限制时可能导致服务中断。 可以对在系统上执行操作的请求进行分类。 请求分类可能与允许或拒绝请求的策略相关联。 可以使用表示可用于执行操作的请求的容量的一个或多个令牌桶来确定承认请求并且基于执行操作的成本来更新。

    Splitting database partitions
    6.
    发明授权

    公开(公告)号:US10459899B1

    公开(公告)日:2019-10-29

    申请号:US15443897

    申请日:2017-02-27

    Abstract: Techniques are disclosed for splitting a database partition into two partitions. In embodiments, where the partition is a hash partition, the partition is split at its logical midpoint, so that half of the partition's rows are placed in each split partition. Where the partition is a hash-range partition, a number of rows of the partition are sampled. Where enough samples fall on each side of the logical midpoint, the logical midpoint is again used as the split point. Where not enough samples fall on one side of the logical midpoint, then the median of the samples is used as the split point.

    Compound token buckets for burst-mode admission control
    8.
    发明授权
    Compound token buckets for burst-mode admission control 有权
    用于突发模式准入控制的复合令牌桶

    公开(公告)号:US09385956B2

    公开(公告)日:2016-07-05

    申请号:US13926697

    申请日:2013-06-25

    CPC classification number: H04L47/12

    Abstract: Methods and apparatus for compound token buckets usable for burst-mode admission control are disclosed. A peak burst rate and a sustained burst rate of work requests that are to be supported at a work target are determined. The maximum token populations of a peak-burst token bucket and a sustained-burst token bucket are configured, based on the peak burst rate and the sustained burst rate respectively. In response to receiving a work request directed at the work target, a determination to accept the work request for execution is made based at least in part on the token population of the peak-burst token bucket and/or the sustained-burst token bucket.

    Abstract translation: 公开了可用于突发模式准入控制的复合令牌桶的方法和装置。 确定要在工作目标中支持的峰值突发速率和工作请求的持续突发速率。 基于峰值突发速率和持续突发速率,配置峰值突发令牌桶和持续突​​发令牌桶的最大标记量。 响应于接收到针对工作目标的工作请求,至少部分地基于峰 - 突发令牌桶和/或持续突发令牌桶的令牌总数进行接受执行工作请求的确定。

    Real-time monitoring of IO load and latency

    公开(公告)号:US10924562B1

    公开(公告)日:2021-02-16

    申请号:US13886025

    申请日:2013-05-02

    Abstract: Providers of web services and other types of software as a service may be subject to service-level agreements requiring that response times be within a defined range. For efficiency, multiple services may be hosted on the same set of computing nodes, which may jeopardize adherence to service-level agreements. A control system may involve classifying service requests and determining desired values for measurements such as latency. An error value may be calculated based on the difference between measured and desired values. A controller may adjust a rate of capacity utilization for the computing nodes based on the current error, a history of past errors, and a prediction of future errors.

    Splitting database partitions
    10.
    发明授权

    公开(公告)号:US09607019B1

    公开(公告)日:2017-03-28

    申请号:US13838298

    申请日:2013-03-15

    CPC classification number: G06F17/303 G06F17/30584

    Abstract: Techniques are disclosed for splitting a database partition into two partitions. In embodiments, where the partition is a hash partition, the partition is split at its logical midpoint, so that half of the partition's rows are placed in each split partition. Where the partition is a hash-range partition, a number of rows of the partition are sampled. Where enough samples fall on each side of the logical midpoint, the logical midpoint is again used as the split point. Where not enough samples fall on one side of the logical midpoint, then the median of the samples is used as the split point.

Patent Agency Ranking