CPC G06F 16/27 (2019.01) [G06F 16/2282 (2019.01); G06F 16/284 (2019.01)] | 20 Claims |
1. A computer-implemented method comprising:
storing, in a relational database, a plurality of tables, wherein:
each table of the plurality of tables contains a respective plurality of rows, and
each row of the plurality of rows of each table contains a vertex of a graph;
identifying a plurality of high-degree vertices, wherein:
each high-degree vertex in the plurality of high-degree vertices is connected to a respective plurality of edges in the graph, and
a count of the plurality of edges of each high-degree vertex exceeds a degree threshold;
detecting that all vertices in a high-degree subset of tables of the plurality of tables are high-degree vertices; and
replicating, based on said detecting all vertices in the high-degree subset of tables are high-degree vertices, a plurality of vertices of the graph that are not in the high-degree subset of tables to a plurality of computers.
|