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)
Incoming Non-self Citations Over Time
Authors
- 1. Xiao Hu (Duke University)
- 2. Stavros Sintos (University of Chicago)
- 3. Junyang Gao (Google)
- 4. Pankaj K. Agarwal (Duke University)
- 5. Jun Yang (Duke University)
BibTeX Citation
@inproceedings{hu_sigmod22,
title = {{Computing Complex Temporal Join Queries Efficiently}},
author = {Hu, Xiao and Sintos, Stavros and Gao, Junyang and Agarwal, Pankaj K. and Yang, Jun},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517893},
url = {https://dl.acm.org/doi/10.1145/3514221.3517893},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,292 | Computing the Difference of Conjunctive Queries Efficiently | 2023 | SIGMOD | 5.5642569e-05 |
| 8,008 | Differentially Private Data Release over Multiple Tables | 2023 | PODS | 5.4075828e-05 |
| 8,743 | LIT: Lightning-fast In-memory Temporal Indexing | 2024 | SIGMOD | 5.2882178e-05 |
| 8,832 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 5.2680847e-05 |
| 10,854 | Worst-Case Optimal BGPs on Temporal Graphs | 2026 | VLDB | 4.9793485e-05 |
| 11,656 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 16 of 16 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,594 | Efficient Computation of Temporal Aggregates with Range Predicates | 2001 | PODS |
| 2 | 1,514 | Computing Joins Of Relations | 1975 | SIGMOD |
| 3 | 6,955 | The Complexity of Boolean Conjunctive Queries with Intersection Joins | 2022 | PODS |
| 4 | 3,494 | On Join Sampling and the Hardness of Combinatorial Output-Sensitive Join Algorithms | 2023 | PODS |
| 5 | 1,596 | Adopting Worst-Case Optimal Joins in Relational Database Systems | 2020 | VLDB |
| 6 | 7,435 | Efficient Computation of Quantiles over Joins | 2023 | PODS |
| 7 | 3,660 | Scalable Computation of Acyclic Joins (Extended Abstract) | 2006 | PODS |
| 8 | 6,287 | On Spatially Partitioned Temporal Join | 1994 | VLDB |
| 9 | 4,063 | Event-Join Optimization in Temporal Relational Databases | 1989 | VLDB |
| 10 | 5,538 | Temporal Query Processing and Optimization in Multiprocessor Database Machines | 1992 | VLDB |