Time

09:00-10:00 ^AM, Jul. 23rd, 2020

 

Location

ZOOM online

 

Abstract

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.

 

Lecturer

M. Tamer Özsu is a University Professor at Cheriton School of Computer Science at University of Waterloo. Previously, he was the Director of the Cheriton School and Associate Dean (Research) of the Faculty of Mathematics. Before Waterloo, he spent 16 years at the University of Alberta. His research is on distributed data management and the management of non-conventional data. He is a Fellow of the Royal Society of Canada, American Association for the Advancement of Science, ACM and IEEE, an elected member of Academy of Science of Turkey and a member of Sigma Xi. He currently holds a Cheriton Faculty Fellowship at the University of Waterloo.