Efficient network updates

A method, implemented in a computing system comprising at least one hardware processor and at least one memory coupled to the at least one hardware processor, the method comprising:

• receiving a plurality of data changes to one or more data objects;
• assigning timestamps to respective data changes of the plurality of data changes;
• storing in a data structure data changes, respective data change timestamps, and a respective indicator of a data change type;
• initiating a graph update process to update an assignment of a plurality of data objects to a plurality of graphs, respective graphs of the plurality of graphs being disconnected from one another, being comprised of a grouping of one or more data objects that are connected via edges, and being associated with a respective identifier identifying the respective graph;
• for respective data objects of the plurality of data objects, determining a last data change for the respective data object based on the timestamps;
• for a first data object of the plurality of data objects, determining that a last data change for the first data object comprises a deletion operation;
• identifying a first graph of the plurality of graphs that comprises the first data object;
• removing the first data object from the first graph;
• for at least one edge in the first graph connecting the first data object to a second data object of the first graph, removing contributions of the first data object to the at least one edge;
• for a third data object of the one or more data objects, determining that a last data change for the third data object comprises an addition operation for the third data object;
• adding (1) at least one edge between the third data object and at least a fourth data object of the first graph, or (2) at least a fifth data object to the plurality of data objects;
• determining updated disconnected groupings of data objects;
• based at least in part on the updated disconnected groupings of data objects, associating one or more of the data objects for which a last data changed was determined based on the timestamps with an identifier identifying a graph, wherein the updated identifier identifies the respective graph;
• and
• storing a set of updated graphs based at least in part on the associating one or more of the data objects with their respective updated identifiers, wherein performing read or write operations on data objects of an updated set of disconnected graphs corresponding to the updated disconnected groupings is carried out with improved processing efficiency.

One or more computer-readable storage media comprising:

• computer-executable instructions that, when executed by a computing system, cause the computing system to receive a plurality of data changes to one or more data objects;
• computer-executable instructions that, when executed by the computing system, cause the computing system to assign timestamps to respective data changes of the plurality of data changes;
• computer-executable instructions that, when executed by the computing system, cause the computing system to store in a data structure data changes, respective data change timestamps, and a respective indicator of a data change type;
• computer-executable instructions that, when executed by the computing system, cause the computing system to initiate a graph update process to update an assignment of a plurality of data objects to a plurality of graphs, respective graphs of the plurality of graphs being disconnected from one another, being comprised of a grouping of one or more data objects that are connected via edges, and being associated with a respective identifier identifying the respective graph;
• computer-executable instructions that, when executed by the computing system, cause the computing system to, for respective data objects of the plurality of data objects, determine a last data change for the respective data object based on the timestamps;
• computer-executable instructions that, when executed by the computing system, cause the computing system to, for a first data object of the plurality of data objects, determine that a last data change for the first data object comprises a deletion operation;
• computer-executable instructions that, when executed by the computing system, cause the computing system to identify a first graph of the plurality of networks that comprises the first data object;
• computer-executable instructions that, when executed by the computing system, cause the computing system to remove the first data object from the first graph;
• computer-executable instructions that, when executed by the computing system, cause the computing system to, for at least one edge in the first graph connecting the first data object to a second data object of the first graph, remove contributions of the first data object to the at least one edge;
• computer-executable instructions that, when executed by the computing system, cause the computing system to, for a third data object of the one or more data objects, determine that a last data change for the third data object comprises an addition operation for the third data object;
• computer-executable instructions that, when executed by the computing system, cause the computing system to add (1) at least one edge between the third data object and at least a fourth data object of the first graph, or (2) at least a fifth data object to the plurality of data objects;
• computer-executable instructions that, when executed by the computing system, cause the computing system to determine updated disconnected groupings of data objects;
• computer-executable instructions that, when executed by the computing system, cause the computing system to, based at least in part on the updated disconnected groupings of data objects, associate one or more of the data objects for which a last data changed was determined based on the timestamps with an identifier identifying a graph, wherein the updated identifier identifies the respective graph or another graph;
• and
• computer-executable instructions that, when executed by the computing system, cause the computing system to store a set of updated graphs based at least in part on the associating one or more of the data objects with their respective updated identifiers, wherein performing read or write operations on data objects of an updated set of disconnected graphs corresponding to the updated disconnected groupings is carried out with improved processing efficiency.