公开(公告)号：US11232000B1

公开(公告)日：2022-01-25

申请号：US15441814

申请日：2017-02-24

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Bhatia ,  Ming-Chuan Wu ,  Kanishka Chaturvedi ,  Andrew Whitaker

IPC: G06F11/14 ,  G06F16/21 ,  G06F16/27

Abstract: Replicated partitions of a database may be moved from one or more replica nodes to a different primary node. The replica nodes may maintain replicated partitions of one or more primary partitions of a primary node servicing access requests to the primary partitions. The replicated partitions may be copied to a different node in order to cause the processing of access requests directed to primary partitions to be serviced by the different node. Replicated partitions of a database may be moved from replica nodes to perform a split operation or a merger operation.

公开(公告)号：US11093496B1

公开(公告)日：2021-08-17

申请号：US15821683

申请日：2017-11-22

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Bhatia ,  Kanishka Chaturvedi ,  Maruthi Manohar Reddy Devarenti

IPC: G06F16/00 ,  G06F16/2453 ,  G06F16/2455

Abstract: Performance-based caching may be implemented for query plan caches that are used to provide query plans to perform queries instead of generating query plans to perform queries. Performance metrics for queries performed at a database may be collected and used to cache query plans generated for the queries. When a query is received that matches one of the queries, the cached plan corresponding to the matching query may be used to perform the query.

公开(公告)号：US11263184B1

公开(公告)日：2022-03-01

申请号：US16116791

申请日：2018-08-29

Applicant: Amazon Technologies, Inc.

Inventor： Mustafa Ozan Ozen ,  Dumanshu Goyal ,  Lonnie J. Princehouse ,  Gaurav Saxena ,  Atilim Cetin ,  Gaurav Gupta ,  Sandeep Bhatia ,  Nilesh Shahdadpuri ,  Timothy A. Rath ,  Eric Coll ,  Nirmesh Khandelwal

IPC: G06F16/00 ,  G06F16/21 ,  G06F16/27 ,  G06F16/2458 ,  G06F16/248 ,  G06F16/901 ,  G06F16/2457

Abstract: Methods, systems, and computer-readable media for partition splitting in a distributed database are disclosed. A partition of data is split into a first sub-partition and a second sub-partition. A first portion of the data is assigned to the first sub-partition, and a second portion of the data is assigned to the second sub-partition. One or more elements of the first portion of the data from the partition and an additional one or more elements of the first portion of the data from the first sub-partition are stored into a first node. One or more elements of the second portion of the data from the partition and an additional one or more elements of the second portion of the data from the second sub-partition are stored into a second node. The partition is prevented from receiving new data after the partition is split into the first and second sub-partitions.

公开(公告)号：US11120052B1

公开(公告)日：2021-09-14

申请号：US16021707

申请日：2018-06-28

Applicant: Amazon Technologies, Inc.

Inventor： Mustafa Ozan Ozen ,  Sandeep Bhatia ,  Atilim Cetin ,  Lonnie J. Princehouse ,  Timothy Andrew Rath ,  Gaurav Saxena

IPC: G06F16/28 ,  G06F16/22 ,  G06F16/2455

Abstract: Techniques are described for clustering data at the point of ingestion for storage using scalable storage resources. To cluster data at the point of ingestion, a data ingestion and query service uses a multilevel hash tree (MLHT)-based index to map a hierarchy of attribute values associated with each data element onto a point of a MLHT (which itself conceptually maps onto a continuous range of values). The total range of the MLHT is divided into one or more data partitions, each of which is mapped to one or more physical storage resources. A mapping algorithm uses the hierarchy of attribute fields to calculate the position of each data element ingested and, consequently, a physical storage resource at which to store the data element.

公开(公告)号：US10409648B1

公开(公告)日：2019-09-10

申请号：US15447014

申请日：2017-03-01

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Bhatia ,  VamsiKrishna Chaitanya Manchem ,  Ming-Chuan Wu ,  Kanishka Chaturvedi ,  Kimi Shah ,  Andrew Whitaker ,  Maruthi Manohar Reddy Devarenti

IPC: G06F9/46 ,  G06F9/50

Abstract: Processing responsibility for a data set may be split according to separately stored partitions of the data set. A data set may be stored in different storage units that separately store different partitions of the data set. Mapping information may be maintained indicating the assignment of a node to process access requests to multiple partitions of a data set. A split event may be detected for the node, and one or more partitions assigned to the node may be reassigned to a different node. The storage units for the reassigned partitions may be made accessible to the different node. Then mapping information can be updated to indicate change in assignment from the original node to the different node so that the different node can begin processing access requests for the reassigned partitions.

公开(公告)号：US09984386B1

公开(公告)日：2018-05-29

申请号：US14709227

