公开(公告)号：US20180165315A1

公开(公告)日：2018-06-14

申请号：US15377375

申请日：2016-12-13

Applicant: SAP SE

Inventor： Boris Gruschko ,  Christian Mohr ,  Martin Strenge ,  Florian Foebel ,  Bjoern Friedmann

IPC: G06F17/30

CPC classification number: G06F16/2282

Abstract: In one aspect, a computer-implemented method includes calculating cardinality differences and combined sizes for one or more data block pairs in a relational database. The method also includes selecting a data block pair from the one or more data block pairs based on a calculated cardinality difference and a calculated combined size associated with the selected data block pair. The method further includes merging the selected data block pair to form a merged data block, and replacing the selected data block pair in the relational database by the merged data block.

公开(公告)号：US20180088987A1

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

申请号：US15274848

申请日：2016-09-23

Applicant: SAP SE

Inventor： Florian Foebel ,  Bjoern Friedmann ,  Boris Gruschko ,  Martin Strenge ,  Christian Mohr

IPC: G06F9/48 ,  G06F17/30 ,  G06F11/14

Abstract: In one respect, there is provided a distributed database system that includes a first local scheduler node and a second local scheduler node. The first local scheduler node can be configured to coordinate a performance of a first task and a second task by a first worker node associated with the first local scheduler node. The second local scheduler node can be configured to respond to a defect at the first local scheduler node by at least: collecting, from the first worker node, a log indicating one or more tasks completed by the first worker node prior to the defect at the first local scheduler node; determining, based at least on the log, that the first worker node has completed the first task but not the second task; and coordinating a performance of the second task by the first worker node. Related methods and articles of manufacture are also provided.

公开(公告)号：US11429636B2

公开(公告)日：2022-08-30

申请号：US17033181

申请日：2020-09-25

Applicant: SAP SE

Inventor： Achim Becker ,  Franz Faerber ,  Florian Foebel ,  Kesavaprakash Vasudevan ,  Martin Weidner ,  Jonathan Dees

IPC: G06F16/00 ,  G06F16/27 ,  G06F16/22 ,  G06F16/2458

Abstract: Technologies are provided for scaling applications via application scenarios. Portions of application resource content stored in a database are associated with application scenarios. The portions of the resource content associated with an application scenario are replicated to one or more computing nodes associated with the application scenario. Requests associated with the application scenario are transmitted to the one or more one or more computing nodes, where they are processed using the replicated portions of the resource content associated with the application scenario.

公开(公告)号：US10545929B2

公开(公告)日：2020-01-28

申请号：US15253750

申请日：2016-08-31

Applicant: SAP SE

Inventor： Florian Foebel ,  Bjoern Friedmann ,  Boris Gruschko ,  Martin Strenge ,  Christian Mohr

IPC: G06F16/21 ,  G06F16/27

Abstract: In one respect, there is provided a distributed database system. The distributed database system can include a plurality of nodes and a plurality of optimizers. A first optimizer of the plurality of optimizers can be configured to: receive, from a client, a command; generate, based at least in part on global metadata cached by the first optimizer, an execution plan for fulfilling the command that includes one or more tasks to be performed by at least a first node of the plurality of nodes; determine that at least one task of the one or more tasks are not successfully performed by the first node; and in response to determining that at least one task of the one or more tasks are not successfully performed by the first node, updating the cached global metadata at the first optimizer.

公开(公告)号：US10402387B2

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

申请号：US15377375

申请日：2016-12-13

Applicant: SAP SE

Inventor： Boris Gruschko ,  Christian Mohr ,  Martin Strenge ,  Florian Foebel ,  Bjoern Friedmann

IPC: G06F17/00 ,  G06F16/22

Abstract: In one aspect, a computer-implemented method includes calculating cardinality differences and combined sizes for one or more data block pairs in a relational database. The method also includes selecting a data block pair from the one or more data block pairs based on a calculated cardinality difference and a calculated combined size associated with the selected data block pair. The method further includes merging the selected data block pair to form a merged data block, and replacing the selected data block pair in the relational database by the merged data block.

