| CPC G06F 16/9024 (2019.01) [G06F 16/27 (2019.01)] | 20 Claims |

|
1. A method for calculating and storing a flow graph, the flow graph comprising nodes and edges, with the edges indicating a flow direction of data flowing between the nodes, the method being performed by a first calculation unit of a plurality of calculation units configured to collectively store the flow graph in a distributed manner, and comprising one or more rounds of processing respectively corresponding to one or more time periods of data flow, and a round of processing comprising:
obtaining a first graph data segment of a current subgraph based on newly added flow information in a current time period and storing the first graph data segment, so as to implement distributed storage of the current subgraph in collaboration with a second calculation unit of the plurality of calculation units; and
for a node in the first graph data segment of the current subgraph, obtaining a flow message of data corresponding to an ingress edge of the node from a source node on the ingress edge and storing the flow message, wherein the flow message includes a source link of the data.
|