10. The method according to claim 9 , wherein searching the roadmap node tree in order to obtain the first to-be-queried graph node comprises: obtaining auxiliary information of each roadmap node in the roadmap node tree according to the query condition; determining, according to the auxiliary information of the roadmap node, a path policy in order to obtain the first to-be-queried graph node; and searching the roadmap node tree according to the path policy in order to obtain the first to-be-queried graph node.
9. 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.