{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T10:08:48Z","timestamp":1774951728656,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T00:00:00Z","timestamp":1592092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Department of Energy","award":["#DE-SC0018947"],"award-info":[{"award-number":["#DE-SC0018947"]}]},{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#1122374,#CCF-1845763,#CCF-1910030#CCF-191922"],"award-info":[{"award-number":["#1122374,#CCF-1845763,#CCF-1910030#CCF-191922"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA","award":["#HR0011-18-3-000"],"award-info":[{"award-number":["#HR0011-18-3-000"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,14]]},"DOI":"10.1145\/3398682.3399168","type":"proceedings-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T19:25:57Z","timestamp":1591730757000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["The Graph Based Benchmark Suite (GBBS)"],"prefix":"10.1145","author":[{"given":"Laxman","family":"Dhulipala","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Jessica","family":"Shi","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Tom","family":"Tseng","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]},{"given":"Guy E.","family":"Blelloch","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Julian","family":"Shun","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}]}],"member":"320","published-online":{"date-parts":[[2020,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2015.11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_3_2_1_3_1","unstructured":"D. A. Bader J. Feo J. Gilbert J. Kepner D. Koester and E. Loh. HPC scalable graph analysis benchmark.  D. A. Bader J. Feo J. Gilbert J. Kepner D. Koester and E. Loh. HPC scalable graph analysis benchmark."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602569_48"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2633993"},{"key":"e_1_3_2_1_6_1","unstructured":"Bazel. https:\/\/bazel.build\/.  Bazel. https:\/\/bazel.build\/."},{"key":"e_1_3_2_1_7_1","volume-title":"The GAP benchmark suite. CoRR, abs\/1508.03619","author":"Beamer S.","year":"2015","unstructured":"S. Beamer , K. Asanovic , and D. A. Patterson . The GAP benchmark suite. CoRR, abs\/1508.03619 , 2015 . S. Beamer, K. Asanovic, and D. A. Patterson. The GAP benchmark suite. CoRR, abs\/1508.03619, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988752"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96193-4_6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"e_1_3_2_1_11_1","first-page":"49","volume-title":"USENIX Annual Technical Conference (ATC)","author":"Bronson N.","year":"2013","unstructured":"N. Bronson , Z. Amsden , G. Cabrera , P. Chakka , P. Dimov , H. Ding , J. Ferris , A. Giardullo , S. Kulkarni , H. Li , M. Marchukov , D. Petrov , L. Puzar , Y.J. Song , and V. Venkataramani . TAO: Facebook's distributed data store for the social graph . In USENIX Annual Technical Conference (ATC) , pages 49 -- 60 , 2013 . N. Bronson, Z. Amsden, G. Cabrera, P. Chakka, P. Dimov, H. Ding, J. Ferris, A. Giardullo, S. Kulkarni, H. Li, M. Marchukov, D. Petrov, L. Puzar, Y.J. Song, and V. Venkataramani. TAO: Facebook's distributed data store for the social graph. In USENIX Annual Technical Conference (ATC), pages 49--60, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to Algorithms (3. ed.)","author":"Cormen T. H.","year":"2009","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms (3. ed.) . MIT Press , 2009 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087580"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210414"},{"key":"e_1_3_2_1_16_1","volume-title":"Theoretically efficient parallel graph algorithms can be fast and scalable. CoRR, abs\/1805.05208","author":"Dhulipala L.","year":"2018","unstructured":"L. Dhulipala , G. E. Blelloch , and J. Shun . Theoretically efficient parallel graph algorithms can be fast and scalable. CoRR, abs\/1805.05208 , 2018 . L. Dhulipala, G. E. Blelloch, and J. Shun. Theoretically efficient parallel graph algorithms can be fast and scalable. CoRR, abs\/1805.05208, 2018."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314598"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3397230.3397251"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200.2983202"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208352.3208355"},{"key":"e_1_3_2_1_22_1","first-page":"17","volume-title":"USENIX Symposium on Operating System Design and Implementation (OSDI)","author":"Gonzalez J.","year":"2012","unstructured":"J. Gonzalez , Y. Low , H. Gu , D. Bickson , and C. Guestrin . PowerGraph: Distributed graph-parallel computation on natural graphs . In USENIX Symposium on Operating System Design and Implementation (OSDI) , pages 17 -- 30 , 2012 . J. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin. PowerGraph: Distributed graph-parallel computation on natural graphs. In USENIX Symposium on Operating System Design and Implementation (OSDI), pages 17--30, 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"Los Alamos National Lab.(LANL)","author":"Hagberg A.","year":"2008","unstructured":"A. Hagberg , P. Swart , and D. S Chult . Exploring network structure, dynamics, and function using NetworkX. Technical report , Los Alamos National Lab.(LANL) , Los Alamos, NM ( United States) , 2008 . A. Hagberg, P. Swart, and D. S Chult. Exploring network structure, dynamics, and function using NetworkX. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2008."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/133889"},{"key":"e_1_3_2_1_26_1","volume-title":"pybind11 - seamless operability between C++11 and Python","author":"Jakob W.","year":"2017","unstructured":"W. Jakob , J. Rhinelander , and D. Moldovan . pybind11 - seamless operability between C++11 and Python , 2017 . https:\/\/github.com\/pybind\/pybind11. W. Jakob, J. Rhinelander, and D. Moldovan. pybind11 - seamless operability between C++11 and Python, 2017. https:\/\/github.com\/pybind\/pybind11."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064012"},{"key":"e_1_3_2_1_29_1","unstructured":"J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data 2019.  J. Leskovec and A. Krevl. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data 2019."},{"key":"e_1_3_2_1_30_1","first-page":"340","volume-title":"Conference on Uncertainty in Artificial Intelligence (UAI)","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 . In Conference on Uncertainty in Artificial Intelligence (UAI) , pages 340 -- 349 , 2010 . Y. Low, J. Gonzalez, A. Kyrola, D. Bickson, C. Guestrin, and J. M. Hellerstein. GraphLab: A new framework for parallel machine learning. In Conference on Uncertainty in Artificial Intelligence (UAI), pages 340--349, 2010."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2818185"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1561\/106.00000003"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807626"},{"key":"e_1_3_2_1_35_1","unstructured":"Neo4j. http:\/\/neo4j.com.  Neo4j. http:\/\/neo4j.com."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522739"},{"key":"e_1_3_2_1_37_1","first-page":"41","volume-title":"USENIX Conference on Annual Technical Conference (ATC)","author":"Prabhakaran V.","year":"2012","unstructured":"V. Prabhakaran , M. Wu , X. Weng , F. McSherry , L. Zhou , and M. Haridasan . Managing large graphs on multi-cores with graph awareness . In USENIX Conference on Annual Technical Conference (ATC) , pages 41 -- 52 , 2012 . V. Prabhakaran, M. Wu, X. Weng, F. McSherry, L. Zhou, and M. Haridasan. Managing large graphs on multi-cores with graph awareness. In USENIX Conference on Annual Technical Conference (ATC), pages 41--52, 2012."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P14-1131"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_3_2_1_40_1","volume-title":"Parallel clique counting and peeling algorithms. arXiv preprint arXiv:2002.10047","author":"Shi J.","year":"2020","unstructured":"J. Shi , L. Dhulipala , and J. Shun . Parallel clique counting and peeling algorithms. arXiv preprint arXiv:2002.10047 , 2020 . J. Shi, L. Dhulipala, and J. Shun. Parallel clique counting and peeling algorithms. arXiv preprint arXiv:2002.10047, 2020."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374527"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442530"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612687"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312018"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2015.8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113280"},{"key":"e_1_3_2_1_47_1","volume-title":"Gardenia: A graph processing benchmark suite for next-generation accelerators. ACM Journal on Emerging Technologies in Computing Systems (JETC), 15(1):1--13","author":"Xu Z.","year":"2019","unstructured":"Z. Xu , X. Chen , J. Shen , Y. Zhang , C. Chen , and C. Yang . Gardenia: A graph processing benchmark suite for next-generation accelerators. ACM Journal on Emerging Technologies in Computing Systems (JETC), 15(1):1--13 , 2019 . Z. Xu, X. Chen, J. Shen, Y. Zhang, C. Chen, and C. Yang. Gardenia: A graph processing benchmark suite for next-generation accelerators. ACM Journal on Emerging Technologies in Computing Systems (JETC), 15(1):1--13, 2019."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000056"}],"event":{"name":"SIGMOD\/PODS '20: International Conference on Management of Data","location":"Portland OR USA","acronym":"SIGMOD\/PODS '20","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3398682.3399168","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398682.3399168","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3398682.3399168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:31Z","timestamp":1750199611000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3398682.3399168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,14]]},"references-count":48,"alternative-id":["10.1145\/3398682.3399168","10.1145\/3398682"],"URL":"https:\/\/doi.org\/10.1145\/3398682.3399168","relation":{},"subject":[],"published":{"date-parts":[[2020,6,14]]},"assertion":[{"value":"2020-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}