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
- 2. Xiao Hu
- 3. Stavros Sintos
- 4. Jun Yang
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,972 | Output-sensitive Conjunctive Query Evaluation | 2024 | PODS | 4.4150824e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 770 | Answering Conjunctive Queries under Updates | 2017 | PODS | 0.0001686092 |
| 1,054 | The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates | 2017 | SIGMOD | 0.00014397587 |
| 6,758 | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives | 2019 | PODS | 4.9335749e-05 |
| 6,959 | Efficiently Answering Durability Prediction Queries | 2021 | SIGMOD | 4.8805791e-05 |
| 8,163 | Computing Complex Temporal Join Queries Efficiently | 2022 | SIGMOD | 4.5685178e-05 |
| 11,756 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,236 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.5475127e-05 |
| 5,158 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD | 5.6510256e-05 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 9,231 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 4.3648789e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1905499e-05 |
| 11,756 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 4.1905499e-05 |
| 4,133 | On Querying Historical K-Cores | 2021 | VLDB | 6.4185206e-05 |
| 6,660 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9672425e-05 |
| 11,045 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1905499e-05 |
| 12,976 | Temporal Relationships in Databases | 1988 | VLDB | 4.1905499e-05 |