Computing Complex Temporal Join Queries Efficiently Article Swipe

MAKE IMPACT

Xiao Hu , Stavros Sintos , Junyang Gao , Pankaj K. Agarwal , Jun Yang · YOU? · · 2022 · Open Access · · DOI: https://doi.org/10.1145/3514221.3517893

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.

Type

article

Language

en

Landing Page

https://doi.org/10.1145/3514221.3517893

PDF

https://dl.acm.org/doi/pdf/10.1145/3514221.3517893

OA Status

hybrid

Cited By

6

References

66

Related Works

10

OpenAlex ID

https://openalex.org/W4281803334

Raw OpenAlex JSON