The future is big graphs: a community view on graph processing systems
dc.contributor.author
Sakr, Sherif
dc.contributor.author
Bonifati, Angela
dc.contributor.author
Voigt, Hannes
dc.contributor.author
Iosup, Alexandru
dc.contributor.author
Ammar, Khaled
dc.contributor.author
Angles, Renzo
dc.contributor.author
Aref, Walid
dc.contributor.author
Arenas, Marcelo
dc.contributor.author
Besta, Maciej
dc.contributor.author
Boncz, Peter A.
dc.contributor.author
Daudjee, Khuzaima
dc.contributor.author
Della Valle, Emanuele
dc.contributor.author
Dumbrava, Stefania
dc.contributor.author
Hartig, Olaf
dc.contributor.author
Haslhofer, Bernhard
dc.contributor.author
Hegeman, Tim
dc.contributor.author
Hidders, Jan
dc.contributor.author
Hose, Katja
dc.contributor.author
Iamnitchi, Adriana
dc.contributor.author
Kalavri, Vasiliki
dc.contributor.author
Kapp, Hugo
dc.contributor.author
Martens, Wim
dc.contributor.author
Özsu, Tamer M.
dc.contributor.author
Peukert, Eric
dc.contributor.author
Plantikow, Stefan
dc.contributor.author
Ragab, Mohamed
dc.contributor.author
Ripeanu, Matei R.
dc.contributor.author
Salihoglu, Semih
dc.contributor.author
Schulz, Christian
dc.contributor.author
Selmer, Petra
dc.contributor.author
Sequeda, Juan F.
dc.contributor.author
Shinavier, Joshua
dc.contributor.author
Szárnyas, Gábor
dc.contributor.author
Tommasini, Riccardo
dc.contributor.author
Tumeo, Antonino
dc.contributor.author
Uta, Alexandru
dc.contributor.author
Varbanescu, Ana L.
dc.contributor.author
Wu, Hsiang-Yun
dc.contributor.author
Yakovets, Nikolay
dc.contributor.author
Yan, Da
dc.contributor.author
Yoneki, Eiko
dc.date.accessioned
2021-09-27T14:16:19Z
dc.date.available
2021-09-07T04:06:43Z
dc.date.available
2021-09-27T14:16:19Z
dc.date.issued
2021-09
dc.identifier.issn
1557-7317
dc.identifier.issn
0001-0782
dc.identifier.other
10.1145/3434642
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/504426
dc.identifier.doi
10.3929/ethz-b-000504426
dc.description.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?
en_US
dc.format
application/pdf
en_US
dc.language.iso
en
en_US
dc.publisher
Association for Computing Machinery
dc.rights.uri
http://creativecommons.org/licenses/by-nc-sa/4.0/
dc.title
The future is big graphs: a community view on graph processing systems
en_US
dc.type
Journal Article
dc.rights.license
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International
ethz.journal.title
Communications of the ACM
ethz.journal.volume
64
en_US
ethz.journal.issue
9
en_US
ethz.journal.abbreviated
Commun. ACM
ethz.pages.start
62
en_US
ethz.pages.end
71
en_US
ethz.version.deposit
publishedVersion
en_US
ethz.event.location
ethz.identifier.wos
ethz.identifier.scopus
ethz.publication.place
New York, NY
ethz.publication.status
published
en_US
ethz.date.deposited
2021-09-07T04:06:46Z
ethz.source
SCOPUS
ethz.eth
yes
en_US
ethz.availability
Open access
en_US
ethz.rosetta.installDate
2021-09-27T14:16:36Z
ethz.rosetta.lastUpdated
2024-02-02T14:45:19Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=The%20future%20is%20big%20graphs:%20a%20community%20view%20on%20graph%20processing%20systems&rft.jtitle=Communications%20of%20the%20ACM&rft.date=2021-09&rft.volume=64&rft.issue=9&rft.spage=62&rft.epage=71&rft.issn=1557-7317&0001-0782&rft.au=Sakr,%20Sherif&Bonifati,%20Angela&Voigt,%20Hannes&Iosup,%20Alexandru&Ammar,%20Khaled&rft.genre=article&rft_id=info:doi/10.1145/3434642&
Files in this item
Publication type
-
Journal Article [130874]