Due to the high computational cost and space cost in computing node similarity
it is a challenge when it comes to efficiently computing the similarity on big graphs.In this paper
the following problem will be resolved:how to fast compute SuperSimRank similarity on massive graphs using a single PC.A threshold sieving technology and an external algorithm are introduced.With the help of threshold sieving technology
our external algorithm can efficiently compute the similarity on massive graphs.Experimental results demonstrate the efficiency of the computation.