DBScholar

Back to papers

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
h6e727b20c8230a27
Venue
VLDB
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,705 | 28.03%
DOI
10.14778/3797919.3797926

Incoming Non-self Citations Over Time

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

Authors

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.

Rank Cited Paper Year Venue Pagerank
2,611 Timeline Index: A Unified Data Structure for Processing Queries on Temporal Data in SAP HANA 2013 SIGMOD 8.2275795e-05
3,249 On Querying Historical K-Cores 2021 VLDB 7.4939212e-05
3,921 On Querying Connected Components in Large Temporal Graphs 2023 SIGMOD 6.9237898e-05
4,587 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5161686e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,140 BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space 2011 SIGMOD 5.8734337e-05
6,767 Scalable Time-Range k-Core Query on Temporal Graphs 2023 VLDB 5.6869663e-05
7,374 HINT: A Hierarchical Index for Intervals in Main Memory 2022 SIGMOD 5.5401491e-05
8,645 Efficiently Counting Triangles in Large Temporal Graphs 2025 SIGMOD 5.2954976e-05
8,743 LIT: Lightning-fast In-memory Temporal Indexing 2024 SIGMOD 5.2882178e-05
8,745 A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions 2021 SIGMOD 5.2879425e-05
9,582 PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads 2019 VLDB 5.1571823e-05
10,062 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0875952e-05
11,286 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Semantically Similar Papers