专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120330954A1 System And Method For Implementing A Scalable Data Storage Service 有权
标题翻译：用于实现可扩展数据存储服务的系统和方法
公开(公告)号：US20120330954A1
公开(公告)日：2012-12-27
申请号：US13170031
申请日：2011-06-27
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Raymond S. Bradford , Grant A.M. McAlister , Jakub Kulesza , James Hamilton , Luis Felipe Cabrera
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Raymond S. Bradford , Grant A.M. McAlister , Jakub Kulesza , James Hamilton , Luis Felipe Cabrera
IPC分类号： G06F17/30
CPC分类号： 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
摘要： 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.
摘要翻译：实现可扩展数据存储服务的系统可以代表客户端在非关系数据存储中维护表。系统可以提供接收服务请求的Web服务接口，以及可用于请求创建，删除或描述表的API; 存储，检索，删除或修改其属性的项目; 或者查询（或扫描）已过滤的项目和/或返回的属性。可以调用异步工作流来创建或删除表。存储在表中的项目可以使用简单或复合主键进行分区和索引。系统可能不会对表大小强加预定义的限制，并且可以采用灵活的模式。该服务可以提供尽力而为或者承诺的吞吐量模型。响应于检测到工作负载变化，节点故障或其他条件或异常，系统可以自动缩放和/或重新分区表。

2. 发明授权

US08595267B2 System and method for implementing a scalable data storage service 有权
标题翻译：用于实现可扩展数据存储服务的系统和方法
公开(公告)号：US08595267B2
公开(公告)日：2013-11-26
申请号：US13170031
申请日：2011-06-27
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , James Hamilton , Raymond S. Bradford , Luis Felipe Cabrera
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , James Hamilton , Raymond S. Bradford , Luis Felipe Cabrera
IPC分类号： G06F7/00 , G06F17/30 , G06F9/50 , G06F12/08
CPC分类号： 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
摘要： 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.
摘要翻译：实现可扩展数据存储服务的系统可以代表客户端在非关系数据存储中维护表。系统可以提供接收服务请求的Web服务接口，以及可用于请求创建，删除或描述表的API; 存储，检索，删除或修改其属性的项目; 或者查询（或扫描）已过滤的项目和/或返回的属性。可以调用异步工作流来创建或删除表。存储在表中的项目可以使用简单或复合主键进行分区和索引。系统可能不会对表大小强加预定义的限制，并且可以采用灵活的模式。该服务可以提供尽力而为或者承诺的吞吐量模型。响应于检测到工作负载变化，节点故障或其他条件或异常，系统可以自动缩放和/或重新分区表。

3. 发明授权

US08572091B1 System and method for partitioning and indexing table data using a composite primary key 有权
标题翻译：使用复合主键分区和索引表数据的系统和方法
公开(公告)号：US08572091B1
公开(公告)日：2013-10-29
申请号：US13169990
申请日：2011-06-27
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , Wei Xiao , Raymond S. Bradford
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Chiranjeeb Buragohain , Rande A. Blackman , Timothy Andrew Rath , Grant A. M. McAlister , Jakub Kulesza , Wei Xiao , Raymond S. Bradford
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/3033 , G06F17/30584 , G06F17/30628 , G06F17/30949 , Y10S707/968 , Y10S707/972
摘要： 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.
摘要翻译：实现可扩展数据存储服务的系统可以代表服务客户端在非关系数据存储中维护表。每个表可以包括多个项目。每个项目可以包括一个或多个属性，每个属性包含名称 - 值对。该系统可以提供一种API，通过该API，客户端可以查询由服务维护的表。项目可以根据表中所有项目中包含的简单或复合主键在表中进行分区和索引。复合主键可以包括散列键属性和范围键属性。范围键属性可以用于对具有相同散列键属性值的项进行排序，并且根据范围键属性值的范围对它们进行分区。查询请求可以指定取决于范围键属性值的逻辑或数学表达式，并且可以被引导到多个分区。

4. 发明授权

US10877669B1 System and method for providing a committed throughput level in a data store 有权
公开(公告)号：US10877669B1
公开(公告)日：2020-12-29
申请号：US13174189
申请日：2011-06-30
申请人： Swaminathan Sivasubramanian , Stefano Stefani , Wei Xiao , Timothy Andrew Rath , Rande A. Blackman , Grant A. M. McAlister , Raymond S. Bradford
发明人： Swaminathan Sivasubramanian , Stefano Stefani , Wei Xiao , Timothy Andrew Rath , Rande A. Blackman , Grant A. M. McAlister , Raymond S. Bradford
IPC分类号： G06F3/06 , H04L29/08
CPC分类号： G06F3/0613 , G06F3/0631 , G06F3/0683 , G06F3/0608 , H04L67/1097
摘要： 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.

5. 发明授权

US09755985B1 Utilizing multiple algorithms in a distributed-service environment 有权
公开(公告)号：US09755985B1
公开(公告)日：2017-09-05
申请号：US12892527
申请日：2010-09-28
申请人： David A. Lutz , Stefano Stefani , Jakub Kulesza , Timothy Andrew Rath
发明人： David A. Lutz , Stefano Stefani , Jakub Kulesza , Timothy Andrew Rath
IPC分类号： G06F15/173 , H04L12/863
CPC分类号： H04L47/6255
摘要： Techniques for producing a gentle reduction in throughput in a distributed service when a node of the service encounters a very large backlog of requests and/or when a previously offline node of the service is brought back online. These techniques may utilize multiple different algorithms to determine an amount of work that the distributed service is able to accept at any given time, rather than a single algorithm.

6. 发明授权

US09052831B1 System and method for performing live partitioning in a data store 有权
标题翻译：在数据存储中执行实时分区的系统和方法
公开(公告)号：US09052831B1
公开(公告)日：2015-06-09
申请号：US13174295
申请日：2011-06-30
申请人： Stefano Stefani , Timothy Andrew Rath , Chiranjeeb Buragahain , Yan V. Leshinsky , David A. Lutz , Jakub Kulesza , Wei Xiao , Jai Vasanth
发明人： Stefano Stefani , Timothy Andrew Rath , Chiranjeeb Buragahain , Yan V. Leshinsky , David A. Lutz , Jakub Kulesza , Wei Xiao , Jai Vasanth
IPC分类号： G06F12/06 , G06F3/06
CPC分类号： G06F3/0619 , G06F3/0644 , G06F3/065 , G06F3/067 , G06F17/30584
摘要： A system that implements a scalable data storage service may maintain tables in a data store on behalf of storage service clients. The service may maintain table data in multiple replicas of partitions that are stored on respective computing nodes in the system. In response to detecting an anomaly in the system, detecting a change in data volume on a partition or service request traffic directed to a partition, or receiving a service request from a client to split a partition, the data storage service may create additional copies of a partition replica using a physical copy mechanism. The data storage service may issue a split command defined in an API for the data store to divide the original and additional replicas into multiple replica groups, and to configure each replica group to maintain a respective portion of the table data that was stored in the partition before the split.
摘要翻译：实现可扩展数据存储服务的系统可以代表存储服务客户端来维护数据存储中的表。该服务可以在存储在系统中的相应计算节点上的分区的多个副本中维护表数据。响应于检测到系统中的异常，检测指向分区的分区或服务请求流量上的数据量的变化，或者从客户端接收分割分区的服务请求，数据存储服务可以创建附加副本使用物理复制机制的分区副本。数据存储服务可以发布在数据存储的API中定义的分割命令，以将原始和附加副本划分为多个副本组，并配置每个副本组以维护存储在分区中的表数据的相应部分分裂之前。

7. 发明授权

US08732517B1 System and method for performing replica copying using a physical copy mechanism 有权
标题翻译：使用物理复制机制执行副本复制的系统和方法
公开(公告)号：US08732517B1
公开(公告)日：2014-05-20
申请号：US13174275
申请日：2011-06-30
申请人： Stefano Stefani , Timothy Andrew Rath , Jakub Kulesza , Wei Xiao
发明人： Stefano Stefani , Timothy Andrew Rath , Jakub Kulesza , Wei Xiao
IPC分类号： G06F11/00
CPC分类号： G06F17/30584 , G06F11/1471 , G06F11/2023 , G06F11/2094
摘要： A system that implements a data storage service may maintain tables in a data store on behalf of clients. The service may maintain table data in multiple replicas of partitions of the data that are stored on respective computing nodes in the system. In response to detecting a failure or fault condition, or receiving a service request from a client to move or copy a partition replica, the data store may copy a partition replica to another computing node using a physical copy mechanism. The physical copy mechanism may copy table data from physical storage locations in which it is stored to physical storage locations allocated to a destination replica on the other computing node. During copying, service requests to modify table data may be logged and applied to the replica being copied. A catch-up operation may be performed to apply modification requests received during copying to the destination replica.
摘要翻译：实现数据存储服务的系统可以代表客户端在数据存储中维护表。该服务可以在存储在系统中的相应计算节点上的数据的分区的多个副本中维护表数据。响应于检测到故障或故障状况，或者从客户端接收到移动或复制分区副本的服务请求，数据存储可以使用物理复制机制将分区副本复制到另一个计算节点。物理复制机制可以将表数据从其存储的物理存储位置复制到分配给另一个计算节点上的目标副本的物理存储位置。在复制期间，可能会记录修改表数据的服务请求并将其应用于复制副本。可以执行追赶操作以将复制期间接收的修改请求应用于目的地复本。

8. 发明授权

