{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:08:10Z","timestamp":1763644090765,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62325205,62072228,62322205"],"award-info":[{"award-number":["62325205,62072228,62322205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,25]]},"DOI":"10.1109\/hpec58863.2023.10363569","type":"proceedings-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T19:39:57Z","timestamp":1703533197000},"page":"1-7","source":"Crossref","is-referenced-by-count":8,"title":["SMOG: Accelerating Subgraph Matching on GPUs"],"prefix":"10.1109","author":[{"given":"Zhibin","family":"Wang","sequence":"first","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziheng","family":"Meng","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xue","family":"Li","sequence":"additional","affiliation":[{"name":"National Engineering Research Center for Big Data Technology and System\/ Services Computing Technology and System Lab\/Cluster and Grid Computing Laboratory,Alibaba Group&#x201C;"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Lin","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Zheng","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Tian","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Zhong","sequence":"additional","affiliation":[{"name":"Nanjing University,State Key Laboratory for Novel Software Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2775108"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2016.7840674"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2815554"},{"issue":"1","key":"ref5","first-page":"886","volume-title":"Distance-join: Pattern match query in a large graph database","volume":"2","author":"Zou","year":"2009"},{"issue":"2","key":"ref6","first-page":"232","article-title":"SAGA: a subgraph matching tool for biological graphs","volume-title":"Bioinformatics","volume":"23","author":"Tian","year":"2006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"ref8","first-page":"425","article-title":"Graph kernels in chemoinformatics","volume-title":"Quantitative Graph TheoryMathematical Foundations and Applications","author":"Ga\u00fcz\u00e8re","year":"2015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17283"},{"article-title":"How powerful are graph neural networks?","volume-title":"International Conference on Learning Representations","author":"Xu","key":"ref10"},{"key":"ref11","first-page":"10383","article-title":"Can graph neural networks count substructures?","volume":"33","author":"Chen","year":"2020","journal-title":"Advances in neural information processing sys-tems"},{"volume-title":"Graph Challenge","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916492"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926383"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2017.8091036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926376"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286167"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2018.8547570"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC49654.2021.9622799"},{"key":"ref20","first-page":"143","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"2023","journal-title":"Logic, Automata, and Computational Complexity: The Works of Stephen A. Cook"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926298"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/icde.2015.7113280"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/hpec.2017.8091051"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469383"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3064892"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3035564"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339497"},{"volume-title":"NVIDIA A100 GPU Architecture","year":"2020","author":"Nvidia","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719918.ch9"},{"volume-title":"Genbank","key":"ref37"},{"volume-title":"MAWI Working Group Traffic Archive","year":"2012","author":"Group","key":"ref38"},{"key":"ref39","first-page":"857","article-title":"Efficient and scalable graph pattern mining on gpus","volume-title":"16th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2022","author":"Chen","year":"2022"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3016078.2851145"}],"event":{"name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2023,9,25]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,9,29]]}},"container-title":["2023 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10363430\/10363422\/10363569.pdf?arnumber=10363569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T22:41:47Z","timestamp":1705099307000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10363569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/hpec58863.2023.10363569","relation":{},"subject":[],"published":{"date-parts":[[2023,9,25]]}}}