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.

Sumrall, J.M. and Fletcher, G.H.L. and Poulovassilis, Alexandra and Svensson, J. and Vejlstrup, M. and Vest, C. and Webber, J. (2016) Investigations on path indexing for graph databases. In: Desprez, F. and Dutot, P.-F. and Kaklamanis, C. and Marchal, L. and Molitorisz, K. and Ricci, L. and Scarano, V. and Vega-Rodriguez, M.A. and Varbanescu, A.L. and Hunold, S. and Scott, S.L. and Lankes, S. and Weidendorfer, J. (eds.) Euro-Par 2016: Parallel Processing Workshops. Lecture Notes in Computer Science 10104. Grenoble, Switzerland: Springer, pp. 532-544. ISBN 9783319589428.