DBScholar

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
h749b514b80968bfa
Venue
SIGMOD
Year
2022
Pagerank
5.4847975e-05
Overall Rank
7,609 | 48.85%
DOI
10.1145/3514221.3517893

Incoming Non-self Citations Over Time

Authors

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