1. A graph data search method, comprising: obtaining 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; filtering 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, wherein the reduction subgraph comprises the start graph node, the first to-be-queried graph node matching the query condition, and an association relationship between the start graph node and the first to-be-queried graph node; and performing a query in the reduction subgraph using the query condition to obtain the first to-be-queried graph node.