Computing Complex Temporal Join Queries Efficiently

Xiao Hu, Stavros Sintos, Junyang Gao, Pankaj K. Agarwal, Jun Yang · Proceedings of the 2022 International Conference on Management of Data · 2022

This paper studies multi-way join queries over temporal data, where each tuple is associated with a valid time interval indicating when the tuple is valid. A temporal join requires that joining tuples' valid intervals intersect. Previous work on temporal joins has focused on joining two relations, but pairwise processing is often inefficient because it may generate unnecessarily large intermediate results. This paper investigates how to efficiently process complex temporal joins involving multiple relations. We also consider a useful extension, durable temporal joins, which further selects results with long enough valid intervals so they are not merely transient patterns.

Read the paper · More papers on PaperTik