The reviewed record of science sign in
Pith

arxiv: 2012.06171 · v1 · pith:AJ5BKNMX · submitted 2020-12-11 · cs.DC · cs.DB

The Future is Big Graphs! A Community View on Graph Processing Systems

Sherif Sakr , Angela Bonifati , Hannes Voigt , Alexandru Iosup , Khaled Ammar , Renzo Angles , Walid Aref , Marcelo Arenas
show 33 more authors
Maciej Besta Peter A. Boncz Khuzaima Daudjee Emanuele Della Valle Stefania Dumbrava Olaf Hartig Bernhard Haslhofer Tim Hegeman Jan Hidders Katja Hose Adriana Iamnitchi Vasiliki Kalavri Hugo Kapp Wim Martens M. Tamer \"Ozsu Eric Peukert Stefan Plantikow Mohamed Ragab Matei R. Ripeanu Semih Salihoglu Christian Schulz Petra Selmer Juan F. Sequeda Joshua Shinavier G\'abor Sz\'arnyas Riccardo Tommasini Antonino Tumeo Alexandru Uta Ana Lucia Varbanescu Hsiang-Yun Wu Nikolay Yakovets Da Yan Eiko Yoneki
This is my paper

Reviewed by Pithpith:AJ5BKNMXopen to challenge →

classification cs.DC cs.DB
keywords graphabstractionsfuturegraphsprocessingsystemsalthoughcommunity
0
0 comments X
read the original 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?

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.