公开(公告)号：US10728186B2

公开(公告)日：2020-07-28

申请号：US15604019

申请日：2017-05-24

Applicant: SAP SE

Inventor： Boris Gruschko ,  Christian Mohr ,  Martin Strenge ,  Florian Foebel ,  Bjoern Friedmann

IPC: G06F16/27 ,  G06F16/901 ,  H04L12/58 ,  G06F16/2455 ,  G06F9/54 ,  H04L29/08 ,  G06F16/22

Abstract: The present disclosure involves systems, software, and computer implemented methods for preventing reader starvation in a distributed system. One example method includes receiving, at a node that manages a data stream, a write-intent request from a writer for a first partition, the data stream associated with a graph that includes levels of partitions including a current level; identifying the first partition for the writer; providing partition information for the first partition to enable the writer to write to the first partition; determining that the writer has previously written to a second partition associated with the current level; in response to determining that the writer has previously written to the second partition: creating a new current level; associating the first partition with the new current level; identifying partitions associated with the current level; and providing a close-level instruction to each local node that includes a partition associated with the current level.

公开(公告)号：US20180343213A1

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

申请号：US15604019

申请日：2017-05-24

Applicant: SAP SE

Inventor： Boris Gruschko ,  Christian Mohr ,  Martin Strenge ,  Florian Foebel ,  Bjoern Friedmann

IPC: H04L12/58 ,  G06F17/30

Abstract: The present disclosure involves systems, software, and computer implemented methods for preventing reader starvation in a distributed system. One example method includes receiving, at a node that manages a data stream, a write-intent request from a writer for a first partition, the data stream associated with a graph that includes levels of partitions including a current level; identifying the first partition for the writer; providing partition information for the first partition to enable the writer to write to the first partition; determining that the writer has previously written to a second partition associated with the current level; in response to determining that the writer has previously written to the second partition: creating a new current level; associating the first partition with the new current level; identifying partitions associated with the current level; and providing a close-level instruction to each local node that includes a partition associated with the current level.

公开(公告)号：US20180081941A1

公开(公告)日：2018-03-22

申请号：US15272851

申请日：2016-09-22

Applicant: SAP SE

Inventor： Florian Foebel ,  Bjoern Friedmann ,  Boris Gruschko ,  Martin Strenge ,  Christian Mohr

IPC: G06F17/30 ,  G06F9/48

CPC classification number: G06F16/24542 ,  G06F9/4881 ,  G06F9/5066

Abstract: In one respect, there is provided a distributed database system that includes a global scheduler node and a first local scheduler node. The global scheduler node can be configured to generate an execution plan for a query requiring data stored at and/or managed by a first and a second worker node assigned to the first local scheduler node. The execution plan can include a first fragment having operations to be performed by the first and second worker node. The first local scheduler node can be configured to coordinate the execution of a portion of the first fragment of the execution plan by distributing, to the first and second worker node, operations included in the first fragment of the execution plan, and routing, between the first and second worker node, messages associated with executing the first fragment of the execution plan. Related methods and computer program products are also provided.

公开(公告)号：US20180011658A1

公开(公告)日：2018-01-11

申请号：US15203410

申请日：2016-07-06

Applicant: SAP SE

Inventor： Boris Gruschko ,  Christian Mohr ,  Martin Strenge ,  Florian Foebel ,  Bjoern Friedmann

IPC: G06F3/06 ,  H04L29/08 ,  H04L29/06

CPC classification number: G06F3/0644 ,  G06F3/0604 ,  G06F3/067 ,  G06F9/544 ,  G06F9/546 ,  H04L67/1097 ,  H04L67/42

Abstract: A system, a method, and a computer program product for scalable processes for write-order preserving data stream consumption. A data partition in a plurality of data partitions of data stream is selected based on a request received from a client processing node. The plurality of data partitions are distributed among a plurality of broker nodes in a distributed messaging system. A broker node in the plurality of broker nodes hosting the selected data partition is identified. The identified broker node provides the selected data partition to the client processing node for performing at least one function.