{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:39:52Z","timestamp":1766219992434,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","funder":[{"name":"DOE ECRP Award","award":["DE-SC0025228"],"award-info":[{"award-number":["DE-SC0025228"]}]},{"name":"NSF","award":["OAC-2414474, OAC-2414185"],"award-info":[{"award-number":["OAC-2414474, OAC-2414185"]}]},{"name":"NSFC","award":["12025104"],"award-info":[{"award-number":["12025104"]}]},{"name":"2024\u20132025 Luddy Faculty Fellow Award from Indiana University Bloomington","award":["N.A."],"award-info":[{"award-number":["N.A."]}]},{"name":"Department of Energy Contract","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3754598.3754637","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"710-719","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["CompreGel: Efficient Distributed Graph Propagation via Error-Bounded Lossy Message Compression"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6141-5512","authenticated-orcid":false,"given":"Tianhao","family":"Wu","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-0408","authenticated-orcid":false,"given":"Da","family":"Yan","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5228-3835","authenticated-orcid":false,"given":"Qihao","family":"Cheng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4374-8161","authenticated-orcid":false,"given":"Lyuheng","family":"Yuan","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7339-5256","authenticated-orcid":false,"given":"Sheng","family":"Di","sequence":"additional","affiliation":[{"name":"Argonne National Laboratory, Lemont, Illinois, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4152-182X","authenticated-orcid":false,"given":"Jiao","family":"Han","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5623-4864","authenticated-orcid":false,"given":"Zhongyi","family":"Huang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3120-8966","authenticated-orcid":false,"given":"Ji","family":"Cheng","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"[n. d.]. Laboratory for Web Algorithmics. https:\/\/law.di.unimi.it\/datasets.php."},{"key":"e_1_3_3_2_3_2","unstructured":"[n. d.]. Online Appendices. https:\/\/github.com\/HereW\/CompreGel\/blob\/main\/OnlineAppendix.pdf."},{"key":"e_1_3_3_2_4_2","unstructured":"[n. d.]. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1451983.1452000"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/1935826.1935914","volume-title":"Proceedings of the fourth ACM International Conference on Web Search and Data Mining","author":"Backstrom Lars","year":"2011","unstructured":"Lars Backstrom and Jure Leskovec. 2011. Supervised random walks: Predicting and recommending links in social networks. In Proceedings of the fourth ACM International Conference on Web Search and Data Mining. 635\u2013644."},{"key":"e_1_3_3_2_7_2","first-page":"133","volume-title":"HPDC","author":"Balaji Vignesh","year":"2019","unstructured":"Vignesh Balaji and Brandon Lucia. 2019. Combining data duplication and graph reordering to accelerate parallel graph processing. In HPDC. 133\u2013144."},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Avery Ching Sergey Edunov Maja Kabiljo Dionysios Logothetis and Sambavi Muthukrishnan. 2015. One Trillion Edges: Graph Processing at Facebook-Scale. Proc. VLDB Endow. 8 12 (2015) 1804\u20131815.","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"crossref","unstructured":"Fan Chung. 2007. The heat kernel as the PageRank of a graph. Proceedings of the National Academy of Sciences 104 50 (2007) 19735\u201319740.","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_3_3_2_11_2","first-page":"420","volume-title":"Proceedings of the 30th VLDB Conference, Toronto, Canada","volume":"30","author":"DeWitt Yuan Wang David\u00a0J","year":"2004","unstructured":"Yuan Wang David\u00a0J DeWitt. 2004. Computing PageRank in a distributed Internet search system. In Proceedings of the 30th VLDB Conference, Toronto, Canada, Vol.\u00a030. 420\u2013431."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.11"},{"key":"e_1_3_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/564376.564440"},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Ronald Fagin Ravi Kumar and Dakshinamurthi Sivakumar. 2003. Comparing top k lists. SIAM Journal on discrete mathematics 17 1 (2003) 134\u2013160.","DOI":"10.1137\/S0895480102412856"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Wenfei Fan. 2022. Big graphs: Challenges and opportunities. Proceedings of the VLDB Endowment 15 12 (2022) 3782\u20133797.","DOI":"10.14778\/3554821.3554899"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"crossref","unstructured":"D\u00e1niel Fogaras Bal\u00e1zs R\u00e1cz K\u00e1roly Csalog\u00e1ny and Tam\u00e1s Sarl\u00f3s. 2005. Towards scaling fully personalized PageRank: Algorithms lower bounds and experiments. Internet Mathematics 2 3 (2005) 333\u2013358.","DOI":"10.1080\/15427951.2005.10129104"},{"key":"e_1_3_3_2_17_2","first-page":"17","volume-title":"OSDI","author":"Gonzalez Joseph\u00a0E","year":"2012","unstructured":"Joseph\u00a0E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel computation on natural graphs. In OSDI. USENIX Association, 17\u201330."},{"key":"e_1_3_3_2_18_2","first-page":"599","volume-title":"OSDI","author":"Gonzalez Joseph\u00a0E.","year":"2014","unstructured":"Joseph\u00a0E. Gonzalez, Reynold\u00a0S. Xin, Ankur Dave, Daniel Crankshaw, Michael\u00a0J. Franklin, and Ion Stoica. 2014. GraphX: Graph Processing in a Distributed Dataflow Framework. In OSDI. USENIX Association, 599\u2013613."},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488433"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Minyang Han Khuzaima Daudjee Khaled Ammar M\u00a0Tamer \u00d6zsu Xingfang Wang and Tianqi Jin. 2014. An experimental comparison of Pregel-like graph processing systems. Proceedings of the VLDB Endowment 7 12 (2014) 1047\u20131058.","DOI":"10.14778\/2732977.2732980"},{"key":"e_1_3_3_2_21_2","first-page":"238","volume-title":"IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS)","author":"Huang Baofu","year":"2020","unstructured":"Baofu Huang, Zhidan Liu, and Kaishun Wu. 2020. Accelerating PageRank in shared-memory for efficient social network graph analytics. In IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 238\u2013247."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3130348.3130374"},{"key":"e_1_3_3_2_23_2","unstructured":"G. Karypis and V. Kumar. [n. d.]. METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering. http:\/\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview."},{"key":"e_1_3_3_2_24_2","first-page":"427","volume-title":"2018 USENIX Annual Technical Conference (USENIX ATC 18)","author":"Lakhotia Kartik","year":"2018","unstructured":"Kartik Lakhotia, Rajgopal Kannan, and Viktor Prasanna. 2018. Accelerating PageRank Using Partition-Centric Processing. In 2018 USENIX Annual Technical Conference (USENIX ATC 18). 427\u2013440."},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622520"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"crossref","unstructured":"Xin Liang Kai Zhao Sheng Di Sihuan Li Robert Underwood Ali\u00a0M Gok Jiannan Tian Junjing Deng Jon\u00a0C Calhoun Dingwen Tao et\u00a0al. 2022. SZ3: A modular framework for composing prediction-based error-bounded lossy compressors. IEEE Transactions on Big Data 9 2 (2022) 485\u2013498.","DOI":"10.1109\/TBDATA.2022.3201176"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Meihao Liao Rong-Hua Li Qiangqiang Dai Hongyang Chen Hongchao Qin and Guoren Wang. 2023. Efficient personalized PageRank computation: The power of variance-reduced Monte Carlo approaches. Proceedings of the ACM on Management of Data 1 2 (2023) 1\u201326.","DOI":"10.1145\/3589305"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Yucheng Low Joseph Gonzalez Aapo Kyrola Danny Bickson Carlos Guestrin and Joseph\u00a0M Hellerstein. 2012. Distributed GraphLab: A framework for machine learning and data mining in the cloud. Proc. VLDB Endow. 5 8 (2012).","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Yi Lu James Cheng Da Yan and Huanhuan Wu. 2014. Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation. Proc. VLDB Endow. 8 3 (2014) 281\u2013292.","DOI":"10.14778\/2735508.2735517"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/1807167.1807184","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","author":"Malewicz Grzegorz","year":"2010","unstructured":"Grzegorz Malewicz, Matthew\u00a0H Austern, Aart\u00a0JC Bik, James\u00a0C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: A system for large-scale graph processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. 135\u2013146."},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Daniel Margo and Margo Seltzer. 2015. A scalable distributed graph partitioner. Proceedings of the VLDB Endowment 8 12 (2015) 1478\u20131489.","DOI":"10.14778\/2824032.2824046"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Robert\u00a0Ryan McCune Tim Weninger and Greg Madey. 2015. Thinking like a vertex: A survey of vertex-centric frameworks for large-scale distributed graph processing. ACM Computing Surveys (CSUR) 48 2 (2015) 1\u201339.","DOI":"10.1145\/2818185"},{"key":"e_1_3_3_2_33_2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1298306.1298311","volume-title":"Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement","author":"Mislove Alan","year":"2007","unstructured":"Alan Mislove, Massimiliano Marcon, Krishna\u00a0P Gummadi, Peter Druschel, and Bobby Bhattacharjee. 2007. Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement. 29\u201342."},{"key":"e_1_3_3_2_34_2","first-page":"962","volume-title":"35th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2021, Portland, OR, USA, May 17-21, 2021","author":"Mughrabi Abdullah\u00a0T.","year":"2021","unstructured":"Abdullah\u00a0T. Mughrabi, Mohannad Ibrahim, and Gregory\u00a0T. Byrd. 2021. QPR: Quantizing PageRank with coherent shared memory accelerators. In 35th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2021, Portland, OR, USA, May 17-21, 2021. IEEE, 962\u2013972."},{"key":"e_1_3_3_2_35_2","volume-title":"The PageRank citation ranking: Bring order to the web","author":"Page Lawrence","year":"1998","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1998. The PageRank citation ranking: Bring order to the web. Technical Report. Technical Report, Stanford University."},{"key":"e_1_3_3_2_36_2","doi-asserted-by":"crossref","unstructured":"Sungchan Park Wonseok Lee Byeongseo Choe and Sang-Goo Lee. 2019. A survey on personalized PageRank computation algorithms. IEEE Access 7 (2019) 163049\u2013163062.","DOI":"10.1109\/ACCESS.2019.2952653"},{"key":"e_1_3_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2006.35"},{"key":"e_1_3_3_2_38_2","doi-asserted-by":"crossref","unstructured":"A\u00a0Harry Robinson and Colin Cherry. 1967. Results of a prototype television bandwidth compression scheme. Proc. IEEE 55 3 (1967) 356\u2013364.","DOI":"10.1109\/PROC.1967.5493"},{"key":"e_1_3_3_2_39_2","doi-asserted-by":"crossref","unstructured":"Zechao Shang and Jeffrey\u00a0Xu Yu. 2014. Auto-approximation of graph computing. Proceedings of the VLDB Endowment 7 14 (2014) 1833\u20131844.","DOI":"10.14778\/2733085.2733090"},{"key":"e_1_3_3_2_40_2","doi-asserted-by":"crossref","unstructured":"Jieming Shi Renchi Yang Tianyuan Jin Xiaokui Xiao and Yin Yang. 2019. Realtime top-k personalized PageRank over large graphs on GPUs. Proceedings of the VLDB Endowment 13 1 (2019) 15\u201328.","DOI":"10.14778\/3357377.3357379"},{"key":"e_1_3_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.115"},{"key":"e_1_3_3_2_42_2","doi-asserted-by":"crossref","unstructured":"Shang-Hua Teng et\u00a0al. 2016. Scalable algorithms for data and network analysis. Foundations and Trends\u00ae in Theoretical Computer Science 12 1\u20132 (2016) 1\u2013274.","DOI":"10.1561\/0400000051"},{"key":"e_1_3_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467243"},{"key":"e_1_3_3_2_44_2","first-page":"993","volume-title":"SIGMOD Conference","author":"Wang Jianguo","year":"2017","unstructured":"Jianguo Wang, Chunbin Lin, Yannis Papakonstantinou, and Steven Swanson. 2017. An experimental study of bitmap compression vs. inverted list compression. In SIGMOD Conference. 993\u20131008."},{"key":"e_1_3_3_2_45_2","first-page":"154","volume-title":"International Conference in Swarm Intelligence","author":"Wang Rui","year":"2013","unstructured":"Rui Wang, Weilai Zhang, Han Deng, Nanli Wang, Qing Miao, and Xinchao Zhao. 2013. Discover community leader in social network with PageRank. In International Conference in Swarm Intelligence. Springer, 154\u2013162."},{"key":"e_1_3_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098072"},{"key":"e_1_3_3_2_47_2","first-page":"1996","volume-title":"SIGMOD Conference","author":"Wu Hao","year":"2021","unstructured":"Hao Wu, Junhao Gan, Zhewei Wei, and Rui Zhang. 2021. Unifying the global and local approaches: An efficient power iteration with forward push. In SIGMOD Conference. 1996\u20132008."},{"key":"e_1_3_3_2_48_2","doi-asserted-by":"crossref","unstructured":"Da Yan Yingyi Bu Yuanyuan Tian and Amol Deshpande. 2017. Big Graph Analytics Platforms. Found. Trends Databases 7 1-2 (2017) 1\u2013195.","DOI":"10.1561\/1900000056"},{"key":"e_1_3_3_2_49_2","doi-asserted-by":"crossref","unstructured":"Da Yan James Cheng Yi Lu and Wilfred Ng. 2014. Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs. Proc. VLDB Endow. 7 14 (2014) 1981\u20131992.","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_3_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741096"},{"key":"e_1_3_3_2_51_2","doi-asserted-by":"crossref","unstructured":"Da Yan James Cheng M.\u00a0Tamer \u00d6zsu Fan Yang Yi Lu John C.\u00a0S. Lui Qizhen Zhang and Wilfred Ng. 2016. A General-Purpose Query-Centric Framework for Querying Big Graphs. Proc. VLDB Endow. 9 7 (2016) 564\u2013575.","DOI":"10.14778\/2904483.2904488"},{"key":"e_1_3_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319886"},{"key":"e_1_3_3_2_53_2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1109\/ISCA45697.2020.00043","volume-title":"2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)","author":"Yang Yifan","year":"2020","unstructured":"Yifan Yang, Zhaoshi Li, Yangdong Deng, Zhiwei Liu, Shouyi Yin, Shaojun Wei, and Leibo Liu. 2020. GraphABCD: Scaling out graph analytics with asynchronous block coordinate descent. In 2020 ACM\/IEEE 47th Annual International Symposium on Computer Architecture (ISCA). IEEE, 419\u2013432."},{"key":"e_1_3_3_2_54_2","first-page":"199","volume-title":"2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA)","author":"Yao Pengcheng","year":"2022","unstructured":"Pengcheng Yao, Long Zheng, Yu Huang, Qinggang Wang, Chuangyi Gui, Zhen Zeng, Xiaofei Liao, Hai Jin, and Jingling Xue. 2022. ScalaGraph: A scalable accelerator for massively parallel graph processing. In 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 199\u2013212."},{"key":"e_1_3_3_2_55_2","doi-asserted-by":"crossref","unstructured":"Zhe Yao Philip Mark and Michael Rabbat. 2012. Anomaly detection using proximity graph and PageRank algorithm. IEEE Transactions on Information Forensics and Security 7 4 (2012) 1288\u20131300.","DOI":"10.1109\/TIFS.2012.2191963"},{"key":"e_1_3_3_2_56_2","first-page":"1411","volume-title":"SIGMOD Conference","author":"Zhang Qizhen","year":"2019","unstructured":"Qizhen Zhang, Akash Acharya, Hongzhi Chen, Simran Arora, Ang Chen, Vincent Liu, and Boon\u00a0Thau Loo. 2019. Optimizing Declarative Graph Queries at Large Scale. In SIGMOD Conference. ACM, 1411\u20131428."},{"key":"e_1_3_3_2_57_2","first-page":"2189","volume-title":"SIGMOD Conference","author":"Zhang Qizhen","year":"2016","unstructured":"Qizhen Zhang, Da Yan, and James Cheng. 2016. Quegel: A General-Purpose System for Querying Big Graphs. In SIGMOD Conference. ACM, 2189\u20132192."},{"key":"e_1_3_3_2_58_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/3298689.3346997","volume-title":"Proceedings of the 13th ACM Conference on Recommender Systems","author":"Zhao Zhe","year":"2019","unstructured":"Zhe Zhao, Lichan Hong, Li Wei, Jilin Chen, Aniruddh Nath, Shawn Andrews, Aditee Kumthekar, Maheswaran Sathiamoorthy, Xinyang Yi, and Ed Chi. 2019. Recommending what video to watch next: A multitask ranking system. In Proceedings of the 13th ACM Conference on Recommender Systems. 43\u201351."}],"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.3754637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:37:28Z","timestamp":1766219848000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":57,"alternative-id":["10.1145\/3754598.3754637","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754637","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"}}]}}