Time windowed data structures
Farah Chanchary
Carleton University

In the time windowed query setting, we are given a set of time stamped events $S$, a contiguous time interval $q = [i, j]$, and a predicate $P$. We want to answer queries based on time stamped events that match $P$ and have time stamps in the range of $q$. In this talk I will present three approaches using Dynamic Algorithms and Range Search, Colored Range Search (results appeared in CALDAM '17) and Transformation based techniques (to appear in CALDAM '18) to solve problems using graphs and geometric objects.