Distributed subgraph matching on timely dataflow

Longbin Lai, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin (+1 others)
2019 Proceedings of the VLDB Endowment  
Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithmlevel comparisons failed to provide a systematic view of distributed subgraph matching mainly due to the intertwining of strategy and optimization. In this paper, we identify four strategies and three general-purpose optimizations from representative state-of-the-art algorithms. We implement the four strategies with the optimizations based on the common Timely dataflow system for
more » ... ystematic strategy-level comparison. Our implementation covers all representative algorithms. We conduct extensive experiments for both unlabelled matching and labelled matching to analyze the performance of distributed subgraph matching under various settings, which is finally summarized as a practical guide.
doi:10.14778/3339490.3339494 fatcat:ln7xhyl5h5g2fa6pjbpe5gfseu