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)

Paper ID: 14269
Venue: VLDB
Year: 2026
Pagerank: 4.1905499e-05
Overall Rank: 10,232 | 28.89%
DOI: 10.14778/3797919.3797926

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

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.

Rank	Cited Paper	Year	Venue	Pagerank
3,121	Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA	2013	SIGMOD	7.532465e-05
4,133	On Querying Historical K-Cores	2021	VLDB	6.4185206e-05
4,726	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.9632682e-05
5,921	RapidFlow: An Efficient Approach to Continuous Subgraph Matching	2022	VLDB	5.2681722e-05
6,249	BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space	2011	SIGMOD	5.132996e-05
6,283	Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction	2023	SIGMOD	5.1234789e-05
6,391	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	5.0780425e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
7,916	HINT: A Hierarchical Index for Intervals in Main Memory	2022	SIGMOD	4.6133471e-05
8,577	LIT: Lightning-fast In-memory Temporal Indexing	2024	SIGMOD	4.4879347e-05
8,583	A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions	2021	SIGMOD	4.4859208e-05
9,231	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3648789e-05
9,261	PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads	2019	VLDB	4.3648789e-05
9,729	TC-Match: Fast Time-constrained Continuous Subgraph Matching	2024	VLDB	4.2901665e-05
10,640	Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach	2025	VLDB	4.1905499e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
5,903	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.2757528e-05
9,231	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3648789e-05
648	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018688754
3,894	Performance and Scalability of Indexed Subgraph Query Processing Methods	2015	VLDB	6.6531173e-05
4,726	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.9632682e-05
6,870	Updating Graph Indices with a One-Pass Algorithm	2015	SIGMOD	4.8974284e-05
6,660	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD	4.9672425e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
4,133	On Querying Historical K-Cores	2021	VLDB	6.4185206e-05
11,045	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1905499e-05