Scalable distributed subgraph enumeration

Publication Type:
Conference Proceeding
Citation:
Proceedings of the VLDB Endowment, 2016, 10 (3), pp. 217 - 228
Issue Date:
2016-01-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
p217-lai.pdfPublished version761.12 kB
Adobe PDF
© 2016. VLDB Endowment. Subgraph enumeration aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph. As the subgraph isomorphism operation is computationally intensive, researchers have recently focused on solving this problem in distributed environments, such as MapReduce and Pregel. Among them, the state-of-the-art algorithm, Twin Twig Join, is proven to be instance optimal based on a left-deep join framework. However, it is still not scalable to large graphs because of the constraints in the left-deep join framework and that each decomposed component (join unit) must be a star. In this paper, we propose SEED - a scalable subgraph enumeration approach in the distributed environment. Compared to Twin Twig Join, SEED returns optimal solution in a generalized join framework without the constraints in Twin Twig Join. We use both star and clique as the join units, and design an effective distributed graph storage mechanism to support such an extension. We develop a comprehensive cost model, that estimates the number of matches of any given pattern graph by considering powerlaw degree distribution in the data graph. We then generalize the left-deep join framework and develop a dynamic-programming algorithm to compute an optimal bushy join plan. We also consider overlaps among the join units. Finally, we propose clique compression to further improve the algorithm by reducing the number of the intermediate results. Extensive performance studies are conducted on several real graphs, one containing billions of edges. The results demonstrate that our algorithm outperforms all other state-of-the-art algorithms by more than one order of magnitude.
Please use this identifier to cite or link to this item: