System and method for partitioning and indexing table data using a composite primary key
    8.
    发明授权
    System and method for partitioning and indexing table data using a composite primary key 有权
    使用复合主键分区和索引表数据的系统和方法

    公开(公告)号:US08819027B1

    公开(公告)日:2014-08-26

    申请号:US14064943

    申请日:2013-10-28

    Abstract: A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of service clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. The system may provide an API through which clients can query tables maintained by the service. Items may be partitioned and indexed in a table according to a simple or composite primary key contained in all items in the table. A composite primary key may include a hash key attribute, and a range key attribute. The range key attribute may be usable to order items having the same hash key attribute value, and to partition them dependent on a range of range key attribute values. A query request may specify a logical or mathematical expression dependent on range key attribute values and may be directed to multiple partitions.

    Abstract translation: 实现可扩展数据存储服务的系统可以代表服务客户端在非关系数据存储中维护表。 每个表可以包括多个项目。 每个项目可以包括一个或多个属性,每个属性包含名称 - 值对。 该系统可以提供一种API,通过该API,客户端可以查询由服务维护的表。 项目可以根据表中所有项目中包含的简单或复合主键在表中进行分区和索引。 复合主键可以包括散列键属性和范围键属性。 范围键属性可以用于对具有相同散列键属性值的项进行排序,并且根据范围键属性值的范围对它们进行分区。 查询请求可以指定取决于范围键属性值的逻辑或数学表达式,并且可以被引导到多个分区。

    SYSTEM AND METHOD FOR PROVIDING A COMMITTED THROUGHPUT LEVEL IN A DATA STORE

    公开(公告)号:US20210200446A1

    公开(公告)日:2021-07-01

    申请号:US17133009

    申请日:2020-12-23

    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.

Patent Agency Ranking