On efficiently finding reverse k-nearest neighbors over uncertain graphs

Reverse k-nearest neighbor (RkNN) query on graphs returns the data objects that take a specified query object q as one of their k-nearest neighbors. It has significant influence in many real-life applications including resource allocation and profile-based marketing. However, to the best of our knowledge, there is little previous work on RkNN search over uncertain graph data, even though many complex networks such as traffic networks and protein-protein interaction networks are often modeled as uncertain graphs. In this paper, we systematically study the problem of reverse k-nearest neighbor search on uncertain graphs (UG-RkNN search for short), where graph edges contain uncertainty. First, to address UG-RkNN search, we propose three effective heuristics, i.e., GSP, EGR, and PBP, which minimize the original large uncertain graph as a much smaller essential uncertain graph, cut down the number of possible graphs via the newly introduced graph conditional dominance relationship, and reduce the validation cost of data nodes in order to improve query efficiency. Then, we present an efficient algorithm, termed as SDP, to support UG-RkNN retrieval by seamlessly integrating the three heuristics together. In view of the high complexity of UG-RkNN search, we further present a novel algorithm called TripS, with the help of an adaptive stratified sampling technique. Extensive experiments using both real and synthetic graphs demonstrate the performance of our proposed algorithms.