{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:48:25Z","timestamp":1755802105844,"version":"3.44.0"},"reference-count":51,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["RS-2024-00347471,RS-2023-00281635"],"award-info":[{"award-number":["RS-2024-00347471,RS-2023-00281635"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010418","name":"Institute of Information & communications Technology Planning & Evaluation","doi-asserted-by":"publisher","award":["2019-0-01267"],"award-info":[{"award-number":["2019-0-01267"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icde65448.2025.00075","type":"proceedings-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:28:25Z","timestamp":1755714505000},"page":"932-945","source":"Crossref","is-referenced-by-count":0,"title":["GFlux: A Fast GPU-Based Out-of-Memory Multi-Hop Query Processing Framework for Trillion-Edge Graphs"],"prefix":"10.1109","author":[{"given":"Seyeon","family":"Oh","sequence":"first","affiliation":[{"name":"DGIST,EECS,Daegu,Republic of Korea"}]},{"given":"Heeyong","family":"Yoon","sequence":"additional","affiliation":[{"name":"DGIST,EECS,Daegu,Republic of Korea"}]},{"given":"Donghyoung","family":"Han","sequence":"additional","affiliation":[{"name":"GraphAI,Daejeon,Republic of Korea"}]},{"given":"Min-soo","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Computing, KAIST,Daejeon,Republic of Korea"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304029"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3324301.3324306"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157799"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3296957.3173180"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2600212.2600227"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/2370816.2370866","article-title":"A yoke of oxen and a thousand chickens for heavy lifting graph processing","volume-title":"Proceedings of the 21st international conference on Parallel architectures and compilation techniques","author":"Gharaibeh","year":"2012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387537"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3477603"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/3425879.3425883"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3444844"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384358"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915204"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733058"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196915"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523189"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3093240"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00017"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3064892"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2735405"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2021.3135329"},{"volume-title":"Unified memory for cuda beginners","year":"2017","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3627535.3638490"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392742"},{"key":"ref25","article-title":"Dynasoar: a parallel memory allocator for object-oriented programming on gpus with efficient memory access","author":"Springer","year":"2018","journal-title":"arXiv preprint arXiv"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2588768.2576781"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2458523.2458535"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12666"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3293883.3295727"},{"key":"ref30","article-title":"Halloc: a high-throughput dynamic memory allocator for gpgpu architectures","volume-title":"GPU Technology Conference (GTC)","volume":"152","author":"Adinetz","year":"2014"},{"key":"ref31","first-page":"301","article-title":"Gemini: A computation-centric distributed graph processing system","volume":"16","author":"Zhu","year":"2016","journal-title":"OSDI"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815408"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487581"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064191"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/s1064827595287997"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3472456.3472457"},{"volume-title":"Cuda c++ programming guide","year":"2023","key":"ref37"},{"volume-title":"Hip 6.1.40091 documentation","year":"2024","key":"ref38"},{"volume-title":"How to optimize data transfers in cuda c\/c++","year":"2012","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/365628.365655"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"volume-title":"Webspam-uk2007","year":"2007","key":"ref42"},{"volume-title":"The lemur project: Clueweb12 web graph","year":"2012","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.43"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064014"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00708-y"},{"key":"ref47","article-title":"K\u00f9zu graph database management system","author":"Feng","year":"2023","journal-title":"CIDR"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"ref58","first-page":"599","article-title":"Graphx: Graph processing in a distributed dataflow framework","volume-title":"11 th{USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 14)","author":"Gonzalez","year":"2014"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137801"}],"event":{"name":"2025 IEEE 41st International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2025,5,19]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE 41st International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11112833\/11112834\/11113115.pdf?arnumber=11113115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T05:12:10Z","timestamp":1755753130000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11113115\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/icde65448.2025.00075","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}