{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:58:34Z","timestamp":1781326714341,"version":"3.54.1"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,12,4]]},"abstract":"<jats:p>Recently, graphs are becoming increasingly interesting in the context of large language models and as overlays for commercial databases. Subgraph query processing is an especially challenging workload for graph analysis that is bottlenecked by slow set intersection performance on CPUs. Previous work has shown the viability of utilizing hardware acceleration for related domains like graph and relational join processing. We propose GraphMatch, a hardware-accelerated subgraph query processing system based on worst-case optimal joins (WCOJ). For efficient processing of various data and query graphs, we propose a novel set intersection algorithm, called MaxStep, that leverages hardware parallelism. GraphMatch combines MaxStep operators in a data flow architecture which efficiently solves multi-set intersections in subgraph query processing, superior to CPU-based approaches. GraphMatch achieves an average speedup of over 6.98x and 17.08x, compared to the state-of-the-art WCOJ-based systems GraphFlow and RapidMatch, respectively. On labeled graphs, GraphMatch outperforms the fastest subgraph query processing accelerator FAST by orders of magnitude.<\/jats:p>","DOI":"10.1145\/3769797","type":"journal-article","created":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:32:13Z","timestamp":1764995533000},"page":"1-26","source":"Crossref","is-referenced-by-count":0,"title":["GraphMatch: Subgraph Query Processing on Steroids"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6706-0353","authenticated-orcid":false,"given":"Jonas","family":"Dann","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5557-5518","authenticated-orcid":false,"given":"Tobias","family":"Goetz","sequence":"additional","affiliation":[{"name":"TU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6146-3365","authenticated-orcid":false,"given":"Daniel","family":"Ritter","sequence":"additional","affiliation":[{"name":"SAP SE, Walldorf, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1926-3551","authenticated-orcid":false,"given":"Jana","family":"Giceva","sequence":"additional","affiliation":[{"name":"TU Munich, Munich, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9562-0680","authenticated-orcid":false,"given":"Holger","family":"Fr\u00f6ning","sequence":"additional","affiliation":[{"name":"Heidelberg University, Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4396-6695","authenticated-orcid":false,"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524284"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3129246"},{"key":"e_1_2_1_3_1","unstructured":"AMD. 2024. AMD Alveo V80 Compute Accelerator Card. https:\/\/www.amd.com\/content\/dam\/amd\/en\/documents\/products\/accelerators\/alveo\/v80\/alveo-v80-product-brief.pdf."},{"key":"e_1_2_1_4_1","unstructured":"Renzo Angles J\u00e1nos Benjamin Antal Alex Averbuch Peter A. Boncz Orri Erling Andrey Gubichev Vlad Haprian Moritz Kaufmann Josep Llu\u00eds Larriba-Pey Norbert Mart\u00ednez-Bazan J\u00f3zsef Marton Marcus Paradies Minh-Duc Pham Arnau Prat-P\u00e9rez Mirko Spasic Benjamin A. Steer G\u00e1bor Sz\u00e1rnyas and Jack Waudby. 2020. The LDBC Social Network Benchmark. CoRR Vol. abs\/2001.02299 (2020)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1322432.1322433"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96193-4_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3644824"},{"key":"e_1_2_1_9_1","volume-title":"https:\/\/aws.amazon.com\/neptune\/. accessed","author":"Amazon Neptune Amazon AWS.","year":"2024","unstructured":"Amazon AWS. 2024a. Amazon Neptune. https:\/\/aws.amazon.com\/neptune\/. accessed October 14, 2024."},{"key":"e_1_2_1_10_1","volume-title":"Microsoft Cosmos DB for Apache Gremlin. https:\/\/learn.microsoft.com\/en-us\/azure\/cosmos-db\/gremlin\/introduction. accessed","author":"Amazon AWS.","year":"2024","unstructured":"Amazon AWS. 2024b. Microsoft Cosmos DB for Apache Gremlin. https:\/\/learn.microsoft.com\/en-us\/azure\/cosmos-db\/gremlin\/introduction. accessed October 14, 2024."},{"key":"e_1_2_1_11_1","volume-title":"https:\/\/aws.amazon.com\/blogs\/aws\/new-aqua-advanced-query-accelerator-for-amazon-redshift\/. accessed","author":"Barr Jeff","year":"2024","unstructured":"Jeff Barr. 2021. AQUA (Advanced Query Accelerator) - A Speed Boost for Your Amazon Redshift Queries. https:\/\/aws.amazon.com\/blogs\/aws\/new-aqua-advanced-query-accelerator-for-amazon-redshift\/. accessed October 14, 2024."},{"key":"e_1_2_1_12_1","first-page":"17682","article-title":"Graph of Thoughts","author":"Besta Maciej","year":"2024","unstructured":"Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Michal Podstawski, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Hubert Niewiadomski, Piotr Nyczyk, and Torsten Hoefler. 2024a. Graph of Thoughts: Solving Elaborate Problems with Large Language Models. In AAAI. 17682-17690.","journal-title":"Solving Elaborate Problems with Large Language Models. In AAAI."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3604932"},{"key":"e_1_2_1_14_1","volume-title":"Nils Blach, Marek Konieczny, Onur Mutlu, and Torsten Hoefler.","author":"Besta Maciej","year":"2021","unstructured":"Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Ber\u00e1nek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan G\u00f3mez-Luna, Jakub Golinowski, Marcin Copik, Lukas Kapp-Schwoerer, Salvatore Di Girolamo, Nils Blach, Marek Konieczny, Onur Mutlu, and Torsten Hoefler. 2021. SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. In MICRO. ACM, 282-297."},{"key":"e_1_2_1_15_1","first-page":"1447","article-title":"CECI","author":"Bhattarai Bibek","year":"2019","unstructured":"Bibek Bhattarai, Hang Liu, and H. Howie Huang. 2019. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching. In SIGMOD. ACM, 1447-1462.","journal-title":"Compact Embedding Cluster Index for Scalable Subgraph Matching. In SIGMOD. ACM"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915236"},{"key":"e_1_2_1_17_1","volume-title":"Faster-Than-Native Alternatives for x86 VP2INTERSECT Instructions. CoRR","author":"Canas Guille D.","year":"2021","unstructured":"Guille D. Canas. 2021. Faster-Than-Native Alternatives for x86 VP2INTERSECT Instructions. CoRR, Vol. abs\/2112.06342 (2021)."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3632093.3632107"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783710"},{"key":"e_1_2_1_20_1","first-page":"50","article-title":"Contigra","author":"Che Joanna","year":"2024","unstructured":"Joanna Che, Kasra Jamshidi, and Keval Vora. 2024. Contigra: Graph Mining with Containment Constraints. In EuroSys. ACM, 50-65.","journal-title":"Graph Mining with Containment Constraints. In EuroSys. ACM"},{"key":"e_1_2_1_21_1","first-page":"413","article-title":"Khuzdul: Efficient and Scalable Distributed Graph Pattern Mining Engine","author":"Chen Jingji","year":"2023","unstructured":"Jingji Chen and Xuehai Qian. 2023. Khuzdul: Efficient and Scalable Distributed Graph Pattern Mining Engine. In ASPLOS. ACM, 413-426.","journal-title":"ASPLOS. ACM"},{"key":"e_1_2_1_22_1","first-page":"378","article-title":"Sandslash: a two-level framework for efficient graph pattern mining","author":"Chen Xuhao","year":"2021","unstructured":"Xuhao Chen, Roshan Dathathri, Gurbinder Gill, Loc Hoang, and Keshav Pingali. 2021. Sandslash: a two-level framework for efficient graph pattern mining. In ICS. ACM, 378-391.","journal-title":"ICS. ACM"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389137"},{"key":"e_1_2_1_24_1","first-page":"434","article-title":"Enzian: an open, general, CPU\/FPGA platform for systems software research","author":"Cock David A.","year":"2022","unstructured":"David A. Cock, Abishek Ramdas, Daniel Schwyn, Michael Giardino, Adam Turowski, Zhenhao He, Nora Hossle, Dario Korolija, Melissa Licciardello, Kristina Martsenko, Reto Achermann, Gustavo Alonso, and Timothy Roscoe. 2022. Enzian: an open, general, CPU\/FPGA platform for systems software research. In ASPLOS. ACM, 434-451.","journal-title":"ASPLOS. ACM"},{"key":"e_1_2_1_25_1","first-page":"217","article-title":"ForeGraph: Exploring Large-scale Graph Processing on Multi-FPGA Architecture","author":"Dai Guohao","year":"2017","unstructured":"Guohao Dai, Tianhao Huang, Yuze Chi, Ningyi Xu, Yu Wang, and Huazhong Yang. 2017. ForeGraph: Exploring Large-scale Graph Processing on Multi-FPGA Architecture. In FPGA. 217-226.","journal-title":"FPGA."},{"key":"e_1_2_1_26_1","first-page":"24","article-title":"GraphScale","author":"Dann Jonas","year":"2022","unstructured":"Jonas Dann, Daniel Ritter, and Holger Fr\u00f6ning. 2022a. GraphScale: Scalable Bandwidth-Efficient Graph Processing on FPGAs. In FPL. IEEE, 24-32.","journal-title":"Scalable Bandwidth-Efficient Graph Processing on FPGAs. In FPL. IEEE"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3568990"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3616497"},{"key":"e_1_2_1_29_1","first-page":"1","article-title":"PipeJSON: Parsing JSON at Line Speed on FPGAs","volume":"3","author":"Dann Jonas","year":"2022","unstructured":"Jonas Dann, Royden Wagner, Daniel Ritter, Christian Faerber, and Holger Fr\u00f6ning. 2022b. PipeJSON: Parsing JSON at Line Speed on FPGAs. In DaMoN. 3:1-3:7.","journal-title":"DaMoN."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000064.2000108"},{"key":"e_1_2_1_31_1","unstructured":"Bahare Fatemi Jonathan Halcrow and Bryan Perozzi. 2024. Talk like a Graph: Encoding Graphs for Large Language Models. In ICLR. OpenReview.net."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407797"},{"key":"e_1_2_1_33_1","first-page":"1","article-title":"EdgeFrame","volume":"4","author":"Fuchs Per","year":"2020","unstructured":"Per Fuchs, Peter A. Boncz, and Bogdan Ghit. 2020. EdgeFrame: Worst-Case Optimal Joins for Graph-Pattern Matching in Spark. In GRADES-NDA. ACM, 4:1-4:11.","journal-title":"Worst-Case Optimal Joins for Graph-Pattern Matching in Spark. In GRADES-NDA. ACM"},{"key":"e_1_2_1_34_1","first-page":"318","article-title":"SumPA","author":"Gui Chuangyi","year":"2021","unstructured":"Chuangyi Gui, Xiaofei Liao, Long Zheng, Pengcheng Yao, Qinggang Wang, and Hai Jin. 2021. SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction. In PACT. IEEE, 318-330.","journal-title":"Efficient Pattern-Centric Graph Mining with Pattern Abstraction. In PACT. IEEE"},{"key":"e_1_2_1_35_1","first-page":"1429","article-title":"Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together","author":"Han Myoungji","year":"2019","unstructured":"Myoungji Han, Hyunjoon Kim, Geonmo Gu, Kunsoo Park, and Wook-Shin Han. 2019. Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together. In SIGMOD. ACM, 1429-1446.","journal-title":"SIGMOD. ACM"},{"key":"e_1_2_1_36_1","first-page":"1587","article-title":"Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions","author":"Han Shuo","year":"2018","unstructured":"Shuo Han, Lei Zou, and Jeffrey Xu Yu. 2018. Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions. In SIGMOD. ACM, 1587-1602.","journal-title":"SIGMOD. ACM"},{"key":"e_1_2_1_37_1","volume-title":"Auckland, New Zealand","volume":"275","author":"Hogan Aidan","year":"2019","unstructured":"Aidan Hogan, Cristian Riveros, Carlos Rojas, and Adri\u00e1n Soto. 2019. A Worst-Case Optimal Join Algorithm for SPARQL. In The Semantic Web - ISWC 2019 - 18th International Semantic Web Conference, Auckland, New Zealand, October 26-30, 2019, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 11778). Springer, 258-275."},{"key":"e_1_2_1_38_1","first-page":"1","article-title":"Peregrine: a pattern-aware graph mining system","volume":"13","author":"Jamshidi Kasra","year":"2020","unstructured":"Kasra Jamshidi, Rakesh Mahadasa, and Keval Vora. 2020. Peregrine: a pattern-aware graph mining system. In EuroSys. ACM, 13:1-13:16.","journal-title":"EuroSys. ACM"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469381"},{"key":"e_1_2_1_40_1","volume-title":"Accelerating Graph-based Vector Search via Delayed-Synchronization Traversal. CoRR","author":"Jiang Wenqi","year":"2024","unstructured":"Wenqi Jiang, Hang Hu, Torsten Hoefler, and Gustavo Alonso. 2024. Accelerating Graph-based Vector Search via Delayed-Synchronization Traversal. CoRR, Vol. abs\/2406.12385 (2024)."},{"key":"e_1_2_1_41_1","unstructured":"Guodong Jin Xiyang Feng Ziyi Chen Chang Liu and Semih Salihoglu. 2023. K\u00d9ZU Graph Database Management System. In CIDR. www.cidrdb.org."},{"key":"e_1_2_1_42_1","first-page":"1452","article-title":"FAST","author":"Jin Xin","year":"2021","unstructured":"Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, and You Peng. 2021. FAST: FPGA-based Subgraph Matching on Massive Graphs. In ICDE. IEEE, 1452-1463.","journal-title":"FPGA-based Subgraph Matching on Massive Graphs. In ICDE. IEEE"},{"key":"e_1_2_1_43_1","volume-title":"Proc. ACM Manag. Data","volume":"3","author":"Kabic Marko","year":"2025","unstructured":"Marko Kabic, Shriram Chandran, and Gustavo Alonso. 2025. Maximus: A Modular Accelerated Query Engine for Data Analytics on Heterogeneous Systems. Proc. ACM Manag. Data, Vol. 3, 3 (2025), 187:1-187:25."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3749646.3749698"},{"key":"e_1_2_1_45_1","first-page":"1","article-title":"Efficient Physical Page Migrations in Shared Virtual Memory Reconfigurable Computing Systems","author":"Kalkhof Torben","year":"2021","unstructured":"Torben Kalkhof and Andreas Koch. 2021. Efficient Physical Page Migrations in Shared Virtual Memory Reconfigurable Computing Systems. In FPT. IEEE, 1-10.","journal-title":"FPT. IEEE"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339494"},{"key":"e_1_2_1_47_1","first-page":"27","article-title":"Bandwidth-optimal Relational Joins on FPGAs","volume":"1","author":"Lasch Robert","year":"2022","unstructured":"Robert Lasch, Mehdi Moghaddamfar, Norman May, S\u00fcleyman Sirri Demirsoy, Christian F\u00e4rber, and Kai-Uwe Sattler. 2022. Bandwidth-optimal Relational Joins on FPGAs. In EDBT. 1:27-1:39.","journal-title":"EDBT."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448946"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2326"},{"key":"e_1_2_1_50_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469379.3469383"},{"key":"e_1_2_1_52_1","volume-title":"SAP HANA Cloud: Data Management for Modern Enterprise Applications. In Companion of the 2025 International Conference on Management of Data, SIGMOD\/PODS 2025","author":"May Norman","year":"2025","unstructured":"Norman May, Alexander B\u00f6hm, Daniel Ritter, Frank Renkes, Mihnea Andrei, and Wolfgang Lehner. 2025. SAP HANA Cloud: Data Management for Modern Enterprise Applications. In Companion of the 2025 International Conference on Management of Data, SIGMOD\/PODS 2025, Berlin, Germany, June 22-27, 2025. ACM, to appear."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3636218.3636239"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180143"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590991"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl030"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996868"},{"key":"e_1_2_1_59_1","volume-title":"Jonas Dann, Luhao Liu, and Gustavo Alonso.","author":"Ramhorst Benjamin","year":"2025","unstructured":"Benjamin Ramhorst, Dario Korolija, Maximilian Jakob Heer, Jonas Dann, Luhao Liu, and Gustavo Alonso. 2025a. Coyote v2: Raising the Level of Abstraction for Data Center FPGAs. CoRR, Vol. abs\/2504.21538 (2025)."},{"key":"e_1_2_1_60_1","volume-title":"Jonas Dann, Luhao Liu, and Gustavo Alonso.","author":"Ramhorst Benjamin","year":"2025","unstructured":"Benjamin Ramhorst, Dario Korolija, Maximilian Jakob Heer, Jonas Dann, Luhao Liu, and Gustavo Alonso. 2025b. RoCE BALBOA: Service-enhanced Data Center RDMA for SmartNICs. CoRR, Vol. abs\/2507.20412 (2025)."},{"key":"e_1_2_1_61_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. http:\/\/networkrepository.com. In AAAI."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00548-x"},{"key":"e_1_2_1_63_1","volume-title":"SAP HANA Graph Reference. https:\/\/help.sap.com\/doc\/21574acf46fe45a8ae9def213f2c4d9e\/2.0.06\/en-US\/SAP_HANA_Graph_Reference_en.pdf. accessed","author":"SAP SE.","year":"2024","unstructured":"SAP SE. 2021. SAP HANA Graph Reference. https:\/\/help.sap.com\/doc\/21574acf46fe45a8ae9def213f2c4d9e\/2.0.06\/en-US\/SAP_HANA_Graph_Reference_en.pdf. accessed October 14, 2024."},{"key":"e_1_2_1_64_1","volume-title":"New specifications for exponential random graph models. Sociological methodology","author":"Snijders Tom AB","year":"2006","unstructured":"Tom AB Snijders, Philippa E Pattison, Garry L Robins, and Mark S Handcock. 2006. New specifications for exponential random graph models. Sociological methodology, Vol. 36, 1 (2006), 99-153."},{"key":"e_1_2_1_65_1","volume-title":"LDBC Social Network Benchmark Data Generator. https:\/\/hub.docker.com\/r\/ldbc\/datagen. accessed","author":"Steer Ben","year":"2024","unstructured":"Ben Steer. 2020. LDBC Social Network Benchmark Data Generator. https:\/\/hub.docker.com\/r\/ldbc\/datagen. accessed October 14, 2024."},{"key":"e_1_2_1_66_1","first-page":"1083","article-title":"In-Memory Subgraph Matching: An In-depth Study","author":"Sun Shixuan","year":"2020","unstructured":"Shixuan Sun and Qiong Luo. 2020. In-Memory Subgraph Matching: An In-depth Study. In SIGMOD. ACM, 1083-1098.","journal-title":"SIGMOD. ACM"},{"key":"e_1_2_1_67_1","first-page":"176","article-title":"RapidMatch: A Holistic Approach to Subgraph Query Processing","volume":"14","author":"Sun Shixuan","year":"2020","unstructured":"Shixuan Sun, Xibo Sun, Yulin Che, Qiong Luo, and Bingsheng He. 2020. RapidMatch: A Holistic Approach to Subgraph Query Processing. PVLDB, Vol. 14, 2 (2020), 176-188.","journal-title":"PVLDB"},{"key":"e_1_2_1_68_1","first-page":"425","article-title":"Arabesque: a system for distributed graph mining","author":"Teixeira Carlos H. C.","year":"2015","unstructured":"Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos, Mohammed J. Zaki, and Ashraf Aboulnaga. 2015. Arabesque: a system for distributed graph mining. In SOSP. ACM, 425-440.","journal-title":"SOSP. ACM"},{"key":"e_1_2_1_69_1","first-page":"299","article-title":"Fast Subgraph Matching on Large Graphs using Graphics Processors. In DASFAA (Lecture Notes in Computer Science, Vol. 9049)","author":"Tran Ha Nguyen","year":"2015","unstructured":"Ha Nguyen Tran, Jung-Jae Kim, and Bingsheng He. 2015. Fast Subgraph Matching on Large Graphs using Graphics Processors. In DASFAA (Lecture Notes in Computer Science, Vol. 9049). Springer, 299-315.","journal-title":"Springer"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321925"},{"key":"e_1_2_1_71_1","volume-title":"Leapfrog Triejoin: a worst-case optimal join algorithm. CoRR","author":"Veldhuizen Todd L.","year":"2012","unstructured":"Todd L. Veldhuizen. 2012. Leapfrog Triejoin: a worst-case optimal join algorithm. CoRR, Vol. abs\/1210.0481 (2012)."},{"key":"e_1_2_1_72_1","first-page":"560","article-title":"MillenniumDB","volume":"5","author":"Vrgoc Domagoj","year":"2023","unstructured":"Domagoj Vrgoc, Carlos Rojas, Renzo Angles, Marcelo Arenas, Diego Arroyuelo, Carlos Buil-Aranda, Aidan Hogan, Gonzalo Navarro, Cristian Riveros, and Juan Romero. 2023. MillenniumDB: An Open-Source Graph Database System. Data Intell., Vol. 5, 3 (2023), 560-610.","journal-title":"An Open-Source Graph Database System. Data Intell."},{"key":"e_1_2_1_73_1","volume-title":"Owens","author":"Wang Leyuan","year":"2020","unstructured":"Leyuan Wang and John D. Owens. 2020. Fast Gunrock Subgraph Matching (GSM) on GPUs. CoRR, Vol. abs\/2003.01527 (2020)."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709689"},{"key":"e_1_2_1_75_1","first-page":"1249","article-title":"GSI","author":"Zeng Li","year":"2020","unstructured":"Li Zeng, Lei Zou, M. Tamer \u00d6zsu, Lin Hu, and Fan Zhang. 2020. GSI: GPU-friendly Subgraph Isomorphism. In ICDE. IEEE, 1249-1260.","journal-title":"GPU-friendly Subgraph Isomorphism. In ICDE. IEEE"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781009122115"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3769797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T04:46:51Z","timestamp":1781326011000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3769797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,4]]},"references-count":76,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12,4]]}},"alternative-id":["10.1145\/3769797"],"URL":"https:\/\/doi.org\/10.1145\/3769797","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,4]]}}}