Sakr, S. and Bonifati, A. and Voigt, H. and Iosup, A. and Ammar, K. and Angles, R. and Aref, W. and Arenas, M. and Besta, M. and Boncz, P.A. and Daudjee, K. and Valle, E.D. and Dumbrava, S. and Hartig, O. and Haslhofer, B. and Hegeman, T. and Hidders, Jan and Hose, K. and Iamnitchi, A. and Kalavri, V. and Kapp, H. and Martens, W. and Özsu, M.T and Peukert, E. and Plantikow, S. and Ragab, M. and Ripeanu, M.R. and Salihoglu, S. and Schulz, C. and Selmer, P. and Sequeda, J.F. and Shinavier, J. and Szárnyas, G. and Tommasini, R. and Tumeo, A. and Uta, A. and Varbanescu, A.L. and Wu, H.-Y. and Yakovets, N. and Yan, D. and Yoneki, E. (2021) The future is big graphs. Communications of the ACM 64 (9), pp. 62-71. ISSN 0001-0782.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
55839.pdf - Published Version of Record Available under License Creative Commons Attribution Non-commercial Share Alike. Download (5MB) |
Abstract
Graphs are, by nature, ‘unifying abstractions’ that can leverage interconnectedness to represent, explore, predict, and explain real- and digital-world phenomena. Although real users and consumers of graph instances and graph workloads understand these abstractions, future problems will require new abstractions and systems. What needs to happen in the next decade for big graph processing to continue to succeed?
Metadata
| Item Type: | Article |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Jan Hidders |
| Date Deposited: | 27 Jun 2025 16:15 |
| Last Modified: | 19 Sep 2025 20:51 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/55839 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
