부산대학교 도서관

With the rapid development of social networks, the current scale of graph data continues to increase, and the performance of anonymous social network methods is limited. Node reachability query is essential in directed graphs, which can reflect the relationship between nodes and the direction of information dissemination. Aiming at the problem of the reachability of nodes between directed social network privacy technologies, this paper proposes a reachability preserving distribution perturbation (RPDP) algorithm, which is based on the distributed graph processing system GraphX. This algorithm first generates a Random Neighborhood Table (RNT) composed of four tuples for the nodes and then uses the message transmission of GraphX and “probe” mechanism. The proposed algorithm improves the disposal efficiency of the large-scale social network while maintaining the reachability of the nodes. Experiments based on the real social network data show that the proposed algorithm can keep the node reachability and deal with large-scale social network efficiently while protecting the character of the graph structure.