The invention discloses a method for quickly calculating graph node similarity.The method includes the steps that route sampling is conducted on a given graph, and an inverted index from nodes to a route is constructed; as for all the nodes in the graph, a co-occurrence route node of each node is obtained according to the inverted index, and approximate similarity between each node and the corresponding co-occurrence route node is calculated; as for the nodes in the graph, and similarity values of top-k approximate similarity points are selected as feature vectors of the nodes; a kd-tree index is built according to the feature vectors of the nodes in the graph; according to the kd-tree index, top-k structure similar points of each node vector in the graph are calculated.The method has the advantage that approximate similarity and structure similarity can be quickly calculated in a unified mode.