-
公开(公告)号:US11120006B2
公开(公告)日:2021-09-14
申请号:US16014890
申请日:2018-06-21
Applicant: Amazon Technologies, Inc.
Inventor: Douglas Brian Terry , Tate Andrew Certain , Amit Gupta , Rishabh Jain , Vaibhav Jain , Alexander Richard Keyes , Somasundaram Perianayagam , Nathan Pellegrom Riley , Akshat Vig , Ming-Chuan Wu
Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.
-
公开(公告)号: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
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.
-
公开(公告)号:US20220067025A1
公开(公告)日:2022-03-03
申请号:US17472449
申请日:2021-09-10
Applicant: Amazon Technologies, Inc.
Inventor: Douglas Brian Terry , Tate Andrew Certain , Amit Gupta , Rishabh Jain , Vaibhav Jain , Alexander Richard Keyes , Somasundaram Perianayagam , Nathan Pellegrom Riley , Akshat Vig , Ming-Chuan Wu
IPC: G06F16/23 , G06F16/182 , G06F16/18 , G06F9/48 , G06F9/50
Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.
-
4.
公开(公告)号: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.
-
公开(公告)号: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.
-
公开(公告)号:US11232000B1
公开(公告)日:2022-01-25
申请号:US15441814
申请日:2017-02-24
Applicant: Amazon Technologies, Inc.
Inventor: Sandeep Bhatia , Ming-Chuan Wu , Kanishka Chaturvedi , Andrew Whitaker
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.
-
7.
公开(公告)号:US20190392061A1
公开(公告)日:2019-12-26
申请号:US16014890
申请日:2018-06-21
Applicant: Amazon Technologies, Inc.
Inventor: Douglas Brian Terry , Tate Andrew Certain , Amit Gupta , Rishabh Jain , Vaibhav Jain , Alexander Richard Keyes , Somasundaram Perianayagam , Nathan Pellegrom Riley , Akshat Vig , Ming-Chuan Wu
Abstract: Transaction requests may be ordered in a distributed database according to an independently assigned sequence. Different distributed system nodes, such as a transaction coordinator and a storage node may independently assign sequence numbers to requests to access a distributed database. A storage node may receive the request from a transaction coordinator with an assigned sequence number and another request to which the storage node may assign a sequence number. The storage node can then order performance of the requests based on the sequence numbers.
-
-
-
-
-
-