申请日：2015-05-11

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Bhatia

IPC: G06Q30/00 ,  G06Q30/02

CPC classification number: G06Q30/0241

Abstract: Methods and systems for managing or regulating offer listings in an electronic marketplace. Consumer feedback regarding the offer listings may be received and analyzed to generate recommended or candidate rules. The recommended rules may be presented to rule authors for validation. Acceptance and/or rejection of the recommended rules can be used to train or otherwise improve the generation of future recommended rules. The accepted recommended rules can be used to generate final rules. The final rules may be applied to offer listings to trigger a variety of actions including filtering of offer listings, sending notifications to sellers, and updating offer listings user interface.

公开(公告)号：US12093276B1

公开(公告)日：2024-09-17

申请号：US16199039

申请日：2018-11-23

Applicant: Amazon Technologies, Inc.

Inventor： Andrew James Whitaker ,  Pravin Mittal ,  Stefano Stefani ,  Kanishka Chaturvedi ,  Maruthi Manohar Reddy Devarenti ,  Dhruv Goel ,  Rajesh Iyer ,  Nitin Ahuja ,  Nilanjan Basu ,  Pushap Goyal ,  Abhilash Reddy Koppula ,  VamsiKrishna Chaitanya Manchem ,  Lishi Jiang ,  Abhijeet Pandurang More ,  Hong Yang ,  Sandeep Bhatia ,  Ming-Chuan Wu

IPC: G06F16/25 ,  G06F16/21 ,  G06F16/2453 ,  G06F16/93

CPC classification number: G06F16/252 ,  G06F16/21 ,  G06F16/24542 ,  G06F16/258 ,  G06F16/93

Abstract: A non-relational database may be emulated using a relational database with a distributed data store. A request to access the non-relational database may be received at a frontend for a relational database engine that emulates an interface for a non-relational database engine. The request may be translated into the format for the relational database engine and performed by the relational database engine. The relational database engine may access data for the non-relational database at storage nodes that store the data in a relational table column of non-relational data type.

公开(公告)号：US11609933B1

公开(公告)日：2023-03-21

申请号：US16039258

申请日：2018-07-18

Applicant: Amazon Technologies, Inc.

Inventor： Mustafa Ozan Ozen ,  Sandeep Bhatia ,  Lonnie J. Princehouse ,  Timothy A. Rath ,  Gaurav Saxena

IPC: G06F16/00 ,  G06F16/27 ,  G06F16/21 ,  G06F16/23 ,  G06F16/2458

Abstract: Atomic partition scheme updates to partition items may be implemented by a time series database. A time threshold may be assigned to partition scheme update so that the time threshold may be applied across a set of ingestion nodes that may apply the partition scheme update the same. A request to store an item with a timestamp less than the time threshold may be stored in one partition of the time series database, while the item may be stored in a different partition of the time series database if the item has timestamp greater than or equal to the time threshold.

公开(公告)号：US11030169B1

公开(公告)日：2021-06-08

申请号：US15452587

申请日：2017-03-07

Applicant: Amazon Technologies, Inc.

Inventor： Ming-Chuan Wu ,  Sandeep Bhatia ,  Andrew Whitaker

IPC: G06F16/22 ,  G06F16/2455 ,  H04L29/08 ,  G06F16/27

Abstract: Processing and storage responsibility for a data set may be split according to separately stored shards of the data set. As one or more loads associated with shards of the dataset grow a re-sharding operation may be performed to reduce loading of particular shards and nodes that host the particular shards. A re-sharding operation may cause only a sub-set of as set of shards of the dataset to be split and only cause second portions of the split shards to be stored in additional computing nodes. In some embodiments, a number of shards to be included in the sub-set of shards to be split may be selected based on an overall number of shards in the set and a largest number in the Fibonacci sequence that is less than the overall number of shards in the set.

公开(公告)号：US10929396B1

公开(公告)日：2021-02-23

申请号：US15818687

申请日：2017-11-20

Applicant: Amazon Technologies, Inc.

Inventor： Sandeep Bhatia ,  Kanishka Chaturvedi ,  Maruthi Manohar Reddy Devarenti ,  VamsiKrishna Chaitanya Manchem ,  Andrew Whitaker ,  Ming-chuan Wu

IPC: G06F16/2453 ,  G06F16/81 ,  G06F16/93 ,  G06F9/54

Abstract: Multi-type attribute indexes may be implemented for document databases. When a request to perform a query at a document database is received that is directed toward in indexed attribute that has multiple data types for values stored in the multi-type attribute index, a predicate in the query may be replaced with a different predicate that is applicable to search the multi-type attribute index according to a sort order for the multiple data types stored in the at multi-type attribute index. A plan that includes the different predicate may be performed in order to provide a result of the query to a user.