A computer-implemented method for processing a continuous data stream by a platform to construct a continuously changing graph structure to capture the relationship existing in the continuous data stream, the platform comprising a plurality of graph nodes, a global progress table, a snapshooter and a plurality of ingest nodes, the nodes of the platform corresponding to computer system nodes, the graph structure being split into a plurality of logical partitions each assigned to a graph node of the plurality of the graph nodes, the method comprising: receiving, by an ingest node of the plurality of ingest nodes, a record of the continuous data stream; generating, by the ingest node, one or more graph-update operations based on the record to update one or more respective logical partitions of the graph structure; assigning, by the ingest node, a sequence number to the one or more graph-update operations; distributing, by the ingest node, the one or more graph-update operations with the sequence number to the one or more respective logical partitions of the plurality of graph nodes; recording, by the ingest node, the sequence number for the ingest node in a global progress table after the one or more graph-update operations are stored by the one or more respective logical partitions of the plurality of graph nodes, the global progress table recording a sequence number for each ingest node of the plurality of ingest nodes to monitor the graph update progresses, the sequence numbers for the ingest nodes forming a vector; defining, by the snapshooter, an end of an epoch based on the vector of the global progress table; and producing, by the plurality of graph nodes, a graph structure snapshot by executing the one or more graph-update operations and one or more other graph-update operations previously distributed that are stored in the logical partitions of the plurality of graph nodes and are within the epoch. receiving, by an ingest node of the plurality of ingest nodes, a record of the continuous data stream; generating, by the ingest node, one or more graph-update operations based on the record to update one or more respective logical partitions of the graph structure; assigning, by the ingest node, a sequence number to the one or more graph-update operations; distributing, by the ingest node, the one or more graph-update operations with the sequence number to the one or more respective logical partitions of the plurality of graph nodes; recording, by the ingest node, the sequence number for the ingest node in a global progress table after the one or more graph-update operations are stored by the one or more respective logical partitions of the plurality of graph nodes, the global progress table recording a sequence number for each ingest node of the plurality of ingest nodes to monitor the graph update progresses, the sequence numbers for the ingest nodes forming a vector; defining, by the snapshooter, an end of an epoch based on the vector of the global progress table; and producing, by the plurality of graph nodes, a graph structure snapshot by executing the one or more graph-update operations and one or more other graph-update operations previously distributed that are stored in the logical partitions of the plurality of graph nodes and are within the epoch.