Graph Data Search Method and Apparatus

A graph data search method, comprising:

• obtaining a query request, wherein the query request comprises a query condition that carries a start graph node and an end graph node, wherein the query request requests to query a first to-be-queried graph node in a graph data set matching the query condition, and wherein the graph data set comprises the start graph node, a plurality of to-be-queried graph nodes, the end graph node, and an association relationship between the start graph node, the end graph node, and the plurality of to-be-queried graph nodes;
• determining roadmap nodes in the graph data set according to betweenness centrality of a plurality of graph nodes in the graph data set and a preset available resource condition;
• establishing a roadmap node tree according to the roadmap nodes, wherein the roadmap node tree comprises roadmap nodes that have a hierarchical relationship;
• and
• searching the roadmap node tree according to the query condition to obtain the first to-be-queried graph node.

A graph data search apparatus, comprising:

• a memory comprising instructions;
• and
• a processor coupled to the memory, wherein the instructions cause the processor to be configured to:
• obtain a query request, wherein the query request comprises a query condition that carries a start graph node, wherein the query request queries a first to-be-queried graph node in a graph data set matching the query condition, and wherein the graph data set comprises the start graph node, a plurality of to-be-queried graph nodes, an association relationship between the start graph node and the plurality of to-be-queried graph nodes, and an association relationship between each to-be-queried graph node and another to-be-queried graph node in the plurality of to-be-queried graph nodes;
• filter out, according to the query condition and a preset available resource condition, a second to-be-queried graph node in the graph data set that does not meet the query condition and an association relationship in the graph data set comprising the second to-be-queried graph node in order to obtain a reduction subgraph;
• and
• perform a query in the reduction subgraph using the query condition to obtain the first to-be-queried graph node, wherein the reduction subgraph comprises the start graph node, the first to-be-queried graph node that matches the query condition, and an association relationship between the start graph node and the first to-be-queried graph node.

A graph data search apparatus, comprising:

• a memory comprising instructions;
• and
• a processor coupled to the memory, wherein the instructions cause the processor to be configured to:
• obtain a query request, wherein the query request comprises a query condition that carries a start graph node and an end graph node, wherein the query request requests to query a first to-be-queried graph node in a graph data set matching the query condition, and wherein the graph data set comprises the start graph node, a plurality of to-be-queried graph nodes, the end graph node, and an association relationship between the start graph node, the end graph node, and the plurality of to-be-queried graph nodes;
• determine roadmap nodes in the graph data set according to betweenness centrality of a plurality of graph nodes in the graph data set and a preset available resource condition;
• establish a roadmap node tree according to the roadmap nodes;
• and
• search the roadmap node tree according to the query condition in order to obtain the first to-be-queried graph node, wherein the roadmap node tree comprises roadmap nodes that have a hierarchical relationship.