DBScholar

Back to papers

On Querying Historical K-Cores

Summary: Index-based method for historical k-core queries on temporal graphs over a time window. Offers pruning to shrink index size and a linear-time construction algorithm, with experiments on real temporal graphs showing efficient queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h664e5236e8df5ba2
Venue
VLDB
Year
2021
Pagerank
7.4903737e-05
Overall Rank
3,251 | 78.16%
DOI
10.14778/3476249.3476260
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yu_vldb21,
        title = {{On Querying Historical K-Cores}},
        author = {Yu, Michael and Wen, Dong and Qin, Lu and Zhang, Ying and Zhang, Wenjie and Lin, Xuemin},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {11},
        pages = {2033--2045},
        doi = {10.14778/3476249.3476260},
        url = {https://doi.org/10.14778/3476249.3476260},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 22 of 22 citing papers.

Rank Citing Paper Year Venue Pagerank
3,376 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.3556068e-05
3,922 On Querying Connected Components in Large Temporal Graphs 2023 SIGMOD 6.9205122e-05
6,205 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8483206e-05
6,292 QTCS: Efficient Query-Centered Temporal Community Search 2024 VLDB 5.8197041e-05
6,655 Efficient Parallel D-core Decomposition at Scale 2024 VLDB 5.717615e-05
6,772 Scalable Time-Range k-Core Query on Temporal Graphs 2023 VLDB 5.6842741e-05
7,077 Querying Structural Diversity in Streaming Graphs 2024 VLDB 5.6034826e-05
8,324 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 5.3530306e-05
8,889 Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation 2024 VLDB 5.2542808e-05
8,987 On More Efficiently and Versatilely Querying Historical k-Cores 2025 VLDB 5.2424308e-05
9,485 Accelerating Core Decomposition in Billion-Scale Hypergraphs 2025 SIGMOD 5.168414e-05
10,106 Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index 2025 VLDB 5.0765311e-05
10,490 Maintaining Biconnected Components in Streaming Graphs 2026 SIGMOD 4.9769913e-05
10,496 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 4.9769913e-05
10,506 Querying Cohesive Subgraphs in Temporal Graphs 2026 SIGMOD 4.9769913e-05
10,715 Efficient Temporal Subgraph Management: A New Interval Index 2026 VLDB 4.9769913e-05
10,722 Effective Durable Community Search in Large Temporal Graph 2026 VLDB 4.9769913e-05
10,818 Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer 2026 VLDB 4.9769913e-05
11,065 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 2026 VLDB 4.9769913e-05
11,121 Minimum Spanning Tree Maintenance in Dynamic Graphs 2025 SIGMOD 4.9769913e-05
11,132 Bursting Flow Query on Large Temporal Flow Networks 2025 SIGMOD 4.9769913e-05
11,444 Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks 2025 VLDB 4.9769913e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 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