{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T15:35:49Z","timestamp":1776785749111,"version":"3.51.2"},"reference-count":118,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p>Recent studies have shown the promise of directly processing compressed graphs. However, its benefits have been limited by high peak-memory usage and unbearably long compression time. In this paper, we introduce Laconic, a novel rule-based graph processing solution that overcomes the challenges of restricted memory and impractical compression time faced by existing approaches. Laconic, for the first time, ensures minimal memory overhead during compression and significantly reduces graph sizes, thus reducing peak memory demand during computations. By employing an efficient parallel compression algorithm, Laconic achieves a remarkable reduction in compression time. In our experiments, we compare Laconic with state-of-the-art solutions. The results demonstrate that Laconic outperforms other methods, reducing peak memory consumption by an average of 70% during compression and 66% during computation. Additionally, Laconic reduces rule compression time by an average of 93% compared to traditional rule-based compression, achieving a 2.47\u00d7 higher compression ratio, and providing a 2.12\u00d7 performance speedup.<\/jats:p>","DOI":"10.14778\/3665844.3665852","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:19:07Z","timestamp":1722982747000},"page":"2212-2226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Improving Graph Compression for Efficient Resource-Constrained Graph Analytics"],"prefix":"10.14778","volume":"17","author":[{"given":"Qian","family":"Xu","sequence":"first","affiliation":[{"name":"Renmin University of China"}]},{"given":"Juan","family":"Yang","sequence":"additional","affiliation":[{"name":"Beijing HaiZhi XingTu Technology Co., Ltd"}]},{"given":"Feng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Zheng","family":"Chen","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Jiawei","family":"Guan","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Kang","family":"Chen","sequence":"additional","affiliation":[{"name":"Tsinghua University"}]},{"given":"Ju","family":"Fan","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Youren","family":"Shen","sequence":"additional","affiliation":[{"name":"Beijing HaiZhi XingTu Technology Co., Ltd"}]},{"given":"Ke","family":"Yang","sequence":"additional","affiliation":[{"name":"Beijing HaiZhi XingTu Technology Co., Ltd"}]},{"given":"Yu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]},{"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[{"name":"Renmin University of China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 2006 ACM SIGMOD international conference on Management of data. 671--682","author":"Abadi Daniel","year":"2006","unstructured":"Daniel Abadi, Samuel Madden, and Miguel Ferreira. 2006. Integrating compression and execution in column-oriented database systems. In Proceedings of the 2006 ACM SIGMOD international conference on Management of data. 671--682."},{"key":"e_1_2_1_2_1","volume-title":"Succinct: Enabling queries on compressed data. In 12th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 15). 337--350.","author":"Agarwal Rachit","year":"2015","unstructured":"Rachit Agarwal, Anurag Khandelwal, and Ion Stoica. 2015. Succinct: Enabling queries on compressed data. In 12th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 15). 337--350."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"2681","DOI":"10.1039\/c3mb70236g","article-title":"Power graph compression reveals dominant relationships in genetic transcription networks","volume":"9","author":"Ahnert Sebastian E","year":"2013","unstructured":"Sebastian E Ahnert. 2013. Power graph compression reveals dominant relationships in genetic transcription networks. Molecular BioSystems 9, 11 (2013), 2681--2685.","journal-title":"Molecular BioSystems"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"1114","DOI":"10.1109\/PROC.1975.9903","article-title":"Space and time savings through large data base compression and dynamic restructuring","volume":"63","author":"Alsberg Peter A","year":"1975","unstructured":"Peter A Alsberg. 1975. Space and time savings through large data base compression and dynamic restructuring. Proc. IEEE 63, 8 (1975), 1114--1122.","journal-title":"Proc. IEEE"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.3390\/a2031031","article-title":"Graph compression by BFS","volume":"2","author":"Apostolico Alberto","year":"2009","unstructured":"Alberto Apostolico and Guido Drovandi. 2009. Graph compression by BFS. Algorithms 2, 3 (2009), 1031--1044.","journal-title":"Algorithms"},{"key":"e_1_2_1_6_1","volume-title":"SC'14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 781--792","author":"Ashari Arash","year":"2014","unstructured":"Arash Ashari, Naser Sedaghati, John Eisenlohr, Srinivasan Parthasarath, and P Sadayappan. 2014. Fast sparse matrix-vector multiplication on GPUs for graph applications. In SC'14: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 781--792."},{"key":"e_1_2_1_7_1","volume-title":"A tutorial review of functional connectivity analysis methods and their interpretational pitfalls. Frontiers in systems neuroscience 9","author":"Bastos Andr\u00e9 M","year":"2016","unstructured":"Andr\u00e9 M Bastos and Jan-Mathijs Schoffelen. 2016. A tutorial review of functional connectivity analysis methods and their interpretational pitfalls. Frontiers in systems neuroscience 9 (2016), 175."},{"key":"e_1_2_1_8_1","volume-title":"Latent dirichlet allocation. the Journal of machine Learning research 3","author":"Blei David M","year":"2003","unstructured":"David M Blei, Andrew Y Ng, and Michael I Jordan. 2003. Latent dirichlet allocation. the Journal of machine Learning research 3 (2003), 993--1022."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 20th international conference on World Wide Web, Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM Press, 587--596","author":"Boldi Paolo","year":"2011","unstructured":"Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. 2011. Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the 20th international conference on World Wide Web, Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM Press, 587--596."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 13th international conference on World Wide Web. 595--602","author":"Boldi Paolo","year":"2004","unstructured":"Paolo Boldi and Sebastiano Vigna. 2004. The webgraph framework I: compression techniques. In Proceedings of the 13th international conference on World Wide Web. 595--602."},{"key":"e_1_2_1_11_1","first-page":"1","article-title":"HDFS architecture guide","volume":"53","author":"Dhruba Borthakur","year":"2008","unstructured":"Dhruba Borthakur et al. 2008. HDFS architecture guide. Hadoop Apache Project 53, 1--13 (2008), 2.","journal-title":"Hadoop Apache Project"},{"key":"e_1_2_1_12_1","volume-title":"International symposium on string processing and information retrieval. Springer, 18--30","author":"Brisaboa Nieves R","year":"2009","unstructured":"Nieves R Brisaboa, Susana Ladra, and Gonzalo Navarro. 2009. k 2-trees for compact web graph representation. In International symposium on string processing and information retrieval. Springer, 18--30."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 2008 international conference on web search and data mining. 95--106","author":"Buehrer Gregory","year":"2008","unstructured":"Gregory Buehrer and Kumar Chellapilla. 2008. A scalable pattern mining approach to web graph compression with communities. In Proceedings of the 2008 international conference on web search and data mining. 95--106."},{"key":"e_1_2_1_14_1","unstructured":"Michael Burrows and David Wheeler. 1994. A block-sorting lossless data compression algorithm. In Digital SRC Research Report. Citeseer."},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1109\/TIT.2005.850116","article-title":"The smallest grammar problem","volume":"51","author":"Charikar Moses","year":"2005","unstructured":"Moses Charikar, Eric Lehman, Ding Liu, Rina Panigrahy, Manoj Prabhakaran, Amit Sahai, and Abhi Shelat. 2005. The smallest grammar problem. IEEE Transactions on Information Theory 51, 7 (2005), 2554--2576.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","volume":"2","author":"Chen Hongtao","year":"2023","unstructured":"Hongtao Chen, Mingxing Zhang, Ke Yang, Kang Chen, Albert Zomaya, Yongwei Wu, and Xuehai Qian. 2023. Achieving Sub-second Pairwise Query over Evolving Graphs. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2 (Vancouver, BC, Canada) (ASPLOS 2023). Association for Computing Machinery, New York, NY, USA, 1--15. 10.1145\/3575693.3576173"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298989"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"1585","DOI":"10.1109\/TKDE.2006.196","article-title":"Regression cubes with lossless compression and aggregation","volume":"18","author":"Chen Yixin","year":"2006","unstructured":"Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W Wah, and Jianyong Wang. 2006. Regression cubes with lossless compression and aggregation. IEEE Transactions on Knowledge and Data Engineering 18, 12 (2006), 1585--1599.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_20_1","first-page":"31","article-title":"CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression","volume":"1","author":"Chen Zheng","year":"2023","unstructured":"Zheng Chen, Feng Zhang, JiaWei Guan, Jidong Zhai, Xipeng Shen, Huanchen Zhang, Wentong Shu, and Xiaoyong Du. 2023. CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression. Proc. ACM Manag. Data 1, 1 (2023), 31.","journal-title":"Proc. ACM Manag. Data"},{"key":"e_1_2_1_21_1","volume-title":"2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 409--420","author":"Chi Yuze","year":"2016","unstructured":"Yuze Chi, Guohao Dai, Yu Wang, Guangyu Sun, Guoliang Li, and Huazhong Yang. 2016. Nxgraph: An efficient graph processing system on a single machine. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 409--420."},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 219--228","author":"Chierichetti Flavio","year":"2009","unstructured":"Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, and Prabhakar Raghavan. 2009. On compressing social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 219--228."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/381694.378840","article-title":"Efficient representations and abstractions for quantifying and exploiting data reference locality","volume":"36","author":"Chilimbi Trishul M","year":"2001","unstructured":"Trishul M Chilimbi. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. ACM SIGPLAN Notices 36, 5 (2001), 191--202.","journal-title":"ACM SIGPLAN Notices"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation. 199--209","author":"Chilimbi Trishul M","year":"2002","unstructured":"Trishul M Chilimbi and Martin Hirzel. 2002. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation. 199--209."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1841909.1841913","article-title":"Fast and compact web graph representations","volume":"4","author":"Claude Francisco","year":"2010","unstructured":"Francisco Claude and Gonzalo Navarro. 2010. Fast and compact web graph representations. ACM Transactions on the Web (TWEB) 4, 4 (2010), 1--31.","journal-title":"ACM Transactions on the Web (TWEB)"},{"key":"e_1_2_1_26_1","volume-title":"Introduction to algorithms","author":"Cormen Thomas H","unstructured":"Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2009. Introduction to algorithms. MIT press."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 13th international conference on Extending Database Technology. 228--239","author":"Deli\u00e8ge Fran\u00e7ois","year":"2010","unstructured":"Fran\u00e7ois Deli\u00e8ge and Torben Bach Pedersen. 2010. Position list word aligned hybrid: optimizing space and performance for compressed bitmaps. In Proceedings of the 13th international conference on Extending Database Technology. 228--239."},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Peter Deutsch et al. 1996. GZIP file format specification version 4.3. (1996).","DOI":"10.17487\/rfc1952"},{"key":"e_1_2_1_29_1","first-page":"22","article-title":"LZW data compression","volume":"3","author":"Dheemanth HN","year":"2014","unstructured":"HN Dheemanth. 2014. LZW data compression. American Journal of Engineering Research 3, 2 (2014), 22--26.","journal-title":"American Journal of Engineering Research"},{"key":"e_1_2_1_30_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 3, Article 221 (nov","author":"Dhulipala Laxman","year":"2023","unstructured":"Laxman Dhulipala, Jakub \u0141\u0105cki, Jason Lee, and Vahab Mirrokni. 2023. TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs. Proc. ACM Manag. Data 1, 3, Article 221 (nov 2023), 27 pages. 10.1145\/3617341"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1109\/TVCG.2012.208","article-title":"Compressed adjacency matrices: Untangling gene regulatory networks","volume":"18","author":"Dinkla Kasper","year":"2012","unstructured":"Kasper Dinkla, Michel A Westenberg, and Jarke J van Wijk. 2012. Compressed adjacency matrices: Untangling gene regulatory networks. IEEE Transactions on Visualization and Computer Graphics 18, 12 (2012), 2457--2466.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"e_1_2_1_32_1","volume-title":"Universal codeword sets and representations of the integers","author":"Elias Peter","year":"1975","unstructured":"Peter Elias. 1975. Universal codeword sets and representations of the integers. IEEE transactions on information theory 21, 2 (1975), 194--203."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14--19","author":"Fan Wenfei","year":"2020","unstructured":"Wenfei Fan, Ruochun Jin, Muyang Liu, Ping Lu, Xiaojian Luo, Ruiqi Xu, Qiang Yin, Wenyuan Yu, and Jingren Zhou. 2020. Application Driven Graph Partitioning. In Proceedings of the 2020 International Conference on Management of Data, SIGMOD Conference 2020, online conference [Portland, OR, USA], June 14--19, 2020, David Maier, Rachel Pottinger, AnHai Doan, Wang-Chiew Tan, Abdussalam Alawini, and Hung Q. Ngo (Eds.). ACM, 1765--1779. 10.1145\/3318464.3389745"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 2012 ACM SIGMOD international conference on management of data. 157--168","author":"Fan Wenfei","year":"2012","unstructured":"Wenfei Fan, Jianzhong Li, Xin Wang, and Yinghui Wu. 2012. Query preserving graph compression. In Proceedings of the 2012 ACM SIGMOD international conference on management of data. 157--168."},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 2022 International Conference on Management of Data. 1726--1740","author":"Fan Wenfei","year":"2022","unstructured":"Wenfei Fan, Yuanhao Li, Muyang Liu, and Can Lu. 2022. A Hierarchical Contraction Scheme for Querying Big Graphs. In Proceedings of the 2022 International Conference on Management of Data. 1726--1740."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In The world wide web conference. 417--426.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_2_1_37_1","volume-title":"European Symposium on Algorithms. Springer, 406--417","author":"Farruggia Andrea","year":"2014","unstructured":"Andrea Farruggia, Paolo Ferragina, and Rossano Venturini. 2014. Bicriteria data compression: Efficient and usable. In European Symposium on Algorithms. Springer, 406--417."},{"key":"e_1_2_1_38_1","first-page":"1","article-title":"Compressed text indexes: From theory to practice","volume":"13","author":"Ferragina Paolo","year":"2009","unstructured":"Paolo Ferragina, Rodrigo Gonz\u00e1lez, Gonzalo Navarro, and Rossano Venturini. 2009. Compressed text indexes: From theory to practice. Journal of Experimental Algorithmics (JEA) 13 (2009), 1--12.","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","article-title":"Indexing compressed text","volume":"52","author":"Ferragina Paolo","year":"2005","unstructured":"Paolo Ferragina and Giovanni Manzini. 2005. Indexing compressed text. Journal of the ACM (JACM) 52, 4 (2005), 552--581.","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 768--777","author":"Ferragina Paolo","year":"2009","unstructured":"Paolo Ferragina, Igor Nitto, and Rossano Venturini. 2009. On the bit-complexity of Lempel-Ziv compression. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 768--777."},{"key":"e_1_2_1_41_1","volume-title":"Centrality in social networks: II. Experimental results. Social networks 2, 2","author":"Freeman Linton C","year":"1979","unstructured":"Linton C Freeman, Douglas Roeder, and Robert R Mulholland. 1979. Centrality in social networks: II. Experimental results. Social networks 2, 2 (1979), 119--141."},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. 1899--1908","author":"Gao Shangqian","year":"2020","unstructured":"Shangqian Gao, Feihu Huang, Jian Pei, and Heng Huang. 2020. Discrete model compression with resource constraint for deep neural networks. In Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. 1899--1908."},{"key":"e_1_2_1_43_1","volume-title":"International Symposium on Experimental Algorithms. Springer, 326--337","author":"Gog Simon","year":"2014","unstructured":"Simon Gog, Timo Beller, Alistair Moffat, and Matthias Petri. 2014. From theory to practice: Plug and play with succinct data structures. In International Symposium on Experimental Algorithms. Springer, 326--337."},{"key":"e_1_2_1_44_1","volume-title":"Powergraph: Distributed graph-parallel computation on natural graphs. In 10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12). 17--30.","author":"Gonzalez Joseph E","year":"2012","unstructured":"Joseph E Gonzalez, Yucheng Low, Haijie Gu, Danny Bickson, and Carlos Guestrin. 2012. Powergraph: Distributed graph-parallel computation on natural graphs. In 10th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 12). 17--30."},{"key":"e_1_2_1_45_1","first-page":"636","article-title":"When indexing equals compression: experiments with compressing suffix arrays and applications","volume":"4","author":"Grossi Roberto","year":"2004","unstructured":"Roberto Grossi, Ankur Gupta, and Jeffrey Scott Vitter. 2004. When indexing equals compression: experiments with compressing suffix arrays and applications.. In SODA, Vol. 4. 636--645.","journal-title":"SODA"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","first-page":"1961","DOI":"10.1109\/TIT.2009.2016040","article-title":"Nonlinear sparse-graph codes for lossy compression","volume":"55","author":"Gupta Ankit","year":"2009","unstructured":"Ankit Gupta and Sergio Verd\u00fa. 2009. Nonlinear sparse-graph codes for lossy compression. IEEE Transactions on Information Theory 55, 5 (2009), 1961--1975.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_47_1","volume-title":"2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 233--245","author":"Han Wei","year":"2017","unstructured":"Wei Han, Daniel Mawhirter, Bo Wu, and Matthew Buland. 2017. Graphie: Large-scale asynchronous graph traversals on just a GPU. In 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 233--245."},{"key":"e_1_2_1_48_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TST.2016.7399279","article-title":"A comparative analysis on Weibo and Twitter","volume":"21","author":"Han Wentao","year":"2016","unstructured":"Wentao Han, Xiaowei Zhu, Ziyan Zhu, Wenguang Chen, Weimin Zheng, and Jianguo Lu. 2016. A comparative analysis on Weibo and Twitter. Tsinghua Science and Technology 21, 1 (2016), 1--16.","journal-title":"Tsinghua Science and Technology"},{"key":"e_1_2_1_49_1","volume-title":"Proc. 5th ACM Workshop on Social Network Mining and Analysis (SNA-KDD). ACM.","author":"Hern\u00e1ndez Cecilia","year":"2011","unstructured":"Cecilia Hern\u00e1ndez and Gonzalo Navarro. 2011. Compression of web and social graphs supporting neighbor and community queries. In Proc. 5th ACM Workshop on Social Network Mining and Analysis (SNA-KDD). ACM."},{"key":"e_1_2_1_50_1","volume-title":"Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, and Siu-Ming Yiu.","author":"Hon Wing-Kai","year":"2004","unstructured":"Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung, Wai-Leuk Tse, Chi-Kwong Wong, and Siu-Ming Yiu. 2004. Practical aspects of Compressed Suffix Arrays and FM-Index in Searching DNA Sequences.. In ALENEX\/ANALC. Citeseer, 31--38."},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"Huffman David A","year":"1952","unstructured":"David A Huffman. 1952. A method for the construction of minimum-redundancy codes. Proceedings of the IRE 40, 9 (1952), 1098--1101.","journal-title":"Proceedings of the IRE"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.14778\/3157794.3157799","article-title":"A distributed multi-gpu system for fast graph processing","volume":"11","author":"Jia Zhihao","year":"2017","unstructured":"Zhihao Jia, Yongkee Kwon, Galen Shipman, Pat McCormick, Mattan Erez, and Alex Aiken. 2017. A distributed multi-gpu system for fast graph processing. Proceedings of the VLDB Endowment 11, 3 (2017), 297--310.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_53_1","volume-title":"China Semantic Web Symposium and Web Science Conference. Springer, 50--61","author":"Jiang Xiaowei","year":"2013","unstructured":"Xiaowei Jiang, Xiang Zhang, Feifei Gao, Chunan Pu, and Peng Wang. 2013. Graph compression strategies for instance-focused semantic mining. In China Semantic Web Symposium and Web Science Conference. Springer, 50--61."},{"key":"e_1_2_1_54_1","volume-title":"authorities, and communities. ACM computing surveys (CSUR) 31, 4es","author":"Kleinberg Jon M","year":"1999","unstructured":"Jon M Kleinberg. 1999. Hubs, authorities, and communities. ACM computing surveys (CSUR) 31, 4es (1999), 5--es."},{"key":"e_1_2_1_55_1","volume-title":"Using triangles to improve community detection in directed networks. arXiv preprint arXiv:1404.5874","author":"Klymko Christine","year":"2014","unstructured":"Christine Klymko, David Gleich, and Tamara G Kolda. 2014. Using triangles to improve community detection in directed networks. arXiv preprint arXiv:1404.5874 (2014)."},{"key":"e_1_2_1_56_1","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"Kyrola Aapo","year":"2012","unstructured":"Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012. {GraphChi}:{Large-Scale} Graph Computation on Just a {PC}. In 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12). 31--46."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings 2003 VLDB Conference. Elsevier, 1125--1128","author":"Lakshmanan Laks VS","year":"2003","unstructured":"Laks VS Lakshmanan, Jian Pei, and Yan Zhao. 2003. Efficacious data cube exploration by semantic summarization and compression. In Proceedings 2003 VLDB Conference. Elsevier, 1125--1128."},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the 2003 ACM SIGMOD international conference on Management of data. 658--658","author":"Lakshmanan Laks VS","year":"2003","unstructured":"Laks VS Lakshmanan, Jian Pei, and Yan Zhao. 2003. Socqet: semantic olap with compressed cube and summarization. In Proceedings of the 2003 ACM SIGMOD international conference on Management of data. 658--658."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892708"},{"key":"e_1_2_1_60_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_61_1","volume-title":"International Conference on Mobile Ad-Hoc and Sensor Networks. Springer, 42--51","author":"Li Jinbao","year":"2005","unstructured":"Jinbao Li and Jianzhong Li. 2005. Data sampling control and compression in sensor networks. In International Conference on Mobile Ad-Hoc and Sensor Networks. Springer, 42--51."},{"key":"e_1_2_1_62_1","first-page":"1","article-title":"Data sampling control, compression and query in sensor networks","volume":"2","author":"Li Jinbao","year":"2007","unstructured":"Jinbao Li and Jianzhong Li. 2007. Data sampling control, compression and query in sensor networks. International Journal of Sensor Networks 2, 1--2 (2007), 53--61.","journal-title":"International Journal of Sensor Networks"},{"key":"e_1_2_1_63_1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.4236\/wsn.2011.32008","article-title":"Compressing information of target tracking in wireless sensor networks","volume":"3","author":"Li Jianzhong","year":"2011","unstructured":"Jianzhong Li, Qianqian Ren, et al. 2011. Compressing information of target tracking in wireless sensor networks. Wireless Sensor Network 3, 02 (2011), 73.","journal-title":"Wireless Sensor Network"},{"key":"e_1_2_1_64_1","first-page":"651","article-title":"Aggregation algorithms for very large compressed data warehouses","volume":"99","author":"Li Jianzhong","year":"1999","unstructured":"Jianzhong Li, Doron Rotem, and Jaideep Srivastava. 1999. Aggregation algorithms for very large compressed data warehouses. In VLDB, Vol. 99. 651--662.","journal-title":"VLDB"},{"key":"e_1_2_1_65_1","unstructured":"JZ Li Doron Rotem and Harry KT Wong. 1987. A new compression method with fast searching on large databases. (1987)."},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2002.1000340","article-title":"Efficient aggregation algorithms for compressed data warehouses","volume":"14","author":"Li Jianzhong","year":"2002","unstructured":"Jianzhong Li and Jaideep Srivastava. 2002. Efficient aggregation algorithms for compressed data warehouses. IEEE Transactions on Knowledge and Data Engineering 14, 3 (2002), 515--529.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2324-x"},{"key":"e_1_2_1_68_1","volume-title":"SC18: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 706--716","author":"Lin Heng","year":"2018","unstructured":"Heng Lin, Xiaowei Zhu, Bowen Yu, Xiongchao Tang, Wei Xue, Wenguang Chen, Lufei Zhang, Torsten Hoefler, Xiaosong Ma, Xin Liu, et al. 2018. Shentu: processing multi-trillion edge graphs on millions of cores in seconds. In SC18: International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 706--716."},{"key":"e_1_2_1_69_1","volume-title":"Proceedings of the 21st ACM international conference on Information and knowledge management. 2319--2322","author":"Liu Wei","year":"2012","unstructured":"Wei Liu, Andrey Kan, Jeffrey Chan, James Bailey, Christopher Leckie, Jian Pei, and Ramamohanarao Kotagiri. 2012. On compressing weighted time-evolving graphs. In Proceedings of the 21st ACM international conference on Information and knowledge management. 2319--2322."},{"key":"e_1_2_1_70_1","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1021\/ci990152h","article-title":"A compact form of the adjacency matrix","volume":"40","author":"Lukovits Istv\u00e1n","year":"2000","unstructured":"Istv\u00e1n Lukovits. 2000. A compact form of the adjacency matrix. Journal of chemical information and computer sciences 40, 5 (2000), 1147--1150.","journal-title":"Journal of chemical information and computer sciences"},{"key":"e_1_2_1_71_1","volume-title":"Proceedings of the Twelfth European Conference on Computer Systems. 527--543","author":"Maass Steffen","year":"2017","unstructured":"Steffen Maass, Changwoo Min, Sanidhya Kashyap, Woonhak Kang, Mohan Kumar, and Taesoo Kim. 2017. Mosaic: Processing a trillion-edge graph on a single machine. In Proceedings of the Twelfth European Conference on Computer Systems. 527--543."},{"key":"e_1_2_1_72_1","volume-title":"2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 109--120","author":"Maneth Sebastian","year":"2016","unstructured":"Sebastian Maneth and Fabian Peternek. 2016. Compressing graphs by grammars. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 109--120."},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.is.2018.03.002","article-title":"Grammar-based graph compression","volume":"76","author":"Maneth Sebastian","year":"2018","unstructured":"Sebastian Maneth and Fabian Peternek. 2018. Grammar-based graph compression. Information Systems 76 (2018), 19--45.","journal-title":"Information Systems"},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. 533--542","author":"Maserrat Hossein","year":"2010","unstructured":"Hossein Maserrat and Jian Pei. 2010. Neighbor query friendly compression of social networks. In Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. 533--542."},{"key":"e_1_2_1_75_1","volume-title":"2012 IEEE 12th International Conference on Data Mining. IEEE, 509--518","author":"Maserrat Hossein","year":"2012","unstructured":"Hossein Maserrat and Jian Pei. 2012. Community preserving lossy compression of social networks. In 2012 IEEE 12th International Conference on Data Mining. IEEE, 509--518."},{"key":"e_1_2_1_76_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2818185","article-title":"Thinking like a vertex: a survey of vertex-centric frameworks for large-scale distributed graph processing","volume":"48","author":"McCune Robert Ryan","year":"2015","unstructured":"Robert Ryan 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--39.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"e_1_2_1_77_1","volume-title":"15th Workshop on Hot Topics in Operating Systems (HotOS {XV}).","author":"McSherry Frank","year":"2015","unstructured":"Frank McSherry, Michael Isard, and Derek G Murray. 2015. Scalability! But at what {COST}?. In 15th Workshop on Hot Topics in Operating Systems (HotOS {XV})."},{"key":"e_1_2_1_78_1","volume-title":"SC'15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 1--12","author":"Nai Lifeng","year":"2015","unstructured":"Lifeng Nai, Yinglong Xia, Ilie G Tanase, Hyesoon Kim, and Ching-Yung Lin. 2015. GraphBIG: understanding graph computing in the context of industrial solutions. In SC'15: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE, 1--12."},{"key":"e_1_2_1_79_1","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.374","article-title":"Identifying hierarchical structure in sequences: A linear-time algorithm","volume":"7","author":"Nevill-Manning Craig G","year":"1997","unstructured":"Craig G Nevill-Manning and Ian H Witten. 1997. Identifying hierarchical structure in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research 7 (1997), 67--82.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"e_1_2_1_80_1","volume-title":"Proceedings DCC'97","author":"Nevill-Manning Craig G","year":"1997","unstructured":"Craig G Nevill-Manning and Ian H Witten. 1997. Linear-time, incremental hierarchy inference for compression. In Proceedings DCC'97. Data Compression Conference. IEEE, 3--11."},{"key":"e_1_2_1_81_1","volume-title":"Pthreads programming: A POXIS standard for better multiprocessing","author":"Nichols Bradford","unstructured":"Bradford Nichols, Dick Buttlar, and Jacqueline Proulx Farrell. 1996. Pthreads programming: A POXIS standard for better multiprocessing. Vol. 19. O'reilly Sebastopol, CA, USA."},{"key":"e_1_2_1_82_1","volume-title":"Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems","volume":"3","author":"Odemuyiwa Toluwanimi O.","year":"2023","unstructured":"Toluwanimi O. Odemuyiwa, Hadi Asghari-Moghaddam, Michael Pellauer, Kartik Hegde, Po-An Tsai, Neal C. Crago, Aamer Jaleel, John D. Owens, Edgar Solomonik, Joel S. Emer, and Christopher W. Fletcher. 2023. Accelerating Sparse Data Orchestration via Dynamic Reflexive Tiling. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3 (, Vancouver, BC, Canada,) (ASPLOS 2023). Association for Computing Machinery, New York, NY, USA, 18--32. 10.1145\/3582016.3582064"},{"key":"e_1_2_1_83_1","volume-title":"Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval. 273--282","author":"Ottaviano Giuseppe","year":"2014","unstructured":"Giuseppe Ottaviano and Rossano Venturini. 2014. Partitioned Elias-Fano Indexes. In Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval. 273--282."},{"key":"e_1_2_1_85_1","volume-title":"2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 479--490","author":"Pan Yuechao","year":"2017","unstructured":"Yuechao Pan, Yangzihao Wang, Yuduo Wu, Carl Yang, and John D Owens. 2017. Multi-GPU graph analytics. In 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS). IEEE, 479--490."},{"key":"e_1_2_1_86_1","volume-title":"2012 21st international conference on parallel architectures and compilation techniques (PACT). IEEE, 377--388","author":"Pekhimenko Gennady","year":"2012","unstructured":"Gennady Pekhimenko, Vivek Seshadri, Onur Mutlu, Michael A Kozuch, Phillip B Gibbons, and Todd C Mowry. 2012. Base-delta-immediate compression: Practical data compression for on-chip caches. In 2012 21st international conference on parallel architectures and compilation techniques (PACT). IEEE, 377--388."},{"key":"e_1_2_1_87_1","volume-title":"Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing (SNPD","volume":"1","author":"Ren Qianqian","year":"2007","unstructured":"Qianqian Ren, Jianzhong Li, and Jinbao Li. 2007. An efficient clustering-based method for data gathering and compressing in sensor networks. In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel\/Distributed Computing (SNPD 2007), Vol. 1. IEEE, 823--828."},{"key":"e_1_2_1_88_1","first-page":"1","article-title":"Graphzip: a clique-based sparse graph compression method","volume":"5","author":"Rossi Ryan A","year":"2018","unstructured":"Ryan A Rossi and Rong Zhou. 2018. Graphzip: a clique-based sparse graph compression method. Journal of Big Data 5, 1 (2018), 1--14.","journal-title":"Journal of Big Data"},{"key":"e_1_2_1_89_1","volume-title":"Proceedings of the 2019 International Conference on Management of Data. 775--792","author":"Sha Mo","year":"2019","unstructured":"Mo Sha, Yuchen Li, and Kian-Lee Tan. 2019. Gpu-based graph traversal on compressed graphs. In Proceedings of the 2019 International Conference on Management of Data. 775--792."},{"key":"e_1_2_1_90_1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.camwa.2011.07.060","article-title":"Optimizing K2 trees: A case for validating the maturity of network of practices","volume":"63","author":"Shi Quan","year":"2012","unstructured":"Quan Shi, Yanghua Xiao, Nik Bessis, Yiqi Lu, Yaoliang Chen, and Richard Hill. 2012. Optimizing K2 trees: A case for validating the maturity of network of practices. Computers & Mathematics with Applications 63, 2 (2012), 427--436.","journal-title":"Computers & Mathematics with Applications"},{"key":"e_1_2_1_91_1","volume-title":"Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming. 135--146","author":"Shun Julian","year":"2013","unstructured":"Julian Shun and Guy E Blelloch. 2013. Ligra: a lightweight graph processing framework for shared memory. In Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming. 135--146."},{"key":"e_1_2_1_92_1","volume-title":"2015 Data Compression Conference. IEEE, 403--412","author":"Shun Julian","year":"2015","unstructured":"Julian Shun, Laxman Dhulipala, and Guy E Blelloch. 2015. Smaller and faster: Parallel processing of compressed graphs with Ligra+. In 2015 Data Compression Conference. IEEE, 403--412."},{"key":"e_1_2_1_93_1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.24297\/ijct.v3i1c.2775","article-title":"Role of adjacency matrix & adjacency list in graph theory","volume":"3","author":"Singh Harmanjit","year":"2012","unstructured":"Harmanjit Singh and Richa Sharma. 2012. Role of adjacency matrix & adjacency list in graph theory. International Journal of Computers & Technology 3, 1 (2012), 179--183.","journal-title":"International Journal of Computers & Technology"},{"key":"e_1_2_1_94_1","first-page":"P06001","article-title":"Graph compression---save information by exploiting redundancy","volume":"2008","author":"Sun Jie","year":"2008","unstructured":"Jie Sun, Erik M Bollt, and Daniel Ben-Avraham. 2008. Graph compression---save information by exploiting redundancy. Journal of Statistical Mechanics: Theory and Experiment 2008, 06 (2008), P06001.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"key":"e_1_2_1_95_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 1, Article 90 (may","author":"Tan Hongshi","year":"2023","unstructured":"Hongshi Tan, Xinyu Chen, Yao Chen, Bingsheng He, and Weng-Fai Wong. 2023. LightRW: FPGA Accelerated Graph Dynamic Random Walks. Proc. ACM Manag. Data 1, 1, Article 90 (may 2023), 27 pages. 10.1145\/3588944"},{"key":"e_1_2_1_96_1","volume-title":"Proceedings of the 2016 International Conference on Management of Data. 1481--1496","author":"Tang Nan","year":"2016","unstructured":"Nan Tang, Qing Chen, and Prasenjit Mitra. 2016. Graph stream summarization: From big bang to big crunch. In Proceedings of the 2016 International Conference on Management of Data. 1481--1496."},{"key":"e_1_2_1_97_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 2, Article 143 (jun","author":"Wan Xinchen","year":"2023","unstructured":"Xinchen Wan, Kaiqiang Xu, Xudong Liao, Yilun Jin, Kai Chen, and Xin Jin. 2023. Scalable and Efficient Full-Graph GNN Training for Large Graphs. Proc. ACM Manag. Data 1, 2, Article 143 (jun 2023), 23 pages. 10.1145\/3589288"},{"key":"e_1_2_1_98_1","doi-asserted-by":"crossref","first-page":"853","DOI":"10.14778\/3090163.3090164","article-title":"MILC: Inverted list compression in memory","volume":"10","author":"Wang Jianguo","year":"2017","unstructured":"Jianguo Wang, Chunbin Lin, Ruining He, Moojin Chae, Yannis Papakonstantinou, and Steven Swanson. 2017. MILC: Inverted list compression in memory. Proceedings of the VLDB Endowment 10, 8 (2017), 853--864.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_99_1","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data. 993--1008","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 Proceedings of the 2017 ACM International Conference on Management of Data. 993--1008."},{"key":"e_1_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-2041-5"},{"key":"e_1_2_1_101_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 4, Article 246 (dec","author":"Wang Qiange","year":"2023","unstructured":"Qiange Wang, Yao Chen, Weng-Fai Wong, and Bingsheng He. 2023. HongTu: Scalable Full-Graph GNN Training on Multiple GPUs. Proc. ACM Manag. Data 1, 4, Article 246 (dec 2023), 27 pages. 10.1145\/3626733"},{"key":"e_1_2_1_102_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 4, Article 246 (dec","author":"Wang Qiange","year":"2023","unstructured":"Qiange Wang, Yao Chen, Weng-Fai Wong, and Bingsheng He. 2023. HongTu: Scalable Full-Graph GNN Training on Multiple GPUs. Proc. ACM Manag. Data 1, 4, Article 246 (dec 2023), 27 pages. 10.1145\/3626733"},{"key":"e_1_2_1_103_1","volume-title":"Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1--12","author":"Wang Yangzihao","year":"2016","unstructured":"Yangzihao Wang, Andrew Davidson, Yuechao Pan, Yuduo Wu, Andy Riffel, and John D Owens. 2016. Gunrock: A high-performance graph processing library on the GPU. In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 1--12."},{"key":"e_1_2_1_104_1","first-page":"10","volume-title":"Proc. ACM Manag. Data 1, 1, Article 34 (may","author":"Wang Zhibin","year":"2023","unstructured":"Zhibin Wang, Longbin Lai, Yixue Liu, Bing Shui, Chen Tian, and Sheng Zhong. 2023. I\/O-Efficient Butterfly Counting at Scale. Proc. ACM Manag. Data 1, 1, Article 34 (may 2023), 27 pages. 10.1145\/3588714"},{"key":"e_1_2_1_105_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-022-1546-2"},{"key":"e_1_2_1_106_1","volume-title":"Collective dynamics of 'small-world'networks. nature 393, 6684","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world'networks. nature 393, 6684 (1998), 440--442."},{"key":"e_1_2_1_107_1","volume-title":"Sparse matrix. https:\/\/en.wikipedia.org\/wiki\/Sparse_matrix. Accessed","author":"Contributors Wikipedia","year":"2023","unstructured":"Wikipedia Contributors. 2023. Sparse matrix. https:\/\/en.wikipedia.org\/wiki\/Sparse_matrix. Accessed: 2023."},{"key":"e_1_2_1_108_1","volume-title":"First international workshop on graph data management experiences and systems. 1--6.","author":"Xin Reynold S","year":"2013","unstructured":"Reynold S Xin, Joseph E Gonzalez, Michael J Franklin, and Ion Stoica. 2013. Graphx: A resilient distributed graph system on spark. In First international workshop on graph data management experiences and systems. 1--6."},{"key":"e_1_2_1_109_1","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1016\/j.jcss.2014.04.022","article-title":"A spatiotemporal compression based approach for efficient big data processing on cloud","volume":"80","author":"Yang Chi","year":"2014","unstructured":"Chi Yang, Xuyun Zhang, Changmin Zhong, Chang Liu, Jian Pei, Kotagiri Ramamohanarao, and Jinjun Chen. 2014. A spatiotemporal compression based approach for efficient big data processing on cloud. J. Comput. System Sci. 80, 8 (2014), 1563--1583.","journal-title":"J. Comput. System Sci."},{"key":"e_1_2_1_110_1","doi-asserted-by":"publisher","DOI":"10.14778\/3632093.3632094"},{"key":"e_1_2_1_111_1","volume-title":"Large-Scale Graph Label Propagation on GPUs","author":"Ye Chang","year":"2023","unstructured":"Chang Ye, Yuchen Li, Bingsheng He, Zhao Li, and Jianling Sun. 2023. Large-Scale Graph Label Propagation on GPUs. IEEE Transactions on Knowledge and Data Engineering (2023)."},{"key":"e_1_2_1_112_1","doi-asserted-by":"crossref","first-page":"1522","DOI":"10.14778\/3236187.3236203","article-title":"Efficient document analytics on compressed data: Method, challenges, algorithms, insights","volume":"11","author":"Zhang Feng","year":"2018","unstructured":"Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Wenguang Chen. 2018. Efficient document analytics on compressed data: Method, challenges, algorithms, insights. Proceedings of the VLDB Endowment 11, 11 (2018), 1522--1535.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_113_1","volume-title":"Proceedings of the 2018 International Conference on Supercomputing. 195--206","author":"Zhang Feng","year":"2018","unstructured":"Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Wenguang Chen. 2018. Zwift: A programming framework for high performance text analytics on compressed data. In Proceedings of the 2018 International Conference on Supercomputing. 195--206."},{"key":"e_1_2_1_114_1","volume-title":"2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 1069--1080","author":"Zhang Feng","year":"2020","unstructured":"Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Xiaoyong Du. 2020. Enabling efficient random access to hierarchically-compressed data. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 1069--1080."},{"key":"e_1_2_1_115_1","volume-title":"POCLib: A high-performance framework for enabling near orthogonal processing on compression","author":"Zhang Feng","year":"2022","unstructured":"Feng Zhang, Jidong Zhai, Xipeng Shen, Onur Mutlu, and Xiaoyong Du. 2022. POCLib: A high-performance framework for enabling near orthogonal processing on compression. IEEE transactions on Parallel and Distributed Systems 33, 2 (2022), 459--475."},{"key":"e_1_2_1_116_1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s00778-020-00636-3","article-title":"TADOC: Text analytics directly on compression","volume":"30","author":"Zhang Feng","year":"2021","unstructured":"Feng Zhang, Jidong Zhai, Xipeng Shen, Dalin Wang, Zheng Chen, Onur Mutlu, Wenguang Chen, and Xiaoyong Du. 2021. TADOC: Text analytics directly on compression. The VLDB Journal 30, 2 (2021), 163--188.","journal-title":"The VLDB Journal"},{"key":"e_1_2_1_117_1","volume-title":"Automatic irregularity-aware fine-grained workload partitioning on integrated architectures","author":"Zhang Feng","year":"2019","unstructured":"Feng Zhang, Jidong Zhai, Bo Wu, Bingsheng He, Wenguang Chen, and Xiaoyong Du. 2019. Automatic irregularity-aware fine-grained workload partitioning on integrated architectures. IEEE Transactions on Knowledge and Data Engineering (2019)."},{"key":"e_1_2_1_118_1","volume-title":"Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 2818--2830","author":"Zhou Amelie Chi","year":"2022","unstructured":"Amelie Chi Zhou, Juanyun Luo, Ruibo Qiu, Haobin Tan, Bingsheng He, and Rui Mao. 2022. Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 2818--2830."},{"key":"e_1_2_1_119_1","volume-title":"Gemini: A computation-centric distributed graph processing system. In 12th {USENIX} symposium on operating systems design and implementation ({OSDI} 16). 301--316.","author":"Zhu Xiaowei","year":"2016","unstructured":"Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A computation-centric distributed graph processing system. In 12th {USENIX} symposium on operating systems design and implementation ({OSDI} 16). 301--316."},{"key":"e_1_2_1_120_1","volume-title":"Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In 2015 {USENIX} Annual Technical Conference ({USENIX}{ATC } 15). 375--386.","author":"Zhu Xiaowei","year":"2015","unstructured":"Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015. Gridgraph: Large-scale graph processing on a single machine using 2-level hierarchical partitioning. In 2015 {USENIX} Annual Technical Conference ({USENIX}{ATC } 15). 375--386."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3665844.3665852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T22:26:44Z","timestamp":1722983204000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3665844.3665852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":118,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.14778\/3665844.3665852"],"URL":"https:\/\/doi.org\/10.14778\/3665844.3665852","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"2024-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}