{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:39:51Z","timestamp":1766219991285,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3754598.3754644","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"385-395","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["PTWalker: Cache-Efficient Random Walks via Alternating Dual-Subgraph Walker Updating"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6004-4128","authenticated-orcid":false,"given":"Shuai","family":"Lin","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8915-4169","authenticated-orcid":false,"given":"Rui","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6075-1221","authenticated-orcid":false,"given":"Zaigui","family":"zhang","sequence":"additional","affiliation":[{"name":"Jinan Inspur Data Technology Co., Ltd., Jinan, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3448-2153","authenticated-orcid":false,"given":"Long","family":"Deng","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3965-2597","authenticated-orcid":false,"given":"Wenzhe","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3743-8511","authenticated-orcid":false,"given":"Yongkun","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9586-0561","authenticated-orcid":false,"given":"Yinlong","family":"Xu","sequence":"additional","affiliation":[{"name":"Anhui Provincial Key Laboratory of High Performance Computing, USTC, Hefei, China and University of Science and Technology of China, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"Dmitrii Avdiukhin and Sergey Pupyrev. 2019. Multi-dimensional balanced graph partitioning via projected gradient descent. arXiv (2019).","DOI":"10.14778\/3324301.3324307"},{"key":"e_1_3_3_2_3_2","unstructured":"Friendster. 2013. . http:\/\/konect.cc\/networks\/friendster\/"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567491"},{"key":"e_1_3_3_2_6_2","unstructured":"IT. 2004. . https:\/\/law.di.unimi.it\/webdata\/it-2004\/"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447786.3456244"},{"key":"e_1_3_3_2_8_2","unstructured":"Hongzheng Li Yingxia Shao Junping Du and Bin Cui. 2022. An I\/O-Efficient Disk-based Graph System for Scalable Second-Order Random Walk of Large Graphs. Proc. of the ACM VLDB (2022)."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00090"},{"key":"e_1_3_3_2_10_2","unstructured":"Shuai Lin Rui Wang Yongkun Li Yinlong Xu and John\u00a0CS Lui. 2024. Two-Dimensional Balanced Partitioning and Efficient Caching for Distributed Graph Analysis. TPDS (2024)."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545060"},{"key":"e_1_3_3_2_12_2","unstructured":"Chengjun Liu Zhuo Peng Weiguo Zheng and Lei Zou. 2024. FSM: A Fine-Grained Splitting and Merging Framework for Dual-Balanced Graph Partition. Proc. of the ACM VLDB (2024)."},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"crossref","unstructured":"Xin Lv Yuxian Gu Xu Han Lei Hou Juanzi Li and Zhiyuan Liu. 2019. Adapting meta knowledge graph information for multi-hop reasoning over few-shot relations. arXiv (2019).","DOI":"10.18653\/v1\/D19-1334"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Junyi Mei Shixuan Sun Chao Li Cheng Xu Cheng Chen Yibo Liu Jing Wang Cheng Zhao Xiaofeng Hou Minyi Guo et\u00a0al. 2024. FlowWalker: A Memory-efficient and High-performance GPU-based Dynamic Graph Random Walk Framework. arXiv (2024).","DOI":"10.14778\/3659437.3659438"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00107"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_3_2_17_2","volume-title":"The PageRank citation ranking: Bringing order to the web.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, and Rajeev Motwani. 1999. The PageRank citation ranking: Bringing order to the web.Technical Report. Stanford infolab."},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/SC41405.2020.00060"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583193"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Prabhakant Sinha and Andris\u00a0A Zoltners. 1979. The multiple-choice knapsack problem. Operations Research 27 3 (1979) 503\u2013515.","DOI":"10.1287\/opre.27.3.503"},{"key":"e_1_3_3_2_23_2","volume-title":"Proc. of the ACM VLDB","author":"Sun Shixuan","year":"2021","unstructured":"Shixuan Sun, Yuhang Chen, Shengliang Lu, Bingsheng He, and Yuchen Li. 2021. ThunderRW: an in-memory graph random walk engine.(2021). In Proc. of the ACM VLDB."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Anton Tsitsulin Marina Munkhoeva Davide Mottin Panagiotis Karras and Ivan Oseledets. 2020. FREDE: anytime graph embeddings. arXiv (2020).","DOI":"10.14778\/3447689.3447713"},{"key":"e_1_3_3_2_27_2","unstructured":"Twitter. 2010. . https:\/\/law.di.unimi.it\/webdata\/twitter-2010\/"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403108"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219869"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/PACT52795.2021.00029"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00091"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Rui Wang Yongkun Li Shuai Lin Hong Xie Yinlong Xu and John\u00a0CS Lui. 2021. On modeling influence maximization in social activity networks under general settings. ACM TKDD 15 6 (2021) 1\u201328.","DOI":"10.1145\/3451218"},{"key":"e_1_3_3_2_33_2","volume-title":"Proc. of the USENIX ATC","author":"Wang Rui","year":"2020","unstructured":"Rui Wang, Yongkun Li, Hong Xie, Yinlong Xu, and John\u00a0CS Lui. 2020. GraphWalker: An I\/O-Efficient and Resource-Friendly Graph Analytic System for Fast and Scalable Random Walks. In Proc. of the USENIX ATC."},{"key":"e_1_3_3_2_34_2","volume-title":"Proc. of the USENIX ATC","author":"Wang Rui","year":"2024","unstructured":"Rui Wang, Weixu Zong, Shuibing He, Xinyu Chen, Zhenxin Li, and Zheng Dang. 2024. Efficient Large Graph Processing with { Chunk-Based} Graph Representation Model. In Proc. of the USENIX ATC."},{"key":"e_1_3_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582025"},{"key":"e_1_3_3_2_36_2","volume-title":"Proc. of the USENIX ATC","author":"Wu Yutong","year":"2023","unstructured":"Yutong Wu, Zhan Shi, Shicai Huang, Zhipeng Tian, Pengwei Zuo, Peng Fang, and Dan Feng. 2023. SOWalker: An I\/O-Optimized Out-of-Core Graph Processing System for Second-Order Random Walks. In Proc. of the USENIX ATC."},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483575"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359634"},{"key":"e_1_3_3_2_39_2","unstructured":"Renchi Yang Jieming Shi Xiaokui Xiao and Yin Yang. [n. d.]. Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank. Proc. of the ACM VLDB ([n. d.])."},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"crossref","unstructured":"Renchi Yang Jieming Shi Xiaokui Xiao Yin Yang and Sourav\u00a0S Bhowmick. 2022. No pane no gain: Scaling attributed network embedding in a single server. Proc. of the ACM SIGMOD (2022).","DOI":"10.1145\/3542700.3542711"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10878"}],"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.3754644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:37:14Z","timestamp":1766219834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":40,"alternative-id":["10.1145\/3754598.3754644","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754644","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"}}]}}