Temporal graphs capture the development of relationships within data throughout time. This model would fit naturally within a streaming architecture, where new events can be inserted directly into the graph upon arrival from a data source, being compared to related entities or historical state. However, the vast majority of graph processing systems only consider traditional graph analysis on static data, with some outliers supporting either temporal analysis on similarly static data or traditional analysis on graphs updated via event streams. In this work we define a temporal graph model which can be updated via event streams and discuss the challenges of distribution and graph management. To solve these challenges, we introduce Raphtory, a distributed temporal graph management system which maintains the full graph history in-memory, leveraging this to insert streamed events directly into the graph model without batching and with minimal synchronisation.
Year
2018
URL
Abstract
Summary
Defines a temporal graph model that can be updated directly from event streams, and introduces Raphtory, a distributed temporal graph management system that keeps the full graph history in memory so streamed events can be inserted into the graph without batching and with minimal synchronisation.
bibtex
@inproceedings{steer2018raphtorytdlsg,
author = {Benjamin Steer and Alessandro Di Stefano and Richard G. Clegg and F\'elix Cuadrado},
title = {Building Distributed Temporal Graphs From Event Streams},
booktitle = {TD-LSG Workshop (Advances in Mining Large-Scale Time-Dependent Graphs), co-located with VLDB 2018},
year = {2018}
}
author = {Benjamin Steer and Alessandro Di Stefano and Richard G. Clegg and F\'elix Cuadrado},
title = {Building Distributed Temporal Graphs From Event Streams},
booktitle = {TD-LSG Workshop (Advances in Mining Large-Scale Time-Dependent Graphs), co-located with VLDB 2018},
year = {2018}
}
Venue
TD-LSG Workshop (Advances in Mining Large-Scale Time-Dependent Graphs), co-located with VLDB 2018