{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T08:04:06Z","timestamp":1768032246665,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":91,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1145\/3243176.3243198","type":"proceedings-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T13:32:32Z","timestamp":1539178352000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Log(graph)"],"prefix":"10.1145","author":[{"given":"Maciej","family":"Besta","sequence":"first","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Stanojevic","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tijana","family":"Zivic","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jagpreet","family":"Singh","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Hoerold","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"DYNAMIC\n  : a succinct and compressed dynamic data structures library.  DYNAMIC: a succinct and compressed dynamic data structures library."},{"key":"e_1_3_2_1_2_1","unstructured":"Sux - Implementing Succinct Data Structures. available at: http:\/\/sux.dsi.unimi.it.  Sux - Implementing Succinct Data Structures. available at: http:\/\/sux.dsi.unimi.it."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875027"},{"key":"e_1_3_2_1_4_1","volume-title":"NSDI","author":"Agarwal R.","year":"2015","unstructured":"R. Agarwal , A. Khandelwal , and I. Stoica . Succinct: Enabling Qeries on Compressed Data . NSDI , 2015 . R. Agarwal, A. Khandelwal, and I. Stoica. Succinct: Enabling Qeries on Compressed Data. NSDI, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2016.10.002"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006796"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69733-6_1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2005.55"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781574.1781612"},{"key":"e_1_3_2_1_10_1","volume-title":"Direction-optimizing breadth-first search. SC","author":"Beamer S.","year":"2012","unstructured":"S. Beamer , K. Asanovic , and D. Patterson . Direction-optimizing breadth-first search. SC , 2012 . S. Beamer, K. Asanovic, and D. Patterson. Direction-optimizing breadth-first search. SC, 2012."},{"key":"e_1_3_2_1_11_1","volume-title":"The GAP benchmark suite. arXiv preprint arXiv:1508.03619","author":"Beamer S.","year":"2015","unstructured":"S. Beamer , K. Asanovic , and D. Patterson . The GAP benchmark suite. arXiv preprint arXiv:1508.03619 , 2015 . S. Beamer, K. Asanovic, and D. Patterson. The GAP benchmark suite. arXiv preprint arXiv:1508.03619, 2015."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749263"},{"key":"e_1_3_2_1_13_1","volume-title":"Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799","author":"Besta M.","year":"2018","unstructured":"M. Besta and T. Hoefler . Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799 , 2018 . M. Besta and T. Hoefler. Survey and taxonomy of lossless graph compression and space-efficient graph representations. arXiv preprint arXiv:1806.01799, 2018."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.93"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078616"},{"key":"e_1_3_2_1_16_1","volume-title":"SODA","author":"Blandford D. K.","year":"2003","unstructured":"D. K. Blandford , G. E. Blelloch , and I. A. Kash . Compact Representations of Separable Graphs . SODA , 2003 . D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact Representations of Separable Graphs. SODA, 2003."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-642-13509-5_13","volume-title":"Combinatorial Pattern Matching","author":"Blelloch G.","year":"2010","unstructured":"G. Blelloch and A. Farzan . Succinct representations of separable graphs . In A. Amir and L. Parida, editors, Combinatorial Pattern Matching , volume 6129 of Lecture Notes in Computer Science , pages 138 -- 150 . Springer Berlin Heidelberg , 2010 . G. Blelloch and A. Farzan. Succinct representations of separable graphs. In A. Amir and L. Parida, editors, Combinatorial Pattern Matching, volume 6129 of Lecture Notes in Computer Science, pages 138--150. Springer Berlin Heidelberg, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_20_1","volume-title":"A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163--177","author":"Brandes U.","year":"2001","unstructured":"U. Brandes . A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163--177 , 2001 . U. Brandes. A faster algorithm for betweenness centrality. Journal of mathematical sociology, 25(2):163--177, 2001."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03784-9_3"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.08.003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795294165"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342011403516"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2014.06.016"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020513"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063747"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778666.1778677"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89097-3_18"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2167962.2167967"},{"key":"e_1_3_2_1_33_1","unstructured":"Daisuke Okanohara. rsdic - Compressed Rank Select Dictionary. available at: http:\/\/code.google.com\/p\/rsdic.  Daisuke Okanohara. rsdic - Compressed Rank Select Dictionary. available at: http:\/\/code.google.com\/p\/rsdic."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498761"},{"key":"e_1_3_2_1_35_1","volume-title":"Advanced Data Structures","author":"Demaine E.","year":"2012","unstructured":"E. Demaine . Advanced Data Structures , 2012 . Lecture Notes . E. Demaine. Advanced Data Structures, 2012. Lecture Notes."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/074","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge","author":"Demetrescu C.","year":"2009","unstructured":"C. Demetrescu , A. V. Goldberg , and D. S. Johnson . The Shortest Path Problem: Ninth DIMACS Implementation Challenge , volume 74 . American Math. Soc ., 2009 . C. Demetrescu, A. V. Goldberg, and D. S. Johnson. The Shortest Path Problem: Ninth DIMACS Implementation Challenge, volume 74. American Math. Soc., 2009."},{"key":"e_1_3_2_1_37_1","volume-title":"ZLIB Compressed Data Format Specification","author":"Deutsch P.","year":"1996","unstructured":"P. Deutsch and J.-L. Gailly . ZLIB Compressed Data Format Specification , 1996 . P. Deutsch and J.-L. Gailly. ZLIB Compressed Data Format Specification, 1996."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"e_1_3_2_1_39_1","first-page":"482","article-title":"On the evolution of random graphs","volume":"2","author":"Erd\u00f6s P.","year":"1976","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi . On the evolution of random graphs . Selected Papers of Alfr\u00e9d R\u00e9nyi , 2 : 482 -- 525 , 1976 . P. Erd\u00f6s and A. R\u00e9nyi. On the evolution of random graphs. Selected Papers of Alfr\u00e9d R\u00e9nyi, 2:482--525, 1976.","journal-title":"Selected Papers of Alfr\u00e9d R\u00e9nyi"},{"key":"e_1_3_2_1_40_1","volume-title":"SC, page 103","author":"Faanes G.","year":"2012","unstructured":"G. Faanes , A. Bataineh , D. Roweth , T. Court , E. Froese , R. Alverson , T. Johnson , J. Kopnick , M. Higgins , and J. Reinhard . Cray cascade: a scalable HPC system based on a Dragonfly network . In SC, page 103 . IEEE\/ACM , 2012 . G. Faanes, A. Bataineh, D. Roweth, T. Court, E. Froese, R. Alverson, T. Johnson, J. Kopnick, M. Higgins, and J. Reinhard. Cray cascade: a scalable HPC system based on a Dragonfly network. In SC, page 103. IEEE\/ACM, 2012."},{"key":"e_1_3_2_1_41_1","unstructured":"Francisco Claude. libcds. https:\/\/github.com\/fclaude\/libcds.  Francisco Claude. libcds. https:\/\/github.com\/fclaude\/libcds."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178504"},{"key":"e_1_3_2_1_43_1","unstructured":"Giuseppe Ottaviano. Succinct library. https:\/\/github.com\/ot\/succinct.  Giuseppe Ottaviano. Succinct library. https:\/\/github.com\/ot\/succinct."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2198"},{"key":"e_1_3_2_1_46_1","volume-title":"Poster Proceedings","volume":"38","author":"Gonzalez R.","year":"2005","unstructured":"R. Gonzalez , S. Grabowski , V. Makinen , and G. Navarro . Practical implementation of rank and select queries . In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA), pages 27-- 38 , 2005 . R. Gonzalez, S. Grabowski, V. Makinen, and G. Navarro. Practical implementation of rank and select queries. In Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA), pages 27--38, 2005."},{"key":"e_1_3_2_1_47_1","volume-title":"KTH","author":"Granlund T.","year":"2012","unstructured":"T. Granlund . Instruction latencies and throughput for AMD and Intel x86 Processors. Technical report , KTH , 2012 . T. Granlund. Instruction latencies and throughput for AMD and Intel x86 Processors. Technical report, KTH, 2012."},{"key":"e_1_3_2_1_48_1","volume-title":"The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2","author":"Gregor D.","year":"2005","unstructured":"D. Gregor and A. Lumsdaine . The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2 , 2005 . D. Gregor and A. Lumsdaine. The parallel BGL: A generic library for distributed graph computations. Parallel Object-Oriented Scientific Computing (POOSC), page 2, 2005."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_3"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34109-0_28"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151013"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63533"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283445"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137825"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2008.19"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250759"},{"key":"e_1_3_2_1_59_1","first-page":"830","volume-title":"SC16: International Conference for","author":"Kumar P.","year":"2016","unstructured":"P. Kumar and H. H. Huang . G-store: high-performance graph store for trillionedge processing. In High Performance Computing, Networking, Storage and Analysis , SC16: International Conference for , pages 830 -- 841 . IEEE, 2016 . P. Kumar and H. H. Huang. G-store: high-performance graph store for trillionedge processing. In High Performance Computing, Networking, Storage and Analysis, SC16: International Conference for, pages 830--841. IEEE, 2016."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_61_1","volume-title":"Algorithms and compressed data structures for information retrieval","author":"Ladra S.","year":"2011","unstructured":"S. Ladra . Algorithms and compressed data structures for information retrieval . 2011 . S. Ladra. Algorithms and compressed data structures for information retrieval. 2011."},{"key":"e_1_3_2_1_62_1","volume-title":"Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research, 11(Feb):985--1042","author":"Leskovec J.","year":"2010","unstructured":"J. Leskovec , D. Chakrabarti , J. Kleinberg , C. Faloutsos , and Z. Ghahramani . Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research, 11(Feb):985--1042 , 2010 . J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani. Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research, 11(Feb):985--1042, 2010."},{"key":"e_1_3_2_1_63_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data 2014.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data 2014."},{"key":"e_1_3_2_1_64_1","volume-title":"Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990","author":"Low Y.","year":"2010","unstructured":"Y. Low , J. Gonzalez , A. Kyrola , D. Bickson , C. Guestrin , and J. M. Hellerstein . Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990 , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. Graphlab: A new framework for parallel machine learning. preprint arXiv:1006.4990, 2010."},{"key":"e_1_3_2_1_65_1","volume-title":"Challenges in Parallel Graph Processing. Par. Proc. Let.","author":"Lumsdaine A.","year":"2007","unstructured":"A. Lumsdaine , D. Gregor , B. Hendrickson , and J. W. Berry . Challenges in Parallel Graph Processing. Par. Proc. Let. , 2007 . A. Lumsdaine, D. Gregor, B. Hendrickson, and J. W. Berry. Challenges in Parallel Graph Processing. Par. Proc. Let., 2007."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791191"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161100"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_69_1","volume-title":"Grammar-based graph compression. arXiv preprint arXiv:1704.05254","author":"Maneth S.","year":"2017","unstructured":"S. Maneth and F. Peternek . Grammar-based graph compression. arXiv preprint arXiv:1704.05254 , 2017 . S. Maneth and F. Peternek. Grammar-based graph compression. arXiv preprint arXiv:1704.05254, 2017."},{"key":"e_1_3_2_1_70_1","volume-title":"Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393","author":"Mattson T.","year":"2014","unstructured":"T. Mattson , D. Bader , J. Berry , A. Buluc , J. Dongarra , C. Faloutsos , J. Feo , J. Gilbert , J. Gonzalez , B. Hendrickson , J. Kepner , C. Leiserson , A. Lumsdaine , D. Padua , S. Poole , S. Reinhardt , M. Stonebraker , S. Wallach , and A. Yoo . Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393 , 2014 . T. Mattson, D. Bader, J. Berry, A. Buluc, J. Dongarra, C. Faloutsos, J. Feo, J. Gilbert, J. Gonzalez, B. Hendrickson, J. Kepner, C. Leiserson, A. Lumsdaine, D. Padua, S. Poole, S. Reinhardt, M. Stonebraker, S. Wallach, and A. Yoo. Standards for graph algorithm primitives. arXiv preprint arXiv:1408.0393, 2014."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799364092"},{"key":"e_1_3_2_1_73_1","volume-title":"Introducing the graph 500","author":"Murphy R. C.","year":"2010","unstructured":"R. C. Murphy , K. B. Wheeler , B. W. Barrett , and J. A. Ang . Introducing the graph 500 . Cray User's Group (CUG) , 2010 . R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang. Introducing the graph 500. Cray User's Group (CUG), 2010."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791194"},{"key":"e_1_3_2_1_77_1","first-page":"405","volume-title":"Data Engineering, 2003. Proceedings. 19th International Conference on","author":"Raghavan S.","year":"2003","unstructured":"S. Raghavan and H. Garcia-Molina . Representing web graphs . In Data Engineering, 2003. Proceedings. 19th International Conference on , pages 405 -- 416 . IEEE, 2003 . S. Raghavan and H. Garcia-Molina. Representing web graphs. In Data Engineering, 2003. Proceedings. 19th International Conference on, pages 405--416. IEEE, 2003."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290680"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.5555\/882455.874988"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/CloudCom.2010.17"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.7"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517327.2442530"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.8"},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126908.3126971"},{"key":"e_1_3_2_1_86_1","volume-title":"Compressing networks with super nodes. arXiv preprint arXiv:1706.04110","author":"Stanley N.","year":"2017","unstructured":"N. Stanley , R. Kwitt , M. Niethammer , and P. J. Mucha . Compressing networks with super nodes. arXiv preprint arXiv:1706.04110 , 2017 . N. Stanley, R. Kwitt, M. Niethammer, and P. J. Mucha. Compressing networks with super nodes. arXiv preprint arXiv:1706.04110, 2017."},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.5555\/882454.875028"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376675"},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788900"},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915220"},{"key":"e_1_3_2_1_91_1","first-page":"669","volume-title":"NSDI","author":"Xiao W.","year":"2017","unstructured":"W. Xiao , J. Xue , Y. Miao , Z. Li , C. Chen , M. Wu , W. Li , and L. Zhou . Tux2: Distributed graph computation for machine learning . In NSDI , pages 669 -- 682 , 2017 . W. Xiao, J. Xue, Y. Miao, Z. Li, C. Chen, M. Wu, W. Li, and L. Zhou. Tux2: Distributed graph computation for machine learning. In NSDI, pages 669--682, 2017."},{"key":"e_1_3_2_1_92_1","first-page":"2","volume-title":"Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12","author":"Zaharia M.","year":"2012","unstructured":"M. Zaharia , M. Chowdhury , T. Das , A. Dave , J. Ma , M. McCauley , M. J. Franklin , S. Shenker , and I. Stoica . Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing . In Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12 , pages 2 -- 2 , Berkeley, CA, USA , 2012 . USENIX Association. M. Zaharia, M. Chowdhury, T. Das, A. Dave, J. Ma, M. McCauley, M. J. Franklin, S. Shenker, and I. Stoica. Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing. In Proc. of the USENIX Conf. on Net. Sys. Design and Impl., NSDI'12, pages 2--2, Berkeley, CA, USA, 2012. USENIX Association."},{"key":"e_1_3_2_1_93_1","first-page":"301","volume-title":"OSDI","author":"Zhu X.","year":"2016","unstructured":"X. Zhu , W. Chen , W. Zheng , and X. Ma . Gemini: A computation-centric distributed graph processing system . In OSDI , pages 301 -- 316 , 2016 . X. Zhu, W. Chen, W. Zheng, and X. Ma. Gemini: A computation-centric distributed graph processing system. In OSDI, pages 301--316, 2016."}],"event":{"name":"PACT '18: International conference on Parallel Architectures and Compilation Techniques","location":"Limassol Cyprus","acronym":"PACT '18","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IFIP WG 10.3 IFIP WG 10.3","IEEE CS"]},"container-title":["Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243198","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243176.3243198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:39Z","timestamp":1750208259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243176.3243198"}},"subtitle":["a near-optimal high-performance graph representation"],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":91,"alternative-id":["10.1145\/3243176.3243198","10.1145\/3243176"],"URL":"https:\/\/doi.org\/10.1145\/3243176.3243198","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]},"assertion":[{"value":"2018-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}