{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T01:09:31Z","timestamp":1789434571757,"version":"build-2803163510"},"reference-count":91,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["RS-2024-00347471"],"award-info":[{"award-number":["RS-2024-00347471"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Institute of Information & Communications Technology Planning & Evaluation","award":["2019-0-01267"],"award-info":[{"award-number":["2019-0-01267"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2026,5,18]]},"abstract":"<jats:p>Regular path queries (RPQs) are fundamental for path-constrained reachability analysis, and more complex variants such as conjunctive regular path queries (CRPQs) are increasingly used in graph analytics. Evaluating these queries is computationally expensive, but to the best of our knowledge, no prior work has explored GPU acceleration. In this paper, we propose cuRPQ, a high-performance GPU-optimized framework for processing RPQs and CRPQs. cuRPQ addresses the key GPU challenges through a novel traversal algorithm, an efficient visited-set management scheme, and a concurrent exploration-materialization strategy. Extensive experiments show that cuRPQ outperforms state-of-the-art methods by orders of magnitude, without out-of-memory errors.<\/jats:p>","DOI":"10.1145\/3802033","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T18:19:16Z","timestamp":1779128356000},"page":"1-28","source":"Crossref","is-referenced-by-count":1,"title":["cuRPQ: A High-Performance GPU-Based Framework for Processing Regular and Conjunctive Regular Path Queries"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3927-7935","authenticated-orcid":false,"given":"Sungwoo","family":"Park","sequence":"first","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7944-8469","authenticated-orcid":false,"given":"Seohyeon","family":"Kim","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7852-0853","authenticated-orcid":false,"given":"Min-Soo","family":"Kim","sequence":"additional","affiliation":[{"name":"Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3725242","article-title":"Output-Sensitive Evaluation of Regular Path Queries","volume":"3","author":"Khamis Mahmoud Abo","year":"2025","unstructured":"Mahmoud Abo Khamis, Ahmet Kara, Dan Olteanu, and Dan Suciu. 2025. Output-Sensitive Evaluation of Regular Path Queries. Proceedings of the ACM on Management of Data, Vol. 3, 2 (2025), 1-20.","journal-title":"Proceedings of the ACM on Management of Data"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.205"},{"key":"e_1_2_1_3_1","unstructured":"Zahid Abul-Basher Nikolay Yakovets Parke Godfrey and Mark H Chignell. 2016. SwarmGuide: Towards Multiple-Query Optimization in Graph Databases.. In AMW."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1109\/32.42731","article-title":"Alpha: An extension of relational algebra to express a class of recursive queries","volume":"14","author":"Agrawal Rakesh","year":"2002","unstructured":"Rakesh Agrawal. 2002. Alpha: An extension of relational algebra to express a class of recursive queries. IEEE Transactions on Software Engineering, Vol. 14, 7 (2002), 879-885.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"e_1_2_1_5_1","first-page":"1","article-title":"Direct Algorithms for Computing the Transitive Closure of Database Relations","volume":"87","author":"Agrawal Rakesh","year":"1987","unstructured":"Rakesh Agrawal and HV Jagadish. 1987. Direct Algorithms for Computing the Transitive Closure of Database Relations.. In VLDB, Vol. 87. 1-4.","journal-title":"VLDB"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00811-2"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/s00778-024-00885-6","article-title":"Evaluating regular path queries on compressed adjacency matrices","volume":"34","author":"Arroyuelo Diego","year":"2025","unstructured":"Diego Arroyuelo, Adri\u00e1n G\u00f3mez-Brand\u00f3n, and Gonzalo Navarro. 2025. Evaluating regular path queries on compressed adjacency matrices. The VLDB Journal, Vol. 34, 1 (2025), 2.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2389241.2389250"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3070822","article-title":"Graph logics with rational relations: the role of word combinatorics","volume":"18","author":"Barcel\u00f3 Pablo","year":"2017","unstructured":"Pablo Barcel\u00f3 and Pablo Mu noz. 2017. Graph logics with rational relations: the role of word combinatorics. ACM Transactions on Computational Logic (TOCL), Vol. 18, 2 (2017), 1-41.","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems. 175-188","author":"Baeza Pablo Barcel\u00f3","year":"2013","unstructured":"Pablo Barcel\u00f3 Baeza. 2013. Querying graph databases. In Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems. 175-188."},{"key":"e_1_2_1_12_1","volume-title":"Single-Source Regular Path Querying in Terms of Linear Algebra. arXiv preprint arXiv:2412.10287","author":"Belyanin Georgiy","year":"2024","unstructured":"Georgiy Belyanin, Semyon Grigoriev, and Rodion Suvorov. 2024. Single-Source Regular Path Querying in Terms of Linear Algebra. arXiv preprint arXiv:2412.10287 (2024)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2735405"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01864-0"},{"key":"e_1_2_1_15_1","volume-title":"The World Wide Web Conference. 127-138","author":"Bonifati Angela","year":"2019","unstructured":"Angela Bonifati, Wim Martens, and Thomas Timm. 2019. Navigating the maze of Wikidata query logs. In The World Wide Web Conference. 127-138."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00558-9"},{"key":"e_1_2_1_17_1","volume-title":"Logical Methods in Computer Science","volume":"19","author":"Casel Katrin","year":"2023","unstructured":"Katrin Casel and Markus L Schmid. 2023. Fine-grained complexity of regular path queries. Logical Methods in Computer Science, Vol. 19 (2023)."},{"key":"e_1_2_1_18_1","unstructured":"NVIDIA Corporation. 2025. RAPIDS. https:\/\/rapids.ai."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/38714.38749"},{"key":"e_1_2_1_20_1","first-page":"13","volume-title":"26th International Conference on Database Theory (ICDT","author":"Cucumides Tamara","year":"2023","unstructured":"Tamara Cucumides, Juan Reutter, and Domagoj Vrgo\u010d. 2023. Size bounds and algorithms for conjunctive regular path queries. In 26th International Conference on Database Theory (ICDT 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 13-1."},{"key":"e_1_2_1_21_1","volume-title":"OTM Confederated International Conferences'' On the Move to Meaningful Internet Systems''. Springer, 844-861","author":"Davoust Alan","year":"2016","unstructured":"Alan Davoust and Babak Esfandiari. 2016. Processing regular path queries on arbitrarily distributed data. In OTM Confederated International Conferences'' On the Move to Meaningful Internet Systems''. Springer, 844-861."},{"key":"e_1_2_1_22_1","volume-title":"2016 45th International Conference on Parallel Processing (ICPP). IEEE, 258-267","author":"Denis Alexandre","year":"2016","unstructured":"Alexandre Denis and Fran\u00e7ois Trahay. 2016. Mpi overlap: Benchmark and analysis. In 2016 45th International Conference on Parallel Processing (ICPP). IEEE, 258-267."},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 2022 International Conference on Management of Data. 2246-2258","author":"Deutsch Alin","year":"2022","unstructured":"Alin Deutsch, Nadime Francis, Keith Green, Alastair anzinn2016generald Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, et al., 2022. Graph pattern matching in GQL and SQL\/PGQ. In Proceedings of the 2022 International Conference on Management of Data. 2246-2258."},{"key":"e_1_2_1_24_1","volume-title":"Tigergraph: A native MPP graph database. arXiv preprint arXiv:1901.08248","author":"Deutsch Alin","year":"2019","unstructured":"Alin Deutsch, Yu Xu, Mingxi Wu, and Victor Lee. 2019. Tigergraph: A native MPP graph database. arXiv preprint arXiv:1901.08248 (2019)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssaho.2022.100337"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01668-7"},{"key":"e_1_2_1_27_1","first-page":"3","article-title":"Virtuoso, a Hybrid RDBMS\/Graph Column Store","volume":"35","author":"Erling Orri","year":"2012","unstructured":"Orri Erling. 2012. Virtuoso, a Hybrid RDBMS\/Graph Column Store. IEEE Data Eng. Bull., Vol. 35, 1 (2012), 3-8.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 24th International Middleware Conference: Industrial Track. 35-41","author":"Falt\u00edn Tom\u00e1\u0161","year":"2023","unstructured":"Tom\u00e1\u0161 Falt\u00edn, Vasileios Trigonakis, Ayoub Berdai, Luigi Fusco, C\u0103lin Iorgulescu, Jinsoo Lee, Jakub Yaghob, Sungpack Hong, and Hassan Chafi. 2023. Distributed Asynchronous Regular Path Queries (RPQs) on Graphs. In Proceedings of the 24th International Middleware Conference: Industrial Track. 35-41."},{"key":"e_1_2_1_29_1","first-page":"25","volume-title":"The Conference on Innovative Data Systems Research","volume":"7","author":"Feng Xiyang","year":"2023","unstructured":"Xiyang Feng, Guodong Jin, Ziyi Chen, Chang Liu, and Semih Saliho\u011flu. 2023. K\u00f9zu graph database management system. In The Conference on Innovative Data Systems Research, Vol. 7. 25-35."},{"key":"e_1_2_1_30_1","volume-title":"Containment of simple regular path queries. arXiv preprint arXiv:2003.04411","author":"Figueira Diego","year":"2020","unstructured":"Diego Figueira, Adwait Godbole, S Krishna, Wim Martens, Matthias Niewerth, and Tina Trautner. 2020. Containment of simple regular path queries. arXiv preprint arXiv:2003.04411 (2020)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3725237"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588664"},{"key":"e_1_2_1_33_1","first-page":"36","volume-title":"28th International Conference on Database Theory (ICDT","author":"Gheerbrant Am\u00e9lie","year":"2025","unstructured":"Am\u00e9lie Gheerbrant, Leonid Libkin, Liat Peterfreund, and Alexandra Rogova. 2025. Database Theory in Action: Cypher, GQL, and Regular Path Queries. In 28th International Conference on Database Theory (ICDT 2025). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 36-1."},{"key":"e_1_2_1_34_1","series-title":"SIAM journal on matrix analysis and applications","volume-title":"Sparse matrices in MATLAB: Design and implementation","author":"Gilbert John R","year":"1992","unstructured":"John R Gilbert, Cleve Moler, and Robert Schreiber. 1992. Sparse matrices in MATLAB: Design and implementation. SIAM journal on matrix analysis and applications, Vol. 13, 1 (1992), 333-356."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641214"},{"key":"e_1_2_1_36_1","first-page":"520","article-title":"openCypher: New Directions in Property Graph Querying","author":"Green Alastair","year":"2018","unstructured":"Alastair Green, Martin Junghanns, Max Kie\u00dfling, Tobias Lindaaker, Stefan Plantikow, and Petra Selmer. 2018. openCypher: New Directions in Property Graph Querying.. In EDBT. 520-523.","journal-title":"EDBT."},{"key":"e_1_2_1_37_1","volume-title":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE, 192-201","author":"Green Oded","year":"2021","unstructured":"Oded Green, Zhihui Du, Sanyamee Patel, Zehui Xie, Hang Liu, and David A Bader. 2021. Anti-section transitive closure. In 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE, 192-201."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389699"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376670"},{"key":"e_1_2_1_40_1","unstructured":"HeavyDB. 2025. HeavyDB. https:\/\/github.com\/heavyai\/heavydb."},{"key":"e_1_2_1_41_1","volume-title":"European Semantic Web Conference. Springer, 218-235","author":"Karalis Nikolaos","year":"2024","unstructured":"Nikolaos Karalis, Alexander Bigerl, Liss Heidrich, Mohamed Ahmed Sherif, and Axel-Cyrille Ngonga Ngomo. 2024. Efficient evaluation of conjunctive regular path queries using multi-way joins. In European Semantic Web Conference. Springer, 218-235."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1413957.1413966"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196915"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571977"},{"key":"e_1_2_1_45_1","volume-title":"International Conference on Scientific and Statistical Database Management. Springer, 177-194","author":"Koschmieder Andr\u00e9","year":"2012","unstructured":"Andr\u00e9 Koschmieder and Ulf Leser. 2012. Regular path queries on large graphs. In International Conference on Scientific and Statistical Database Management. Springer, 177-194."},{"key":"e_1_2_1_46_1","volume-title":"Accelerating multi-way joins on the GPU. The VLDB Journal","author":"Lai Zhuohang","year":"2022","unstructured":"Zhuohang Lai, Xibo Sun, Qiong Luo, and Xiaolong Xie. 2022. Accelerating multi-way joins on the GPU. The VLDB Journal (2022), 1-25."},{"key":"e_1_2_1_47_1","volume-title":"Bioinformatics","volume":"21","author":"Leser Ulf","year":"2005","unstructured":"Ulf Leser. 2005. A query language for biological networks. Bioinformatics, Vol. 21, suppl_2 (2005), ii33-ii39."},{"key":"e_1_2_1_48_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_49_1","volume-title":"Network motif discovery: A GPU approach","author":"Lin Wenqing","year":"2016","unstructured":"Wenqing Lin, Xiaokui Xiao, Xing Xie, and Xiao-Li Li. 2016. Network motif discovery: A GPU approach. IEEE transactions on knowledge and data engineering, Vol. 29, 3 (2016), 513-528."},{"key":"e_1_2_1_50_1","first-page":"443","volume-title":"2019 USENIX Annual Technical Conference (USENIX ATC 19)","author":"Ma Lingxiao","year":"2019","unstructured":"Lingxiao Ma, Zhi Yang, Youshan Miao, Jilong Xue, Ming Wu, Lidong Zhou, and Yafei Dai. 2019. : Parallel deep neural network computation on large graphs. In 2019 USENIX Annual Technical Conference (USENIX ATC 19). 443-458."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331446"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461837.3464516"},{"key":"e_1_2_1_55_1","unstructured":"Kento Miura Toshiyuki Amagasa Hiroyuki Kitagawa R Bordawekar and T Lahiri. 2019. Accelerating Regular Path Queries using FPGA.. In ADMS@ VLDB. 47-54."},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s00778-024-00892-7","article-title":"Optimizing navigational graph queries","volume":"34","author":"Mulder Thomas","year":"2025","unstructured":"Thomas Mulder, George Fletcher, and Nikolay Yakovets. 2025. Optimizing navigational graph queries. The VLDB Journal, Vol. 34, 2 (2025), 16.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00171"},{"key":"e_1_2_1_58_1","first-page":"29","article-title":"Umbra: A Disk-Based System with In-Memory Performance","volume":"20","author":"Neumann Thomas","year":"2020","unstructured":"Thomas Neumann and Michael J Freitag. 2020. Umbra: A Disk-Based System with In-Memory Performance.. In CIDR, Vol. 20. 29.","journal-title":"CIDR"},{"key":"e_1_2_1_59_1","unstructured":"Hung Q Ngo Ely Porat Christopher R\u00e9 and Atri Rudra. 2012. Worst-case Optimal Join Algorithms. (2012)."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2017EDL8060"},{"key":"e_1_2_1_61_1","volume-title":"GFlux: A Fast GPU-Based Out-of-Memory Multi-Hop Query Processing Framework for Trillion-Edge Graphs. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE, 932-945","author":"Oh Seyeon","year":"2025","unstructured":"Seyeon Oh, Heeyong Yoon, Donghyoung Han, and Min-soo Kim. 2025. GFlux: A Fast GPU-Based Out-of-Memory Multi-Hop Query Processing Framework for Trillion-Edge Graphs. In 2025 IEEE 41st International Conference on Data Engineering (ICDE). IEEE, 932-945."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389733"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00025"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654955"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638490"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3725398"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.008"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/310889.310919"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2016.08.001"},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3320212"},{"key":"e_1_2_1_71_1","first-page":"1009","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Shovon Ahmedur Rahman","year":"2023","unstructured":"Ahmedur Rahman Shovon, Thomas Gilray, Kristopher Micinski, and Sidharth Kumar. 2023. Towards iterative relational algebra on the . In 2023 USENIX Annual Technical Conference (USENIX ATC 23). 1009-1016."},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589326"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574270"},{"key":"e_1_2_1_74_1","volume-title":"Linked data management","author":"Thompson Bryan","unstructured":"Bryan Thompson, Mike Personick, and Martyn Cutcher. 2016. The Bigdata\u00ae RDF graph database. In Linked data management. Chapman and Hall\/CRC, 221-266."},{"key":"e_1_2_1_75_1","volume-title":"The anatomy of the facebook social graph. arXiv preprint arXiv:1111.4503","author":"Ugander Johan","year":"2011","unstructured":"Johan Ugander, Brian Karrer, Lars Backstrom, and Cameron Marlow. 2011. The anatomy of the facebook social graph. arXiv preprint arXiv:1111.4503 (2011)."},{"key":"e_1_2_1_76_1","volume-title":"Representing and analysing molecular and cellular function in the computer. Biological chemistry","author":"Helden Jacques Van","year":"2000","unstructured":"Jacques Van Helden, Avi Naim, Renato Mancuso, Mattew Eldridge, Lorenz Wernisch, David Gilbert, and Shoshana J Wodak. 2000. Representing and analysing molecular and cellular function in the computer. Biological chemistry, Vol. 381, 9-10 (2000), 921-935."},{"key":"e_1_2_1_77_1","volume-title":"Proc. International Conference on Database Theory.","author":"Veldhuizen Todd L","year":"2014","unstructured":"Todd L Veldhuizen. 2014. Leapfrog triejoin: A simple, worst-case optimal join algorithm. In Proc. International Conference on Database Theory."},{"key":"e_1_2_1_78_1","unstructured":"W3C. 2013. SPARQL 1.1 Query Language. https:\/\/www.w3.org\/TR\/sparql11-query."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319882"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526134"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"e_1_2_1_82_1","volume-title":"SC22: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 1-13","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 SC22: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 1-13."},{"key":"e_1_2_1_83_1","volume-title":"The art of computer programming","author":"Wilkes MV","unstructured":"MV Wilkes. 1974. The art of computer programming, volume 3, sorting and searching."},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/3458817.3476214"},{"key":"e_1_2_1_85_1","unstructured":"Peichen Xie Zhigao Zheng Yongluan Zhou Yang Xiu Hao Liu Zhixiang Yang Yu Zhang and Bo Du. 2025. GPU Architectures in Graph Analytics: A Comparative Experimental Study. (2025)."},{"key":"e_1_2_1_86_1","volume-title":"2022 23rd IEEE International Conference on Mobile Data Management (MDM). IEEE, 238-245","author":"Xu Zequan","year":"2022","unstructured":"Zequan Xu, Siqiang Luo, Jieming Shi, Hui Li, Chen Lin, Qihang Sun, and Shaofeng Hu. 2022. Efficiently answering k-hop reachability queries in large dynamic graphs for fraud feature extraction. In 2022 23rd IEEE International Conference on Mobile Data Management (MDM). IEEE, 238-245."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882944"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00244"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00112"},{"key":"e_1_2_1_90_1","first-page":"375","volume-title":"2015 USENIX Annual Technical Conference (USENIX ATC 15)","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. : graph processing on a single machine using 2-level hierarchical partitioning. In 2015 USENIX Annual Technical Conference (USENIX ATC 15). 375-386."},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884045.2884054"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3802033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T18:25:33Z","timestamp":1779128733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3802033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":91,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,18]]}},"alternative-id":["10.1145\/3802033"],"URL":"https:\/\/doi.org\/10.1145\/3802033","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]}}}