%0 Journal Article %1 Rost2022-vr %A Rost, Christopher %A Gomez, Kevin %A Täschner, Matthias %A Fritzsche, Philip %A Schons, Lucas %A Christ, Lukas %A Adameit, Timo %A Junghanns, Martin %A Rahm, Erhard %D 2022 %I Springer Science and Business Media LLC %J VLDB J. %K topic_graph area_bigdata %N 2 %P 375--401 %T Distributed temporal graph analytics with GRADOOP %V 31 %X AbstractTemporal property graphs are graphs whose structure and properties change over time. Temporal graph datasets tend to be large due to stored historical information, asking for scalable analysis capabilities. We give a complete overview of Gradoop, a graph dataflow system for scalable, distributed analytics of temporal property graphs which has been continuously developed since 2005. Its graph model TPGM allows bitemporal modeling not only of vertices and edges but also of graph collections. A declarative analytical language called GrALa allows analysts to flexibly define analytical graph workflows by composing different operators that support temporal graph analysis. Built on a distributed dataflow system, large temporal graphs can be processed on a shared-nothing cluster. We present the system architecture of Gradoop, its data model TPGM with composable temporal graph operators, like snapshot, difference, pattern matching, graph grouping and several implementation details. We evaluate the performance and scalability of selected operators and a composed workflow for synthetic and real-world temporal graphs with up to 283 M vertices and 1.8 B edges, and a graph lifetime of about 8 years with up to 20 M new edges per year. We also reflect on lessons learned from the Gradoop effort.

@article{Rost2022-vr, abstract = {AbstractTemporal property graphs are graphs whose structure and properties change over time. Temporal graph datasets tend to be large due to stored historical information, asking for scalable analysis capabilities. We give a complete overview of Gradoop, a graph dataflow system for scalable, distributed analytics of temporal property graphs which has been continuously developed since 2005. Its graph model TPGM allows bitemporal modeling not only of vertices and edges but also of graph collections. A declarative analytical language called GrALa allows analysts to flexibly define analytical graph workflows by composing different operators that support temporal graph analysis. Built on a distributed dataflow system, large temporal graphs can be processed on a shared-nothing cluster. We present the system architecture of Gradoop, its data model TPGM with composable temporal graph operators, like snapshot, difference, pattern matching, graph grouping and several implementation details. We evaluate the performance and scalability of selected operators and a composed workflow for synthetic and real-world temporal graphs with up to 283 M vertices and 1.8 B edges, and a graph lifetime of about 8 years with up to 20 M new edges per year. We also reflect on lessons learned from the Gradoop effort.}, added-at = {2024-09-10T11:56:37.000+0200}, author = {Rost, Christopher and Gomez, Kevin and T{\"a}schner, Matthias and Fritzsche, Philip and Schons, Lucas and Christ, Lukas and Adameit, Timo and Junghanns, Martin and Rahm, Erhard}, biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/296da48e04e9cd867dbd8b040037c4d0e/scadsfct}, copyright = {https://creativecommons.org/licenses/by/4.0}, interhash = {df25140a7e49abae5f9edd1166a6e76f}, intrahash = {96da48e04e9cd867dbd8b040037c4d0e}, journal = {VLDB J.}, keywords = {topic_graph area_bigdata}, language = {en}, month = {03}, number = 2, pages = {375--401}, publisher = {Springer Science and Business Media LLC}, timestamp = {2024-11-22T15:45:47.000+0100}, title = {Distributed temporal graph analytics with {GRADOOP}}, volume = 31, year = 2022 }