PhD Defence • Data Systems | Data Management, Graph Processing, Parallel Systems • Systems and Algorithms for Dynamic Graph ProcessingExport this event to calendar

Friday, February 3, 2023 — 2:00 PM to 5:00 PM EST

Please note: This PhD defence will take place online.

Khaled Ammar, PhD candidate
David R. Cheriton School of Computer Science

Supervisors: Professors M. Tamer Özsu, Semih Salihoglu

Data generated from human and systems interactions could be naturally represented as graph data. Several emerging applications rely on graph data, such as, semantic web, social networks, bioinformatics, finance, and trading among others. These applications require graph querying capabilities which are often implemented in a graph database management systems (GDBMS). Many GDBMSs have capabilities to evaluate one-time versions of recursive or subgraph queries over static graphs — graphs that do not change or a single snapshot of a changing graph. They generally do not support incrementally maintaining them. In fact, most applications that employ graphs are dynamic in nature resulting in graphs that change over time, also known as dynamic graphs.

This thesis investigates how to build a generic and scalable incremental computation solution that is oblivious to graph workloads. It focuses on two fundamental computations performed by many applications: recursive queries and subgraph queries. Specifically, for subgraph queries, this thesis presents the first approach that (i) performs joins with worst case optimal computation and communication costs; and (ii) maintains a total memory footprint almost linear in the number of input edges. For recursive queries, this thesis studies optimizations for using differential computation (DC). DC is a general incremental computation that can maintain the output of a recursive dataflow computation upon changes. However, it requires a prohibitively large amount of memory. The thesis proposes a suite of optimizations that are based on dropping the differences of operators, both completely or partially, and recomputing these differences when necessary, as a technique to reduce the memory overhead of DC. The techniques and optimizations in this thesis represent a proposal for how to build a state-of-the-art generic and scalable GDBMS for dynamic graph data management.


To join this PhD defence on Zoom, please go to https://uwaterloo.zoom.us/j/97548187600.

Location 
Online PhD defence
200 University Avenue West

Waterloo, ON N2L 3G1
Canada
Event tags 

S M T W T F S
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
1
2
3
4
  1. 2023 (36)
    1. March (2)
    2. February (12)
    3. January (22)
  2. 2022 (245)
    1. December (20)
    2. November (28)
    3. October (15)
    4. September (12)
    5. August (29)
    6. July (23)
    7. June (17)
    8. May (20)
    9. April (24)
    10. March (22)
    11. February (16)
    12. January (19)
  3. 2021 (210)
  4. 2020 (217)
  5. 2019 (255)
  6. 2018 (217)
  7. 2017 (36)
  8. 2016 (21)
  9. 2015 (36)
  10. 2014 (33)
  11. 2013 (23)
  12. 2012 (4)
  13. 2011 (1)
  14. 2010 (1)
  15. 2009 (1)
  16. 2008 (1)