DEBS '20: Proceedings of the 14th ACM International Conference on Distributed and Event-based Systems
Streaming graph processing and analytics
Graphs are now ubiquitous as many applications emerge where the relationships among entities are paramount and require being modeled as first-class objects. Graph database systems empower such applications by enabling querying and processing both the data stored on the graph and its topology, and they have gained significant attention both in industry and academia. The graphs used in many modern applications are not static and not fully available for analysis; rather the graph vertices and edges are streamed, and the graph "emerges" over time. These are called streaming graphs. Processing and analyzing streaming graphs are challenging, because the difficulties of streaming combine with the complexities of graph processing. In this talk, I have two objectives. First is the introduction and positioning of the problem and the environment. The second is to highlight some of our recent work in this area within the context of s-Graffito project.
