On Reporting Durable Patterns in Temporal Proximity Graphs
Summary: Near-linear-time algorithms with provable guarantees to report approximately durable subgraph patterns (e.g., triangles, paths) in temporal proximity graphs using an implicit spatial-embedding + time-interval node representation. Also supports interactive durability-threshold queries via incremental updates computed in time near-linear in the size of result changes, leveraging proximity structure to outperform prior super-linear, non-guaranteed methods. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Pankaj K. Agarwal (Duke University)
- 2. Xiao Hu (University of Waterloo)
- 3. Stavros Sintos (University of Illinois Chicago)
- 4. Jun Yang (Duke University)
BibTeX Citation
@inproceedings{agarwal_pods24,
address = {New York, NY, USA},
series = {{PODS} '24},
title = {{On Reporting Durable Patterns in Temporal Proximity Graphs}},
url = {https://dl.acm.org/doi/10.1145/3651144},
doi = {10.1145/3651144},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Agarwal, Pankaj K. and Hu, Xiao and Sintos, Stavros and Yang, Jun},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,678 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 5.8053953e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 321 | Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems | 2018 | PODS | 0.00021283186 |
| 636 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001551856 |
| 816 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00013827772 |
| 6,761 | Efficiently Answering Durability Prediction Queries | 2021 | SIGMOD | 5.7822533e-05 |
| 7,797 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS | 5.5422948e-05 |
| 8,235 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 5.4608734e-05 |
| 11,954 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,365 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD |
| 2 | 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD |
| 3 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 4 | 776 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 5 | 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB |
| 6 | 11,954 | Durable Top-k Queries on Temporal Data | 2018 | VLDB |
| 7 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |
| 8 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 9 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 10 | 13,162 | Temporal Relationships in Databases | 1988 | VLDB |