System for handling concurrent property graph queries

A method for concurrently querying a property graph implemented in a distributed network of nodes, comprising:

• determining on a node of a plurality of nodes within the distributed network of nodes a subgraph shard of a plurality of subgraph shards of the property graph, the node storing data for the subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph, the subgraph shard having boundary vertices that have edges that connect the subgraph shard to boundary vertices of another subgraph shard, the subgraph shard comprising a set of edge-sets containing vertices within a certain range by vertex identifier;
• receiving concurrent queries of the property graph from at least one user;
• scheduling a query of the subgraph shard of the plurality of subgraph shards in accordance with an initial vertex for each concurrent user query;
• traversing the property graph during execution of the concurrent queries by traversing edge-sets within the subgraph shard;
• and
• the node sending values of boundary vertices of the subgraph shard to at least one other node having another subgraph shard sharing the boundary vertices using messaging during traversal of the property graph.

A non-transitory computer-readable medium storing computer instructions for concurrently querying a property graph implemented in a distributed network of nodes, that when executed by one or more processors, cause the one or more processors to perform operations comprising:

• determining on a node of a plurality of nodes within the distributed network of nodes a subgraph shard of a plurality of subgraph shards of the property graph, the node storing data for the subgraph shard that contains a range of local vertices that are a subset of all vertices of the property graph, the subgraph shard having boundary vertices that have edges that connect the subgraph shard to boundary vertices of another subgraph shard, the subgraph shard comprising a set of edge-sets containing vertices within a certain range by vertex identifier;
• receiving concurrent queries of the property graph from at least one user;
• scheduling a query of the subgraph shard of the plurality of subgraph shards in accordance with an initial vertex for each concurrent user query;
• traversing the property graph during execution of the concurrent queries by traversing edge-sets within the subgraph shard;
• and
• the node sending values of boundary vertices of the subgraph shard to at least one other node having another subgraph shard sharing the boundary vertices using messaging during traversal of the property graph.