{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:39:43Z","timestamp":1766219983276,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","funder":[{"name":"National Natural Science Foundation of China Grant","award":["62202216"],"award-info":[{"award-number":["62202216"]}]},{"name":"Guangdong Basic and Applied Basic Research Foundation Grant","award":["2023A1515010244"],"award-info":[{"award-number":["2023A1515010244"]}]},{"name":"Shenzhen Science and Technology Program Grant","award":["20231121101752002"],"award-info":[{"award-number":["20231121101752002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3754598.3754603","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"470-479","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ParaCOSM: A Parallel Framework for Continuous Subgraph Matching"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1870-783X","authenticated-orcid":false,"given":"Haibin","family":"Lai","sequence":"first","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9991-5136","authenticated-orcid":false,"given":"Sicheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4507-8026","authenticated-orcid":false,"given":"Site","family":"Fan","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1903-6428","authenticated-orcid":false,"given":"Zhuozhao","family":"Li","sequence":"additional","affiliation":[{"name":"Southern University of Science and Technology, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00038"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300086"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456253"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"V. Bonnici R. Giugno A. Pulvirenti D. Shasha and A. Ferro. 2013. A subgraph isomorphism algorithm and its application to biochemical data. BMC bioinformatics 14 Suppl 7 (2013) S13.","DOI":"10.1186\/1471-2105-14-S7-S13"},{"key":"e_1_3_3_2_7_2","unstructured":"Sutanay Choudhury Lawrence Holder George Chin Khushbu Agarwal and John Feo. 2015. A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. arxiv:https:\/\/arXiv.org\/abs\/1503.00849\u00a0[cs.DB] https:\/\/arxiv.org\/abs\/1503.00849"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Luigi\u00a0P. Cordella Pasquale Foggia Carlo Sansone and Mario Vento. 2004. A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. IEEE PAMI 26 10 (2004) 1367\u20131372.","DOI":"10.1109\/TPAMI.2004.75"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989420"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Wenfei Fan Xin Wang and Yinghui Wu. 2013. Incremental graph pattern matching. ACM Trans. Database Syst. 38 3 Article 18 (Sept. 2013) 47\u00a0pages.","DOI":"10.1145\/2489791"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457263"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Pankaj Gupta Venu Satuluri Ajeet Grewal Siva Gurumurthy Volodymyr Zhabiuk Quannan Li and Jimmy Lin. 2014. Real-time twitter recommendation: online motif detection in large dynamic graphs. Proc. VLDB Endow. 7 13 (Aug. 2014) 1379\u20131380.","DOI":"10.14778\/2733004.2733010"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465300"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"M. Idris M. Ugarte S. Vansummeren et\u00a0al. 2020. General dynamic Yannakakis: conjunctive queries with theta joins under updates. The VLDB Journal 29 4 (2020) 619\u2013653.","DOI":"10.1007\/s00778-019-00590-9"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196917"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Sofiane Lagraa Martin Hus\u00e1k Hamida Seba Satyanarayana Vuppala Radu State and Moussa Ouedraogo. 2024. A review on graph-based approaches for network security monitoring and botnet detection. International Journal of Information Security 23 1 (2024) 119\u2013140.","DOI":"10.1007\/s10207-023-00742-7"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00257"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3689031.3717491"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Seunghwan Min Sung\u00a0Gwan Park Kunsoo Park Dora Giammarresi Giuseppe\u00a0F. Italiano and Wook-Shin Han. 2021. Symmetric continuous subgraph matching with bidirectional dynamic programming. Proc. VLDB Endow. 14 8 (April 2021) 1298\u20131310.","DOI":"10.14778\/3457390.3457395"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Zhenxuan Pan Tao Wu Qingwen Zhao Qiang Zhou Zhiwei Peng Jiefeng Li Qi Zhang Guanyu Feng and Xiaowei Zhu. 2023. GeaFlow: A Graph Extended and Accelerated Dataflow System. Proc. ACM Manag. Data 1 2 Article 191 (June 2023) 27\u00a0pages.","DOI":"10.1145\/3589771"},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3650076"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00248"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Xuguang Ren and Junhu Wang. 2015. Exploiting vertex relationships in speeding up subgraph isomorphism over large graphs. Proceedings of the VLDB Endowment 8 5 (2015) 617\u2013628.","DOI":"10.14778\/2735479.2735493"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Shixuan Sun Xibo Sun Bingsheng He and Qiong Luo. 2022. RapidFlow: an efficient approach to continuous subgraph matching. Proc. VLDB Endow. 15 11 (July 2022) 2415\u20132427.","DOI":"10.14778\/3551793.3551803"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Xibo Sun Shixuan Sun Qiong Luo and Bingsheng He. 2022. An in-depth study of continuous subgraph matching. Proceedings of the VLDB Endowment 15 7 (2022) 1403\u20131416.","DOI":"10.14778\/3523210.3523218"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Zhao Sun Hongzhi Wang Haixun Wang Bin Shao and Jianzhong Li. 2012. Efficient subgraph matching on billion node graphs. Proc. VLDB Endow. 5 9 (May 2012) 788\u2013799.","DOI":"10.14778\/2311906.2311907"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"J.\u00a0R. Ullmann. 1976. An Algorithm for Subgraph Isomorphism. J. ACM 23 1 31\u201342.","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037748"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS57955.2024.00097"},{"key":"e_1_3_3_2_32_2","first-page":"1","volume-title":"SC21: International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Xiang Lizhi","year":"2021","unstructured":"Lizhi Xiang, Arif Khan, Edoardo Serra, Mahantesh Halappanavar, and Aravind Sukumaran-Rajam. 2021. cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPU Systems Using Trie Based Data Structure. In SC21: International Conference for High Performance Computing, Networking, Storage and Analysis. 1\u201313."},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","unstructured":"Rongjian Yang Zhijie Zhang Weiguo Zheng and Jeffrey\u00a0Xu Yu. 2023. Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction. Proc. ACM Manag. Data 1 1 Article 15 (May 2023) 26\u00a0pages.","DOI":"10.1145\/3588695"},{"key":"e_1_3_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626246.3653373"},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"crossref","unstructured":"Zhijie Zhang Yujie Lu Weiguo Zheng and Xuemin Lin. 2024. A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends Unbiasedness and Interaction. Proc. ACM Manag. Data 2 1 Article 60 (March 2024) 29\u00a0pages.","DOI":"10.1145\/3639315"}],"event":{"name":"ICPP '25: 54th International Conference on Parallel Processing","location":"San Diego CA USA","acronym":"ICPP '25"},"container-title":["Proceedings of the 54th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3754598.3754603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:36:14Z","timestamp":1766219774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":34,"alternative-id":["10.1145\/3754598.3754603","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754603","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}