Efficient Temporal Subgraph Management: A New Interval Index
Summary: New linear-size interval index for temporal subgraph management: supports subgraphs contained in or containing a query window with near-optimal query time. Designed for dense, overlapping, update-heavy workloads; incremental maintenance is output-sensitive for inserts and O(1) for deletes. (summarized by gpt-5.4-mini on Apr 12 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Dian Ouyang (Guangdong University of Technology)
- 2. Yikun Wang (University of New South Wales)
- 3. Dong Wen (University of New South Wales)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Yaping Liu (Guangdong University of Technology)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@article{ouyang_vldb26,
title = {{Efficient Temporal Subgraph Management: A New Interval Index}},
author = {Ouyang, Dian and Wang, Yikun and Wen, Dong and Zhang, Wenjie and Liu, Yaping and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {6},
pages = {1170--1183},
doi = {10.14778/3797919.3797926},
url = {https://doi.org/10.14778/3797919.3797926},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,375 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD |
| 2 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 3 | 3,477 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB |
| 4 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 5 | 6,631 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD |
| 6 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 7 | 6,635 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 8 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |
| 9 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 10 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |