Patents by Inventor Rande A. Blackman
Rande A. Blackman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20160378845Abstract: 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.Type: ApplicationFiled: August 29, 2016Publication date: December 29, 2016Inventors: 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
-
Patent number: 9471657Abstract: 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.Type: GrantFiled: May 20, 2013Date of Patent: October 18, 2016Assignee: Amazon Technologies, Inc.Inventors: Wei Xiao, Miguel Mascarenhas Filipe, Bjorn Patrick Swift, Kiran-Kumar Muniswamy-Reddy, Stuart Henry Seelye Marshall, Timothy Andrew Rath, Rande A. Blackman
-
Patent number: 9432459Abstract: 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.Type: GrantFiled: December 22, 2014Date of Patent: August 30, 2016Assignee: Amazon Technologies, Inc.Inventors: 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
-
Patent number: 9330158Abstract: 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.Type: GrantFiled: May 20, 2013Date of Patent: May 3, 2016Assignee: Amazon Technologies, Inc.Inventors: Wei Xiao, Miguel Mascarenhas Filipe, Bjorn Patrick Swift, Kiran-Kumar Muniswamy-Reddy, Stuart Henry Seelye Marshall, Timothy Andrew Rath, Rande A. Blackman
-
Publication number: 20150112999Abstract: 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.Type: ApplicationFiled: December 22, 2014Publication date: April 23, 2015Inventors: 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
-
Publication number: 20140379921Abstract: Methods and apparatus for resource silos at network-accessible services are disclosed. A subset of resources used for a database service, including at least one resource from each of a plurality of data centers, is selected for membership in a resource silo based on grouping criteria. A silo routing layer node identifies the resource silo as the target silo to which a client work request is to be directed. The client work request is sent to a front-end resource of the target silo either by the client, or by the silo routing layer node on behalf of the client. The front-end resource of the target silo transmits a representation of the work request to a back-end resource of the target silo, where a work operation corresponding to request is performed.Type: ApplicationFiled: June 21, 2013Publication date: December 25, 2014Inventors: ADAM DOUGLAS MORLEY, VINCENT ANTHONY BRANCATO, STEFANO STEFANI, JAI VASANTH, WEI XIAO, MAXIMILIANO MACCANTI, SWAMINATHAN SIVASUBRAMANIAN, RANDE A. BLACKMAN, TIMOTHY ANDREW RATH
-
Patent number: 8918435Abstract: 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.Type: GrantFiled: November 25, 2013Date of Patent: December 23, 2014Assignee: Amazon Technology, Inc.Inventors: 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
-
Patent number: 8819027Abstract: 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.Type: GrantFiled: October 28, 2013Date of Patent: August 26, 2014Assignee: Amazon Technologies, Inc.Inventors: Swaminathan Sivasubramanian, Stefano Stefani, Chiranjeeb Buragohain, Rande A. Blackman, Timothy Andrew Rath, Grant A. M. McAlister, Jakub Kulesza, Wei Xiao, Raymond S. Bradford
-
Publication number: 20140082028Abstract: 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.Type: ApplicationFiled: November 25, 2013Publication date: March 20, 2014Applicant: Amazon Technologies, Inc.Inventors: 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
-
Patent number: 8595267Abstract: 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.Type: GrantFiled: June 27, 2011Date of Patent: November 26, 2013Assignee: Amazon Technologies, Inc.Inventors: 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
-
Patent number: 8572091Abstract: 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.Type: GrantFiled: June 27, 2011Date of Patent: October 29, 2013Assignee: Amazon Technologies, Inc.Inventors: Swaminathan Sivasubramanian, Stefano Stefani, Chiranjeeb Buragohain, Rande A. Blackman, Timothy Andrew Rath, Grant A. M. McAlister, Jakub Kulesza, Wei Xiao, Raymond S. Bradford
-
Publication number: 20120330954Abstract: 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.Type: ApplicationFiled: June 27, 2011Publication date: December 27, 2012Inventors: 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
-
Patent number: 6249792Abstract: An on-line dynamic shrink facility sets an allocation fence in a file and moves data from above the fence to below the fence. The fence is based on a target size for the file. When all the data above the fence is moved below the fence, the space above the fence is freed. The target size can be a specified size, an original size for the file when it was created, or a size calculated by examining the amount of space used and adding in an amount of desired free space. Resources that are required to move the data, such as old and new allocation units for the data, or that will be impacted by movement of the data, such as index entries, are locked or latched to prevent corruption of the data while it is being moved. The operations are performed in discreet transactions which are immediately committed to minimize the impact on other users of the file.Type: GrantFiled: December 16, 1998Date of Patent: June 19, 2001Assignee: Microsoft CorporationInventors: Michael Zwilling, Rande Blackman, Sameet Agarwal, Steven J. Lindell