The goal of link prediction (LP) is to predict the missing links in a graph [1]}.
LP is drawing increasing attention in the past decade due to its board practical applications [2]}.
For instance, LP can be used to recommend new friends on social media [3]}, and recommend attractive items to the costumers on E-commerce sites [4]}, so as to improve the user experience.
During inference, these applications demand the LP methods to retrieve the top scoring neighbors for a source node at low latencies.
This is especially challenging on large graphs because the LP methods need to search many candidate nodes to find the top scoring neighbors.
