{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:45:06Z","timestamp":1782999906595,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T00:00:00Z","timestamp":1783209600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Huawei Technologies Co., Ltd","award":["TC20220913039"],"award-info":[{"award-number":["TC20220913039"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3797905.3807860","type":"proceedings-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T11:50:37Z","timestamp":1782993037000},"page":"565-575","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["HoloGraph: Bridging the Throughput Gap in Heterogeneous Graph Pattern Matching via Workload-Aware Steering"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8767-2629","authenticated-orcid":false,"given":"Haotian","family":"Ma","sequence":"first","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0833-7981","authenticated-orcid":false,"given":"Wei-Chung","family":"Hsu","sequence":"additional","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8704-9821","authenticated-orcid":false,"given":"Yeh-Ching","family":"Chung","sequence":"additional","affiliation":[{"name":"School of Data Science, The Chinese University of Hong Kong, Shenzhen, Shenzhen, Guangdong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Christopher\u00a0R. Aberger Andrew Lamb Susan Tu Andres N\u00f6tzli Kunle Olukotun and Christopher R\u00e9. 2017. EmptyHeaded: A Relational Engine for Graph Processing. ACM Trans. Database Syst. 42 4 Article 20 (Oct. 2017) 44\u00a0pages. 10.1145\/3129246","DOI":"10.1145\/3129246"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Noga Alon Phuong Dao Iman Hajirasouliha Fereydoun Hormozdiari and S.\u00a0Cenk Sahinalp. 2008. Biomolecular network motif counting and discovery by color coding. Bioinformatics 24 13 (07 2008) i241\u2013i249. 10.1093\/bioinformatics\/btn163","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Paolo Boldi Andrea Marino Massimo Santini and Sebastiano Vigna. 2018. BUbiNG: Massive Crawling for the Masses. ACM Trans. Web 12 2 Article 12 (June 2018) 26\u00a0pages. 10.1145\/3160017","DOI":"10.1145\/3160017"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963488"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","unstructured":"P. Boldi and S. Vigna. 2004. The webgraph framework I: compression techniques(WWW \u201904). Association for Computing Machinery New York NY USA 595\u2013602. 10.1145\/988672.988752","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190508.3190545"},{"key":"e_1_3_3_1_8_2","first-page":"857","volume-title":"16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22)","author":"Chen Xuhao","year":"2022","unstructured":"Xuhao Chen and Arvind. 2022. Efficient and Scalable Graph Pattern Mining on GPUs. In 16th USENIX Symposium on Operating Systems Design and Implementation (OSDI 22). USENIX Association, Carlsbad, CA, 857\u2013877. https:\/\/www.usenix.org\/conference\/osdi22\/presentation\/chen"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447818.3460359"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Xuhao Chen Roshan Dathathri Gurbinder Gill and Keshav Pingali. 2020. Pangolin: an efficient and flexible graph mining system on CPU and GPU. Proc. VLDB Endow. 13 8 (April 2020) 1190\u20131205. 10.14778\/3389133.3389137","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA52012.2021.00052"},{"key":"e_1_3_3_1_12_2","series-title":"(NIPS \u201920)","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures?. In Proceedings of the 34th International Conference on Neural Information Processing Systems (Vancouver, BC, Canada) (NIPS \u201920). Curran Associates Inc., Red Hook, NY, USA, Article 871, 13\u00a0pages."},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"M. Deshpande M. Kuramochi N. Wale and G. Karypis. 2005. Frequent substructure-based approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering 17 8 (2005) 1036\u20131050. 10.1109\/TKDE.2005.127","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"G.W. Flake S. Lawrence C.L. Giles and F.M. Coetzee. 2002. Self-organization and identification of Web communities. Computer 35 3 (2002) 66\u201370. 10.1109\/2.989932","DOI":"10.1109\/2.989932"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/1758222.1758229"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Wentian Guo Yuchen Li and Kian-Lee Tan. 2022. Exploiting Reuse for GPU Subgraph Enumeration. IEEE Transactions on Knowledge and Data Engineering 34 9 (2022) 4231\u20134244. 10.1109\/TKDE.2020.3035564","DOI":"10.1109\/TKDE.2020.3035564"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196924"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"Yanqing Hu Shenggong Ji Yuliang Jin Ling Feng H.\u00a0Eugene Stanley and Shlomo Havlin. 2018. Local structure can identify and quantify influential global spreaders in large scale social networks. Proceedings of the National Academy of Sciences 115 29 (2018) 7468\u20137472. arXiv:https:\/\/www.pnas.org\/doi\/pdf\/10.1073\/pnas.171054711510.1073\/pnas.1710547115","DOI":"10.1073\/pnas.1710547115"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387548"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Kasra Jamshidi and Keval Vora. 2021. A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE. SIGOPS Oper. Syst. Rev. 55 1 (June 2021) 1\u201310. 10.1145\/3469379.3469381","DOI":"10.1145\/3469379.3469381"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-61520-911-8.ch001"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"e_1_3_3_1_24_2","first-page":"53","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Lai Longbin","year":"2023","unstructured":"Longbin Lai, Yufan Yang, Zhibin Wang, Yuxuan Liu, Haotian Ma, Sijie Shen, Bingqing Lyu, Xiaoli Zhou, Wenyuan Yu, Zhengping Qian, Chen Tian, Sheng Zhong, Yeh-Ching Chung, and Jingren Zhou. 2023. GLogS: Interactive Graph Pattern Matching Query At Large Scale. In 2023 USENIX Annual Technical Conference (USENIX ATC 23). USENIX Association, Boston, MA, 53\u201369. https:\/\/www.usenix.org\/conference\/atc23\/presentation\/lai"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","unstructured":"Daniel Lemire Leonid Boytsov and Nathan Kurz. 2016. SIMD compression and the intersection of sorted integers. Softw. Pract. Exper. 46 6 (June 2016) 723\u2013749. 10.1002\/spe.2326","DOI":"10.1002\/spe.2326"},{"key":"e_1_3_3_1_26_2","series-title":"(FAST\u201917)","first-page":"285","volume-title":"Proceedings of the 15th Usenix Conference on File and Storage Technologies","author":"Liu Hang","year":"2017","unstructured":"Hang Liu and H.\u00a0Howie Huang. 2017. Graphene: fine-grained IO management for graph computing. In Proceedings of the 15th Usenix Conference on File and Storage Technologies (Santa clara, CA, USA) (FAST\u201917). USENIX Association, USA, 285\u2013299."},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00028"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Daniel Mawhirter Sam Reinehr Connor Holmes Tongping Liu and Bo Wu. 2021. GraphZero: A High-Performance Subgraph Matching System. SIGOPS Oper. Syst. Rev. 55 1 (June 2021) 21\u201337. 10.1145\/3469379.3469383","DOI":"10.1145\/3469379.3469383"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359633"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","unstructured":"Amine Mhedhbi and Semih Salihoglu. 2019. Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB Endow. 12 11 (July 2019) 1692\u20131704. 10.14778\/3342263.3342643","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","unstructured":"Hung\u00a0Q. Ngo Ely Porat Christopher R\u00e9 and Atri Rudra. 2018. Worst-case Optimal Join Algorithms. J. ACM 65 3 Article 16 (March 2018) 40\u00a0pages. 10.1145\/3180143","DOI":"10.1145\/3180143"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"Sungwoo Park Seyeon Oh and Min-Soo Kim. 2025. cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns. Proc. ACM Manag. Data 3 3 Article 143 (June 2025) 28\u00a0pages. 10.1145\/3725398","DOI":"10.1145\/3725398"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","unstructured":"N. Pr\u017eulj D.\u00a0G. Corneil and I. Jurisica. 2006. Efficient estimation of graphlet frequency distributions in protein\u2013protein interaction networks. Bioinformatics 22 8 (02 2006) 974\u2013980. arXiv:https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/22\/8\/974\/48841561\/bioinformatics_22_8_974.pdf10.1093\/bioinformatics\/btl030","DOI":"10.1093\/bioinformatics\/btl030"},{"key":"e_1_3_3_1_34_2","series-title":"(SC \u201920)","volume-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","author":"Shi Tianhui","year":"2020","unstructured":"Tianhui Shi, Mingshu Zhai, Yi Xu, and Jidong Zhai. 2020. GraphPi: high performance graph pattern matching through effective redundancy elimination. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (Atlanta, Georgia) (SC \u201920). IEEE Press, Article 100, 14\u00a0pages."},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","unstructured":"Xibo Sun and Qiong Luo. 2023. Efficient GPU-Accelerated Subgraph Matching. Proc. ACM Manag. Data 1 2 Article 181 (June 2023) 26\u00a0pages. 10.1145\/3589326","DOI":"10.1145\/3589326"},{"key":"e_1_3_3_1_36_2","first-page":"209","volume-title":"2021 USENIX Annual Technical Conference (USENIX ATC 21)","author":"Trigonakis Vasileios","year":"2021","unstructured":"Vasileios Trigonakis, Jean-Pierre Lozi, Tom\u00e1\u0161 Falt\u00edn, Nicholas\u00a0P. Roth, Iraklis Psaroudakis, Arnaud Delamare, Vlad Haprian, Calin Iorgulescu, Petr Koupy, Jinsoo Lee, Sungpack Hong, and Hassan Chafi. 2021. aDFS: An Almost Depth-First-Search Distributed Graph-Querying System. In 2021 USENIX Annual Technical Conference (USENIX ATC 21). USENIX Association, 209\u2013224. https:\/\/www.usenix.org\/conference\/atc21\/presentation\/trigonakis"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"e_1_3_3_1_38_2","series-title":"(SC \u201922)","volume-title":"Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis","author":"Wei Yihua","year":"2022","unstructured":"Yihua Wei and Peng Jiang. 2022. STMatch: accelerating graph pattern matching on GPU with stack-based loop optimizations. In Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis (Dallas, Texas) (SC \u201922). IEEE Press, Article 53, 13\u00a0pages."},{"key":"e_1_3_3_1_39_2","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2018. How Powerful are Graph Neural Networks? CoRR abs\/1810.00826 (2018). arXiv:https:\/\/arXiv.org\/abs\/1810.00826http:\/\/arxiv.org\/abs\/1810.00826"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2350190.2350193"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","unstructured":"Jiaxuan You Jonathan Gomes\u00a0Selman Rex Ying and Jure Leskovec. 2021. Identity-aware Graph Neural Networks. Proceedings of the AAAI Conference on Artificial Intelligence 35 (05 2021) 10737\u201310745. 10.1609\/aaai.v35i12.17283","DOI":"10.1609\/aaai.v35i12.17283"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","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. 10.1145\/3639315","DOI":"10.1145\/3639315"}],"event":{"name":"ICS '26: 2026 International Conference on Supercomputing","location":"Belfast United Kingdom","acronym":"ICS '26","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 40th ACM International Conference on Supercomputing"],"original-title":[],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T13:05:26Z","timestamp":1782997526000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797905.3807860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,5]]},"references-count":41,"alternative-id":["10.1145\/3797905.3807860","10.1145\/3797905"],"URL":"https:\/\/doi.org\/10.1145\/3797905.3807860","relation":{},"subject":[],"published":{"date-parts":[[2026,7,5]]},"assertion":[{"value":"2026-07-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}