Title: DDSL: Efficient Subgraph Listing on Distributed and Dynamic Graphs
Authors: Xun Jian, Yue Wang, Xiayu Lei, Yanyan Shen and Lei Chen
Abstract: Subgraph listing is a fundamental problem in graph theory and has wide applications in many areas. Modern graphs can usually be large-scale and highly dynamic, which challenges the efficiency of existing subgraph listing algorithms. In this paper, we propose an efficient join-based approach, called Distributed and Dynamic Subgraph Listing (DDSL), which can incrementally update the results instead of running from scratch. Extensive experiments are conducted on real-world datasets. The results show that DDSL outperforms existing methods in dealing with both static and dynamic graphs in terms of the responding time.
