{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:14:23Z","timestamp":1779174863346,"version":"3.51.4"},"reference-count":61,"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":[[2023,5]]},"abstract":"<jats:p>This paper presents MiniGraph, an out-of-core system for querying big graphs with a single machine. As opposed to previous single-machine graph systems, MiniGraph proposes a pipelined architecture to overlap I\/O and CPU operations, and improves multi-core parallelism. It also introduces a hybrid model to support both vertex-centric and graph-centric parallel computations, to simplify parallel graph programming, speed up beyond-neighborhood computations, and parallelize computations within each subgraph. The model induces a two-level parallel execution model to explore both inter-subgraph and intra-subgraph parallelism. Moreover, MiniGraph develops new optimization techniques under its architecture. Using real-life graphs of different types, we show that MiniGraph is up to 76.1x faster than prior out-of-core systems, and performs better than some multi-machine systems that use up to 12 machines.<\/jats:p>","DOI":"10.14778\/3598581.3598590","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T22:19:06Z","timestamp":1689027546000},"page":"2172-2185","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["MiniGraph: Querying Big Graphs with a Single Machine"],"prefix":"10.14778","volume":"16","author":[{"given":"Xiaoke","family":"Zhu","sequence":"first","affiliation":[{"name":"Beihang University, China and Shenzhen Institute of Computing Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Beihang University, China and Shenzhen Institute of Computing Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuhao","family":"Liu","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenfei","family":"Fan","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, China and University of Edinburgh, United Kingdom and Beihang University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2020. GraphScope. Retrieved May 1 2023 from https:\/\/graphscope.io  2020. GraphScope. Retrieved May 1 2023 from https:\/\/graphscope.io"},{"key":"e_1_2_1_2_1","volume-title":"Apache Spark Partition Strategy. Retrieved","year":"2023","unstructured":"2022. Apache Spark Partition Strategy. Retrieved May 1, 2023 from https:\/\/spark.apache.org\/docs\/1.4.0\/api\/java\/org\/apache\/spark\/graphx\/PartitionStrategy.RandomVertexCut$.html 2022. Apache Spark Partition Strategy. Retrieved May 1, 2023 from https:\/\/spark.apache.org\/docs\/1.4.0\/api\/java\/org\/apache\/spark\/graphx\/PartitionStrategy.RandomVertexCut$.html"},{"key":"e_1_2_1_3_1","volume-title":"Friendster dataset. Retrieved","year":"2023","unstructured":"2022. Friendster dataset. Retrieved May 1, 2023 from https:\/\/snap.stanford.edu\/data\/com-Friendster.html 2022. Friendster dataset. Retrieved May 1, 2023 from https:\/\/snap.stanford.edu\/data\/com-Friendster.html"},{"key":"e_1_2_1_4_1","volume-title":"Full version. Retrieved","year":"2023","unstructured":"2023. Full version. Retrieved May 1, 2023 from https:\/\/shuhaoliu.github.io\/assets\/papers\/minigraph-full.pdf 2023. Full version. Retrieved May 1, 2023 from https:\/\/shuhaoliu.github.io\/assets\/papers\/minigraph-full.pdf"},{"key":"e_1_2_1_5_1","volume-title":"Graph500 specifications. Retrieved","year":"2023","unstructured":"2023. Graph500 specifications. Retrieved May 1, 2023 from https:\/\/graph500.org 2023. Graph500 specifications. Retrieved May 1, 2023 from https:\/\/graph500.org"},{"key":"e_1_2_1_6_1","unstructured":"2023. Hyperlink. Retrieved May 1 2023 from http:\/\/webdatacommons.org\/hyperlinkgraph\/  2023. Hyperlink. Retrieved May 1 2023 from http:\/\/webdatacommons.org\/hyperlinkgraph\/"},{"key":"e_1_2_1_7_1","volume-title":"LDBC dataset. Retrieved","year":"2023","unstructured":"2023. LDBC dataset. Retrieved May 1, 2023 from https:\/\/graphalytics.org\/datasets 2023. LDBC dataset. Retrieved May 1, 2023 from https:\/\/graphalytics.org\/datasets"},{"key":"e_1_2_1_8_1","unstructured":"2023. Timely Dataflow. Retrieved May 1 2023 from https:\/\/github.com\/frankmcsherry\/timely-dataflow  2023. Timely Dataflow. Retrieved May 1 2023 from https:\/\/github.com\/frankmcsherry\/timely-dataflow"},{"key":"e_1_2_1_9_1","unstructured":"Zhiyuan Ai Mingxing Zhang Yongwei Wu Xuehai Qian Kang Chen and Weimin Zheng. 2017. Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk I\/O. In USENIX ATC. 125--137.  Zhiyuan Ai Mingxing Zhang Yongwei Wu Xuehai Qian Kang Chen and Weimin Zheng. 2017. Squeezing out all the value of loaded data: An out-of-core graph processing system with reduced disk I\/O. In USENIX ATC. 125--137."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"e_1_2_1_12_1","first-page":"1","article-title":"Incremental gradient, subgradient, and proximal methods for convex optimization: A survey","volume":"2010","author":"Bertsekas Dimitri P","year":"2011","unstructured":"Dimitri P Bertsekas 2011 . Incremental gradient, subgradient, and proximal methods for convex optimization: A survey . Optimization for Machine Learning 2010 , 1 -- 38 (2011), 3. Dimitri P Bertsekas et al. 2011. Incremental gradient, subgradient, and proximal methods for convex optimization: A survey. Optimization for Machine Learning 2010, 1--38 (2011), 3.","journal-title":"Optimization for Machine Learning"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Florian Bourse Marc Lelarge and Milan Vojnovic. 2014. Balanced graph edge partition. In SIGKDD. 1456--1465.  Florian Bourse Marc Lelarge and Milan Vojnovic. 2014. Balanced graph edge partition. In SIGKDD. 1456--1465.","DOI":"10.1145\/2623330.2623660"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.10.007"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298989"},{"key":"e_1_2_1_16_1","volume-title":"Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics. In PLDI. 752--768.","author":"Dathathri Roshan","year":"2018","unstructured":"Roshan Dathathri , Gurbinder Gill , Loc Hoang , Hoang-Vu Dang , Alex Brooks , Nikoli Dryden , Marc Snir , and Keshav Pingali . 2018 . Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics. In PLDI. 752--768. Roshan Dathathri, Gurbinder Gill, Loc Hoang, Hoang-Vu Dang, Alex Brooks, Nikoli Dryden, Marc Snir, and Keshav Pingali. 2018. Gluon: A Communication-Optimizing Substrate for Distributed Heterogeneous Graph Analytics. In PLDI. 752--768."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554899"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476369"},{"key":"e_1_2_1_19_1","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 SIGMOD. 1765--1779.  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 SIGMOD. 1765--1779."},{"key":"e_1_2_1_20_1","unstructured":"Wenfei Fan Jingbo Xu Yinghui Wu Wenyuan Yu Jiaxin Jiang Bohan Zhang Zeyu Zheng Yang Cao and Chao Tian. 2017. Parallelizing Sequential Graph Computations. In SIGMOD. 495--510.  Wenfei Fan Jingbo Xu Yinghui Wu Wenyuan Yu Jiaxin Jiang Bohan Zhang Zeyu Zheng Yang Cao and Chao Tian. 2017. Parallelizing Sequential Graph Computations. In SIGMOD. 495--510."},{"key":"e_1_2_1_21_1","volume-title":"Article 18","author":"Fan Wenfei","year":"2018","unstructured":"Wenfei Fan , Wenyuan Yu , Jingbo Xu , Jingren Zhou , XiaoJian Luo , Qiang Yin , Ping Lu , Yang Cao , and Ruiqi Xu. 2018. Parallelizing Sequential Graph Computations. TODS 43, 4 , Article 18 ( 2018 ), 39 pages. Wenfei Fan, Wenyuan Yu, Jingbo Xu, Jingren Zhou, XiaoJian Luo, Qiang Yin, Ping Lu, Yang Cao, and Ruiqi Xu. 2018. Parallelizing Sequential Graph Computations. TODS 43, 4, Article 18 (2018), 39 pages."},{"key":"e_1_2_1_22_1","volume-title":"A distributed vertex-centric approach for pattern matching in massive graphs","author":"Fard Arash","unstructured":"Arash Fard , M. Usman Nisar , Lakshmish Ramaswamy , John A. Miller , and Matthew Saltz . 2013. A distributed vertex-centric approach for pattern matching in massive graphs . In IEEE BigData . 403--411. Arash Fard, M. Usman Nisar, Lakshmish Ramaswamy, John A. Miller, and Matthew Saltz. 2013. A distributed vertex-centric approach for pattern matching in massive graphs. In IEEE BigData. 403--411."},{"key":"e_1_2_1_23_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey Michael","unstructured":"Michael Garey and David Johnson . 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company . Michael Garey and David Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389145"},{"key":"e_1_2_1_25_1","unstructured":"Joseph E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI. 17--30.  Joseph E. Gonzalez Yucheng Low Haijie Gu Danny Bickson and Carlos Guestrin. 2012. PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs. In OSDI. 17--30."},{"key":"e_1_2_1_26_1","unstructured":"Robert Grandl Mosharaf Chowdhury Aditya Akella and Ganesh Ananthanarayanan. 2016. Altruistic Scheduling in Multi-Resource Clusters. In OSDI. 65--80.  Robert Grandl Mosharaf Chowdhury Aditya Akella and Ganesh Ananthanarayanan. 2016. Altruistic Scheduling in Multi-Resource Clusters. In OSDI. 65--80."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777604"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/362248.362272"},{"key":"e_1_2_1_29_1","volume-title":"A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865","author":"Hu Pili","year":"2013","unstructured":"Pili Hu and Wing Cheong Lau . 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865 ( 2013 ). Pili Hu and Wing Cheong Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865 (2013)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.11.004"},{"key":"e_1_2_1_33_1","unstructured":"Aapo Kyrola Guy Blelloch and Carlos Guestrin. 2012. GraphChi: Large-scale graph computation on just a PC. In OSDI. 31--46.  Aapo Kyrola Guy Blelloch and Carlos Guestrin. 2012. GraphChi: Large-scale graph computation on just a PC. In OSDI. 31--46."},{"key":"e_1_2_1_36_1","volume-title":"Garaph: Efficient GPU-accelerated Graph Processing on a Single Machine with Balanced Replication. In USENIX ATC. 195--207.","author":"Ma Lingxiao","year":"2017","unstructured":"Lingxiao Ma , Zhi Yang , Han Chen , Jilong Xue , and Yafei Dai . 2017 . Garaph: Efficient GPU-accelerated Graph Processing on a Single Machine with Balanced Replication. In USENIX ATC. 195--207. Lingxiao Ma, Zhi Yang, Han Chen, Jilong Xue, and Yafei Dai. 2017. Garaph: Efficient GPU-accelerated Graph Processing on a Single Machine with Balanced Replication. In USENIX ATC. 195--207."},{"key":"e_1_2_1_37_1","volume-title":"Mosaic: Processing a trillion-edge graph on a single machine. In EuroSys. 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 EuroSys. 527--543. 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 EuroSys. 527--543."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_2_1_39_1","unstructured":"Frank McSherry Michael Isard and Derek Gordon Murray. 2015. Scalability! But at what COST?. In HotOS. 14--19.  Frank McSherry Michael Isard and Derek Gordon Murray. 2015. Scalability! But at what COST?. In HotOS. 14--19."},{"key":"e_1_2_1_40_1","volume-title":"Communication and Concurrency","author":"Milner Robin","unstructured":"Robin Milner . 1989. Communication and Concurrency . Prentice Hall . Robin Milner. 1989. Communication and Concurrency. Prentice Hall."},{"key":"e_1_2_1_41_1","volume-title":"The End of Xeon Phi - It's Xeon and Maybe GPUs From Here. Retrieved","author":"Morgan Timothy Prickett","year":"2023","unstructured":"Timothy Prickett Morgan . 2018. The End of Xeon Phi - It's Xeon and Maybe GPUs From Here. Retrieved May 1, 2023 from https:\/\/www.nextplatform.com\/2018\/07\/27\/end-of-the-line-for-xeon-phi-its-all-xeon-from-here\/ Timothy Prickett Morgan. 2018. The End of Xeon Phi - It's Xeon and Maybe GPUs From Here. Retrieved May 1, 2023 from https:\/\/www.nextplatform.com\/2018\/07\/27\/end-of-the-line-for-xeon-phi-its-all-xeon-from-here\/"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Donald Nguyen Andrew Lenharth and Keshav Pingali. 2013. A lightweight infrastructure for graph analytics. In SOSP. 456--471.  Donald Nguyen Andrew Lenharth and Keshav Pingali. 2013. A lightweight infrastructure for graph analytics. In SOSP. 456--471.","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Fatemeh Rahimian Amir H. Payberah Sarunas Girdzijauskas and Seif Haridi. 2014. Distributed Vertex-Cut Partitioning. In DAIS. 186--200.  Fatemeh Rahimian Amir H. Payberah Sarunas Girdzijauskas and Seif Haridi. 2014. Distributed Vertex-Cut Partitioning. In DAIS. 186--200.","DOI":"10.1007\/978-3-662-43352-2_15"},{"key":"e_1_2_1_45_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K . Ahmed . 2015 . The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293. Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. 4292--4293."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522740"},{"key":"e_1_2_1_47_1","volume-title":"Blelloch","author":"Shun Julian","year":"2013","unstructured":"Julian Shun and Guy E . Blelloch . 2013 . Ligra : A lightweight graph processing framework for shared memory. In SIGPLAN. 135--146. Julian Shun and Guy E. Blelloch. 2013. Ligra: A lightweight graph processing framework for shared memory. In SIGPLAN. 135--146."},{"key":"e_1_2_1_48_1","volume-title":"Intel To Wind Down Optane Memory Business - 3D XPoint Storage Tech Reaches Its End. Retrieved","author":"Smith Ryan","year":"2023","unstructured":"Ryan Smith . 2022. Intel To Wind Down Optane Memory Business - 3D XPoint Storage Tech Reaches Its End. Retrieved May 1, 2023 from https:\/\/www.anandt.ech.com\/show\/17515\/intel-to-wind-down-optane-memory-business Ryan Smith. 2022. Intel To Wind Down Optane Memory Business - 3D XPoint Storage Tech Reaches Its End. Retrieved May 1, 2023 from https:\/\/www.anandt.ech.com\/show\/17515\/intel-to-wind-down-optane-memory-business"},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Stergios Stergiou Dipen Rughwani and Kostas Tsioutsiouliklis. 2018. Short-cutting label propagation for distributed connected components. In WSDM. 540--546.  Stergios Stergiou Dipen Rughwani and Kostas Tsioutsiouliklis. 2018. Short-cutting label propagation for distributed connected components. In WSDM. 540--546.","DOI":"10.1145\/3159652.3159696"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0466-x"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732232.2732238"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_1_53_1","unstructured":"Keval Vora Guoqing Xu and Rajiv Gupta. 2016. Load the Edges You Need: A Generic I\/O Optimization for Disk-based Graph Processing. In USENIX ATC. 507--522.  Keval Vora Guoqing Xu and Rajiv Gupta. 2016. Load the Edges You Need: A Generic I\/O Optimization for Disk-based Graph Processing. In USENIX ATC. 507--522."},{"key":"e_1_2_1_54_1","unstructured":"Guozhang Wang Wenlei Xie Alan J Demers and Johannes Gehrke. 2013. Asynchronous Large-Scale Graph Processing Made Easy. In CIDR. 3--6.  Guozhang Wang Wenlei Xie Alan J Demers and Johannes Gehrke. 2013. Asynchronous Large-Scale Graph Processing Made Easy. In CIDR. 3--6."},{"key":"e_1_2_1_55_1","unstructured":"Wikipedia. 2023. Stone-Weierstrass Theorem. Retrieved May 1 2023 from https:\/\/en.wikipedia.org\/wiki\/Stone%E2%80%93Weierstrass_theorem  Wikipedia. 2023. Stone-Weierstrass Theorem. Retrieved May 1 2023 from https:\/\/en.wikipedia.org\/wiki\/Stone%E2%80%93Weierstrass_theorem"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Chenning Xie Rong Chen Haibing Guan Binyu Zang and Haibo Chen. 2015. SYNC or ASYNC: Time to fuse for distributed graph-parallel computation. In PPoPP. 194--204.  Chenning Xie Rong Chen Haibing Guan Binyu Zang and Haibo Chen. 2015. SYNC or ASYNC: Time to fuse for distributed graph-parallel computation. In PPoPP. 194--204.","DOI":"10.1145\/2858788.2688508"},{"key":"e_1_2_1_57_1","first-page":"1767","article-title":"A Hybrid Update Strategy for I\/O-Efficient Out-of-Core Graph Processing","volume":"31","author":"Xu Xianghao","year":"2020","unstructured":"Xianghao Xu , Fang Wang , Hong Jiang , Yongli Cheng , Dan Feng , and Yongxuan Zhang . 2020 . A Hybrid Update Strategy for I\/O-Efficient Out-of-Core Graph Processing . TPDS 31 , 8 (2020), 1767 -- 1782 . Xianghao Xu, Fang Wang, Hong Jiang, Yongli Cheng, Dan Feng, and Yongxuan Zhang. 2020. A Hybrid Update Strategy for I\/O-Efficient Out-of-Core Graph Processing. TPDS 31, 8 (2020), 1767--1782.","journal-title":"TPDS"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733103"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733085.2733089"},{"key":"e_1_2_1_60_1","doi-asserted-by":"crossref","unstructured":"Kaiyuan Zhang Rong Chen and Haibo Chen. 2015. NUMA-Aware Graph-Structured Analytics. In PPoPP. 183--193.  Kaiyuan Zhang Rong Chen and Haibo Chen. 2015. NUMA-Aware Graph-Structured Analytics. In PPoPP. 183--193.","DOI":"10.1145\/2858788.2688507"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.235"},{"key":"e_1_2_1_62_1","volume-title":"Graphit: A high-performance graph DSL. PACMPL 2, OOPSLA","author":"Zhang Yunming","year":"2018","unstructured":"Yunming Zhang , Mengjiao Yang , Riyadh Baghdadi , Shoaib Kamil , Julian Shun , and Saman Amarasinghe . 2018 . Graphit: A high-performance graph DSL. PACMPL 2, OOPSLA (2018), 1--30. Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, and Saman Amarasinghe. 2018. Graphit: A high-performance graph DSL. PACMPL 2, OOPSLA (2018), 1--30."},{"key":"e_1_2_1_63_1","volume-title":"Gemini: A computation-centric distributed graph processing system. In USENIX OSDI. 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 USENIX OSDI. 301--316. Xiaowei Zhu, Wenguang Chen, Weimin Zheng, and Xiaosong Ma. 2016. Gemini: A computation-centric distributed graph processing system. In USENIX OSDI. 301--316."},{"key":"e_1_2_1_64_1","unstructured":"Xiaowei Zhu Wentao Han and Wenguang Chen. 2015. GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In USENIX ATC. 375--386.  Xiaowei Zhu Wentao Han and Wenguang Chen. 2015. GridGraph: Large-Scale Graph Processing on a Single Machine Using 2-Level Hierarchical Partitioning. In USENIX ATC. 375--386."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3598581.3598590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,19]],"date-time":"2023-07-19T22:56:45Z","timestamp":1689807405000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3598581.3598590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":61,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.14778\/3598581.3598590"],"URL":"https:\/\/doi.org\/10.14778\/3598581.3598590","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}