US08601000B1 System and method for conditionally updating an item with attribute granularity 有权
标题翻译：用于有条件地更新属性粒度的项目的系统和方法
公开(公告)号：US08601000B1
公开(公告)日：2013-12-03
申请号：US13169995
申请日：2011-06-27
申请人： Stefano Stefani , Chiranjeeb Buragohain , Jai Vasanth , Wei Xiao
发明人： Stefano Stefani , Chiranjeeb Buragohain , Jai Vasanth , Wei Xiao
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30371 , G06F17/30002 , G06F17/30345 , G06F17/30365 , G06F17/30584
摘要： A system that implements a scaleable data storage service may maintain tables in a non-relational data store on behalf of clients. Each table may include multiple items. Each item may include one or more attributes, each containing a name-value pair. Attribute values may be scalars or sets of numbers or strings. The system may provide an API usable to request that values of one or more of an item's attributes be updated. An update request may be conditional on expected values of one or more item attributes (e.g., the same or different item attributes). In response to a request to update the values of one or more item attributes, the previous values and/or updated values may be optionally returned for the updated item attributes or for all attributes of an item targeted by an update request. Items stored in tables may be indexed using a simple or composite primary key.
摘要翻译：实现可扩展数据存储服务的系统可以代表客户端在非关系数据存储中维护表。每个表可以包括多个项目。每个项目可以包括一个或多个属性，每个属性包含名称 - 值对。属性值可以是标量或数字或字符串集合。系统可以提供可用于请求更新项目属性中的一个或多个的值的API。更新请求可以以一个或多个项目属性（例如，相同或不同的项目属性）的预期值为条件。响应于更新一个或多个项目属性的值的请求，可以可选地为更新的项目属性或由更新请求定向的项目的所有属性返回先前值和/或更新的值。存储在表中的项目可以使用简单或复合主键进行索引。

9. 发明授权

US08473775B1 Locality based quorums 有权
标题翻译：基于地点的法定人数
公开(公告)号：US08473775B1
公开(公告)日：2013-06-25
申请号：US12967187
申请日：2010-12-14
申请人： Michael T. Helmick , Jakub Kulesza , Timothy A. Rath , Stefano Stefani , David A. Lutz
发明人： Michael T. Helmick , Jakub Kulesza , Timothy A. Rath , Stefano Stefani , David A. Lutz
IPC分类号： G06F11/00
CPC分类号： G06F11/2025 , G06F11/00 , G06F11/2028 , G06F11/2041 , G06F11/2046 , G06F11/2097
摘要： Disclosed are various embodiments for distributing data items within a plurality of nodes. A data item update request is replicated from a master node in a plurality of nodes to a plurality of slave nodes within the plurality of nodes. The replicated data item update request is determined to be locality-based durable. Responsive to the determination that the replicated data item update request is locality-based durable, the data item update request is confirmed to a client, wherein the client had originated the data item update request. Upon failover of the master node to another node within the plurality of nodes, a fault-tolerant failover quorum ensures that all previously confirmed updates are found and recognized by the new master node.
摘要翻译：公开了用于在多个节点内分发数据项的各种实施例。将数据项更新请求从多个节点中的主节点复制到多个节点内的多个从节点。复制的数据项更新请求被确定为基于局部性的持久性。响应于确定复制数据项更新请求是基于局部性的持久性，数据项更新请求被确认给客户端，其中客户端已经发起数据项更新请求。在主节点故障转移到多个节点中的另一节点之前，容错故障转移仲裁确保所有先前确认的更新都被新的主节点找到并被识别。

10. 发明授权

US09020891B1 Reduced locking in a distributed data store 有权
标题翻译：减少分布式数据存储中的锁定
公开(公告)号：US09020891B1
公开(公告)日：2015-04-28
申请号：US12913556
申请日：2010-10-27
申请人： Stefano Stefani , Jakub Kulesza
发明人： Stefano Stefani , Jakub Kulesza
IPC分类号： G06F7/00 , G06F9/445
CPC分类号： G06F17/30362 , G06F8/65 , G06F17/30368 , G06F17/3048 , G06F17/30581 , G06F17/30864
摘要： Disclosed are various embodiments for reducing locking in a distributed data store that includes a primary data store and one or more secondary data stores. An update to a data item that is to be applied to the distributed data store is obtained in one or more computing devices. The update is applied to a cached version of the data item when a lock is held. The update is replicated to the one or more data stores after the lock is released. It is determined that the update is durably persisted in the distributed data store after obtaining a replication confirmation from each of at least a predetermined number of the secondary data stores.
摘要翻译：公开了用于减少包括主数据存储和一个或多个次要数据存储在内的分布式数据存储中的锁定的各种实施例。在一个或多个计算设备中获得对应用于分布式数据存储的数据项的更新。当锁定时，更新应用于数据项的缓存版本。在释放锁定后，将更新复制到一个或多个数据存储。确定在从至少预定数量的辅助数据存储器中的每一个获得复制确认之后，更新持久地保持在分布式数据存储器中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式