A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 fordoi:10.14778/3339490.3339494 fatcat:ln7xhyl5h5g2fa6pjbpe5gfseu