{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T02:42:28Z","timestamp":1775788948276,"version":"3.50.1"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T00:00:00Z","timestamp":1629763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-sa\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["14829"],"award-info":[{"award-number":["14829"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>Ensuring the success of big graph processing for the next decade and beyond.<\/jats:p>","DOI":"10.1145\/3434642","type":"journal-article","created":{"date-parts":[[2021,8,24]],"date-time":"2021-08-24T14:28:46Z","timestamp":1629815326000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":143,"title":["The future is big graphs"],"prefix":"10.1145","volume":"64","author":[{"given":"Sherif","family":"Sakr","sequence":"first","affiliation":[{"name":"University of Tartu, Estonia"}]},{"given":"Angela","family":"Bonifati","sequence":"additional","affiliation":[{"name":"Lyon 1 University and Liris CNRS in Villeurbanne, France"}]},{"given":"Hannes","family":"Voigt","sequence":"additional","affiliation":[{"name":"Neo4j, Germany"}]},{"given":"Alexandru","family":"Iosup","sequence":"additional","affiliation":[{"name":"Vrije Universiteit Amsterdam and Delft University of Technology, The Netherlands"}]},{"given":"Khaled","family":"Ammar","sequence":"additional","affiliation":[{"name":"Borialis AI"}]},{"given":"Renzo","family":"Angles","sequence":"additional","affiliation":[{"name":"University of Talca"}]},{"given":"Walid","family":"Aref","sequence":"additional","affiliation":[{"name":"Purdue University"}]},{"given":"Marcelo","family":"Arenas","sequence":"additional","affiliation":[{"name":"PUC &amp; IMFD"}]},{"given":"Maciej","family":"Besta","sequence":"additional","affiliation":[{"name":"ETH Z\u00fcrich"}]},{"given":"Peter A.","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI"}]},{"given":"Khuzaima","family":"Daudjee","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Emanuele Della","family":"Valle","sequence":"additional","affiliation":[{"name":"Polytechnic University of Milan"}]},{"given":"Stefania","family":"Dumbrava","sequence":"additional","affiliation":[{"name":"ENSIIE"}]},{"given":"Olaf","family":"Hartig","sequence":"additional","affiliation":[{"name":"Link\u00f6ping University"}]},{"given":"Bernhard","family":"Haslhofer","sequence":"additional","affiliation":[{"name":"Austrian Institute of Technology"}]},{"given":"Tim","family":"Hegeman","sequence":"additional","affiliation":[{"name":"VU University Amsterdam"}]},{"given":"Jan","family":"Hidders","sequence":"additional","affiliation":[{"name":"Birkbeck, University of London"}]},{"given":"Katja","family":"Hose","sequence":"additional","affiliation":[{"name":"Aalborg University"}]},{"given":"Adriana","family":"Iamnitchi","sequence":"additional","affiliation":[{"name":"University of South Florida"}]},{"given":"Vasiliki","family":"Kalavri","sequence":"additional","affiliation":[{"name":"Boston University"}]},{"given":"Hugo","family":"Kapp","sequence":"additional","affiliation":[{"name":"Oracle Labs Switzerland"}]},{"given":"Wim","family":"Martens","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bayreuth"}]},{"given":"M. Tamer","family":"\u00d6zsu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Eric","family":"Peukert","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Leipzig"}]},{"given":"Stefan","family":"Plantikow","sequence":"additional","affiliation":[{"name":"Neo4j"}]},{"given":"Mohamed","family":"Ragab","sequence":"additional","affiliation":[{"name":"University of Tartu"}]},{"given":"Matei R.","family":"Ripeanu","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]},{"given":"Semih","family":"Salihoglu","sequence":"additional","affiliation":[{"name":"University of Waterloo"}]},{"given":"Christian","family":"Schulz","sequence":"additional","affiliation":[{"name":"Heidelberg University and Universit\u00e4t Wien"}]},{"given":"Petra","family":"Selmer","sequence":"additional","affiliation":[{"name":"Neo4j"}]},{"given":"Juan F.","family":"Sequeda","sequence":"additional","affiliation":[{"name":"data.world"}]},{"given":"Joshua","family":"Shinavier","sequence":"additional","affiliation":[{"name":"Uber Engineering"}]},{"given":"G\u00e1bor","family":"Sz\u00e1rnyas","sequence":"additional","affiliation":[{"name":"Budapest Univ. of Technology and Economics"}]},{"given":"Riccardo","family":"Tommasini","sequence":"additional","affiliation":[{"name":"University of Tartu"}]},{"given":"Antonino","family":"Tumeo","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Lab"}]},{"given":"Alexandru","family":"Uta","sequence":"additional","affiliation":[{"name":"VU University Amsterdam"}]},{"given":"Ana Lucia","family":"Varbanescu","sequence":"additional","affiliation":[{"name":"University of Amsterdam"}]},{"given":"Hsiang-Yun","family":"Wu","sequence":"additional","affiliation":[{"name":"TU Wien"}]},{"given":"Nikolay","family":"Yakovets","sequence":"additional","affiliation":[{"name":"TU Eindhoven"}]},{"given":"Da","family":"Yan","sequence":"additional","affiliation":[{"name":"The University of Alabama"}]},{"given":"Eiko","family":"Yoneki","sequence":"additional","affiliation":[{"name":"University of Cambridge"}]}],"member":"320","published-online":{"date-parts":[[2021,8,24]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1979)","author":"Aho A.V.","unstructured":"Aho , A.V. and Ullman , J.D . Universality of data retrieval languages . In Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1979) 110--119. Aho, A.V. and Ullman, J.D. Universality of data retrieval languages. In Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (1979) 110--119."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3104031"},{"key":"e_1_2_1_4_1","volume-title":"SIGMOD Conf.","author":"Angles R.","year":"2018","unstructured":"Angles , R. et al. G-CORE: A core for future graph query languages . SIGMOD Conf. ( 2018 ), 1421--1432. Angles, R. et al. G-CORE: A core for future graph query languages. SIGMOD Conf. (2018), 1421--1432."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3390\/a12070127"},{"key":"e_1_2_1_6_1","volume-title":"Models and issues in data stream systems. PODS","author":"Babcock B.","year":"2002","unstructured":"Babcock , B. , Babu S. , Datar , M. , Motwani , R. , and Widom , J . Models and issues in data stream systems. PODS ( 2002 ), 1--16. Babcock, B., Babu S., Datar, M., Motwani, R., and Widom, J. Models and issues in data stream systems. PODS (2002), 1--16."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000224"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01864-0"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379445"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2015.74"},{"key":"e_1_2_1_11_1","volume-title":"Theory of database queries. PODS","author":"Chandra A.K.","year":"1988","unstructured":"Chandra , A.K. Theory of database queries. PODS ( 1988 ), 1--9. Chandra, A.K. Theory of database queries. PODS (1988), 1--9."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362685"},{"key":"e_1_2_1_13_1","volume-title":"The Grid 2: Blueprint for a New Computing Infrastructure","author":"Foster I.","year":"2003","unstructured":"Foster , I. and Kesselman , C . The Grid 2: Blueprint for a New Computing Infrastructure . Elsevier ( 2003 ). Foster, I. and Kesselman, C. The Grid 2: Blueprint for a New Computing Infrastructure. Elsevier (2003)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3190657"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39634-2_14"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376660"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_2_1_18_1","volume-title":"et al. Massivizing computer systems: A vision to understand, design, and engineer computer ecosystems through and beyond modern distributed systems. ICDCS","author":"Iosup A.","year":"2018","unstructured":"Iosup , A. et al. Massivizing computer systems: A vision to understand, design, and engineer computer ecosystems through and beyond modern distributed systems. ICDCS ( 2018 ), 1224--1237. Iosup, A. et al. Massivizing computer systems: A vision to understand, design, and engineer computer ecosystems through and beyond modern distributed systems. ICDCS (2018), 1224--1237."},{"key":"e_1_2_1_19_1","volume-title":"et al. The AtLarge vision on the design of distributed systems and ecosystems. ICDCS","author":"Iosup A.","year":"2019","unstructured":"Iosup , A. et al. The AtLarge vision on the design of distributed systems and ecosystems. ICDCS ( 2019 ), 1765--1776. Iosup, A. et al. The AtLarge vision on the design of distributed systems and ecosystems. ICDCS (2019), 1765--1776."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2762294"},{"key":"e_1_2_1_21_1","volume-title":"Sampling from large graphs. KDD","author":"Leskovec J.","year":"2006","unstructured":"Leskovec , J. and Faloutsos , C . Sampling from large graphs. KDD ( 2006 ), 631--636. Leskovec, J. and Faloutsos, C. Sampling from large graphs. KDD (2006), 631--636."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186727"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389733"},{"key":"e_1_2_1_24_1","volume-title":"et al. Methodological principles for reproducible performance evaluation in cloud computing","author":"Papadopoulos A.V.","year":"2020","unstructured":"Papadopoulos , A.V. et al. Methodological principles for reproducible performance evaluation in cloud computing . IEEE Trans. Software Engineering ( 2020 ), 93--94. Papadopoulos, A.V. et al. Methodological principles for reproducible performance evaluation in cloud computing. IEEE Trans. Software Engineering (2020), 93--94."},{"key":"e_1_2_1_25_1","first-page":"2","article-title":"The ubiquity of large graphs and surprising challenges of graph processing: Extended survey","volume":"29","author":"Sahu S.","year":"2020","unstructured":"Sahu , S. . The ubiquity of large graphs and surprising challenges of graph processing: Extended survey . Proc. VLDB Endow. J. 29 , 2 ( 2020 ), 595--618. Sahu, S. et al. The ubiquity of large graphs and surprising challenges of graph processing: Extended survey. Proc. VLDB Endow. J. 29, 2 (2020), 595--618.","journal-title":"Proc. VLDB Endow. J."},{"key":"e_1_2_1_26_1","volume-title":"WWW Conf.","author":"Saleem M.","year":"2019","unstructured":"Saleem , M. et al. How representative is a SPARQL benchmark? An analysis of RDF triplestore benchmarks . WWW Conf. ( 2019 ), 1623--1633. Saleem, M. et al. How representative is a SPARQL benchmark? An analysis of RDF triplestore benchmarks. WWW Conf. (2019), 1623--1633."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2018.053681359"},{"key":"e_1_2_1_28_1","volume-title":"The boost graph library: User guide and reference manual","author":"Siek J.G.","year":"2002","unstructured":"Siek , J.G. , Lee , L.Q. , and Lumsdaine , A . The boost graph library: User guide and reference manual . Addison-Wesley ( 2002 ). Siek, J.G., Lee, L.Q., and Lumsdaine, A. The boost graph library: User guide and reference manual. Addison-Wesley (2002)."},{"key":"e_1_2_1_29_1","volume-title":"Exploring HPC and big data convergence: A graph processing study on Intel Knights Landing. CLUSTER","author":"Uta A.","year":"2018","unstructured":"Uta , A. , Varbanescu , A.L. , Musaafir , A. , Lemaire , C. , and Iosup , A . Exploring HPC and big data convergence: A graph processing study on Intel Knights Landing. CLUSTER ( 2018 ), 66--77. Uta, A., Varbanescu, A.L., Musaafir, A., Lemaire, C., and Iosup, A. Exploring HPC and big data convergence: A graph processing study on Intel Knights Landing. CLUSTER (2018), 66--77."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920887"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434642","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:58Z","timestamp":1750195918000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434642"}},"subtitle":["a community view on graph processing systems"],"short-title":[],"issued":{"date-parts":[[2021,8,24]]},"references-count":30,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.1145\/3434642"],"URL":"https:\/\/doi.org\/10.1145\/3434642","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,24]]},"assertion":[{"value":"2021-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}