Database Paper Browser

Back to papers

Computing Complex Temporal Join Queries Efficiently

Summary: Multi-way temporal joins on intervals; reduces intermediates via overlap-aware processing. Durable temporal joins; classify joins; linear-time iff r-hierarchical (3SUM); output-sensitive methods for non-r-hierarchical cases; implemented. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6346
Venue
SIGMOD
Year
2022
Pagerank
4.5685178e-05
Overall Rank
8,163 | 43.27%
DOI
10.1145/3514221.3517893

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
7,161 Computing the Difference of Conjunctive Queries Efficiently 2023 SIGMOD 4.8086254e-05
7,865 Differentially Private Data Release over Multiple Tables 2023 PODS 4.6282846e-05
8,577 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 4.4879347e-05
8,673 On Reporting Durable Patterns in Temporal Proximity Graphs 2024 PODS 4.4660157e-05
11,135 A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition 2024 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers