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: 14268
Venue: VLDB
Year: 2026
Pagerank: 4.1945683e-05
Overall Rank: 10,232 | 28.82%
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,116	Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA	2013	SIGMOD	7.5410386e-05
4,139	On Querying Historical K-Cores	2021	VLDB	6.415046e-05
4,970	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.7945079e-05
5,926	RapidFlow: An Efficient Approach to Continuous Subgraph Matching	2022	VLDB	5.271318e-05
6,243	BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space	2011	SIGMOD	5.1402191e-05
6,395	An In-Depth Study of Continuous Subgraph Matching	2022	VLDB	5.0829204e-05
6,575	Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction	2023	SIGMOD	5.0052259e-05
7,341	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7576413e-05
7,915	HINT: A Hierarchical Index for Intervals in Main Memory	2022	SIGMOD	4.617775e-05
8,580	LIT: Lightning-fast In-memory Temporal Indexing	2024	SIGMOD	4.492241e-05
8,587	A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions	2021	SIGMOD	4.4902253e-05
9,228	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3690661e-05
9,254	PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads	2019	VLDB	4.3690661e-05
9,730	TC-Match: Fast Time-constrained Continuous Subgraph Matching	2024	VLDB	4.2942813e-05
10,632	Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach	2025	VLDB	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
5,854	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.3006473e-05
9,228	Efficiently Counting Triangles in Large Temporal Graphs	2025	SIGMOD	4.3690661e-05
651	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018648572
4,072	Performance and Scalability of Indexed Subgraph Query Processing Methods	2015	VLDB	6.4727847e-05
4,970	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	5.7945079e-05
6,801	Updating Graph Indices with a One-Pass Algorithm	2015	SIGMOD	4.9226813e-05
6,657	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD	4.9720132e-05
7,341	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7576413e-05
4,139	On Querying Historical K-Cores	2021	VLDB	6.415046e-05
11,042	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB	4.1945683e-05