@inproceedings{10.1145/3552326.3567489,
author = {Jamshidi, Kasra and Xu, Harry and Vora, Keval},
title = {Accelerating Graph Mining Systems with Subgraph Morphing},
year = {2023},
isbn = {9781450394871},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3552326.3567489},
doi = {10.1145/3552326.3567489},
abstract = {Graph mining applications analyze the structural properties of large graphs. These applications are computationally expensive because finding structural patterns requires checking subgraph isomorphism, which is NP-complete. This paper exploits the sub-structural similarities across different patterns by employing Subgraph Morphing to accurately infer the results for a given set of patterns from the results of a completely different set of patterns that are less expensive to compute. To enable Subgraph Morphing in practice, we develop efficient query transformation techniques as well as automatic result conversion strategies for different application scenarios. We have implemented Subgraph Morphing in four state-of-the-art graph mining and subgraph matching systems: Peregrine, AutoMine/- GraphZero, GraphPi, and BigJoin; a thorough evaluation demonstrates that Subgraph Morphing improves the performance of these four systems by 34\texttimes{}, 10\texttimes{}, 18\texttimes{}, and 13\texttimes{}, respectively.},
booktitle = {Proceedings of the Eighteenth European Conference on Computer Systems},
pages = {162–181},
numpages = {20},
keywords = {frequent subgraph mining, graph system performance, subgraph exploration, motifs},
location = {Rome, Italy},
series = {EuroSys '23}
}