{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T12:42:27Z","timestamp":1760013747438,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1750760"],"award-info":[{"award-number":["1750760"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,14]]},"DOI":"10.1145\/3661304.3661897","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T09:12:06Z","timestamp":1717578726000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Understanding High-Performance Subgraph Pattern Matching: A Systems Perspective"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7361-812X","authenticated-orcid":false,"given":"Akshit","family":"Sharma","sequence":"first","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7521-5781","authenticated-orcid":false,"given":"Dinesh","family":"Mehta","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-1696-4272","authenticated-orcid":false,"given":"Bo","family":"Wu","sequence":"additional","affiliation":[{"name":"Colorado School of Mines, Golden, CO, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Empty-headed: A relational engine for graph processing. ACM Transactions on Database Systems (TODS) 42, 4","author":"Aberger C. R.","year":"2017","unstructured":"Aberger, C. R., Lamb, A., Tu, S., N\u00f6tzli, A., Olukotun, K., and R\u00e9, C. Empty-headed: A relational engine for graph processing. ACM Transactions on Database Systems (TODS) 42, 4 (2017), 20."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544814"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00142"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3184470.3184473"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589312"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_2_1_8_1","volume-title":"A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics 14, 7","author":"Bonnici V.","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., and Ferro, A. A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics 14, 7 (2013), 1--13."},{"key":"e_1_3_2_1_9_1","volume-title":"Compliation techniques for graphs algorithms on gpus. CoRR abs\/2012.07990","author":"Brahmakshatriya A.","year":"2020","unstructured":"Brahmakshatriya, A., Zhang, Y., Hong, C., Kamil, S., Shun, J., and Amarasinghe, S. P. Compliation techniques for graphs algorithms on gpus. CoRR abs\/2012.07990 (2020)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.07.001"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-20081-7_14"},{"key":"e_1_3_2_1_12_1","volume-title":"Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3","author":"Carletti V.","year":"2017","unstructured":"Carletti, V., Foggia, P., Saggese, A., and Vento, M. Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE transactions on pattern analysis and machine intelligence 40, 4 (2017), 804--818."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_2_1_14_1","volume-title":"Dwarvesgraph: A high-performance graph mining system with pattern decomposition","author":"Chen J.","year":"2020","unstructured":"Chen, J., and Qian, X. Dwarvesgraph: A high-performance graph mining system with pattern decomposition, 2020."},{"key":"e_1_3_2_1_15_1","volume-title":"Kudu: An efficient and scalable distributed graph pattern mining engine. arXiv preprint arXiv:2105.03789","author":"Chen J.","year":"2021","unstructured":"Chen, J., and Qian, X. Kudu: An efficient and scalable distributed graph pattern mining engine. arXiv preprint arXiv:2105.03789 (2021)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_2_1_18_1","first-page":"1357","volume-title":"Proceedings of the 2019 International Conference on Management of Data (New York, NY, USA, 2019), SIGMOD '19, Association for Computing Machinery","author":"Dias V.","unstructured":"Dias, V., Teixeira, C. H. C., Guedes, D., Meira, W., and Parthasarathy, S. Fractal: A general-purpose graph pattern mining system. In Proceedings of the 2019 International Conference on Management of Data (New York, NY, USA, 2019), SIGMOD '19, Association for Computing Machinery, p. 1357--1374."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732289"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319880"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534540.3534690"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3587136.3587144"},{"key":"e_1_3_2_1_25_1","first-page":"1","article-title":"Fast subgraph matching by dynamic graph editing","author":"Jiang Z.","year":"2023","unstructured":"Jiang, Z., Zhang, S., Liu, B., Hou, X., Yuan, M., and You, H. Fast subgraph matching by dynamic graph editing. IEEE Transactions on Services Computing (2023), 1--12.","journal-title":"IEEE Transactions on Services Computing ("},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00129"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.018"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_2_1_29_1","first-page":"925","volume-title":"Proceedings of the 2021 International Conference on Management of Data (New York, NY, USA, 2021), SIGMOD '21, Association for Computing Machinery","author":"Kim H.","unstructured":"Kim, H., Choi, Y., Park, K., Lin, X., Hong, S.-H., and Han, W.-S. Versatile equivalences: Speeding up subgraph query processing and subgraph matching. In Proceedings of the 2021 International Conference on Management of Data (New York, NY, USA, 2021), SIGMOD '21, Association for Computing Machinery, p. 925--937."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196917"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2017.133"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794368"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021937"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT58117.2023.00026"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00028"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.10.005"},{"key":"e_1_3_2_1_43_1","first-page":"2","article-title":"Subgraph matching: on compression and computation","volume":"11","author":"Qiao M.","year":"2017","unstructured":"Qiao, M., Zhang, H., and Cheng, H. Subgraph matching: on compression and computation. PVLDB 11, 2 (2017), 176--188.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621939"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342272"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3127479.3131625"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588557"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00104"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00163"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00029"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/PADSW.2018.8644869"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380581"},{"key":"e_1_3_2_1_55_1","first-page":"1","article-title":"Subgraph matching with effective matching order and indexing","volume":"34","author":"Sun S.","year":"2020","unstructured":"Sun, S., and Luo, Q. Subgraph matching with effective matching order and indexing. IEEE Transactions on Knowledge and Data Engineering 34, 1 (2020), 491--505.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589326"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_2_1_58_1","first-page":"425","volume-title":"Proceedings of the 25th Symposium on Operating Systems Principles (New York, NY, USA, 2015), SOSP '15, Association for Computing Machinery","author":"Teixeira C. H. C.","unstructured":"Teixeira, C. H. C., Fonseca, A. J., Serafini, M., Siganos, G., Zaki, M.J., and Aboulnaga, A. Arabesque: a system for distributed graph mining. In Proceedings of the 25th Symposium on Operating Systems Principles (New York, NY, USA, 2015), SOSP '15, Association for Computing Machinery, p. 425--440."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_1_60_1","first-page":"507","volume-title":"2016 USENIX Annual Technical Conference (USENIX ATC 16)","author":"Vora K.","year":"2016","unstructured":"Vora, K., Xu, G., and Gupta, R. Load the edges you need: A generic i\/o optimization for disk-based graph processing. In 2016 USENIX Annual Technical Conference (USENIX ATC 16) (Denver, CO, 2016), USENIX Association, pp. 507--522."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00021"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcms.1"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.102997"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"e_1_3_2_1_65_1","first-page":"2049","volume-title":"Proceedings of the 2021 International Conference on Management of Data (New York, NY, USA, 2021), SIGMOD '21, Association for Computing Machinery","author":"Yang Z.","unstructured":"Yang, Z., Lai, L., Lin, X., Hao, K., and Zhang, W. Huge: An efficient and scalable subgraph enumeration system. In Proceedings of the 2021 International Conference on Management of Data (New York, NY, USA, 2021), SIGMOD '21, Association for Computing Machinery, p. 2049--2062."},{"key":"e_1_3_2_1_66_1","first-page":"192","volume-title":"Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (New York, NY, USA, 2009), EDBT '09, Association for Computing Machinery","author":"Zhang S.","unstructured":"Zhang, S., Li, S., and Yang, J. Gaddi: distance index based subgraph matching in biological networks. In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (New York, NY, USA, 2009), EDBT '09, Association for Computing Machinery, p. 192--203."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8257937"},{"key":"e_1_3_2_1_68_1","first-page":"1","article-title":"Graphit: a high-performance graph DSL","volume":"2","author":"Zhang Y.","unstructured":"Zhang, Y., Yang, M., Baghdadi, R., Kamil, S., Shun, J., and Amarasinghe, S. P. Graphit: a high-performance graph DSL. PACMPL 2, OOPSLA (2018), 121:1--121:30.","journal-title":"PACMPL"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00064"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"}],"event":{"name":"SIGMOD\/PODS '24: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Santiago AA Chile","acronym":"SIGMOD\/PODS '24"},"container-title":["Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661304.3661897","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3661304.3661897","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T20:31:56Z","timestamp":1755981116000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3661304.3661897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,9]]},"references-count":70,"alternative-id":["10.1145\/3661304.3661897","10.1145\/3661304"],"URL":"https:\/\/doi.org\/10.1145\/3661304.3661897","relation":{},"subject":[],"published":{"date-parts":[[2024,6,9]]},"assertion":[{"value":"2024-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}