Preventing reader starvation during order preserving data stream consumption

    公开(公告)号:US10728186B2

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

    申请号:US15604019

    申请日:2017-05-24

    Applicant: SAP SE

    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.

    PREVENTING READER STARVATION DURING ORDER PRESERVING DATA STREAM CONSUMPTION

    公开(公告)号:US20180343213A1

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

    申请号:US15604019

    申请日:2017-05-24

    Applicant: SAP SE

    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.

    STATIC HIERARCHY BASED QUERY EXECUTION
    13.
    发明申请

    公开(公告)号:US20180081941A1

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

    申请号:US15272851

    申请日:2016-09-22

    Applicant: SAP SE

    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.

Patent Agency Ranking