On More Efficiently and Versatilely Querying Historical k-Cores
Summary: 'Core time shell' and MCTS-index expose hierarchical core-time structure to avoid full-vertex scans, yielding approximately optimal historical k-core query time with PHC-like space. MCTS also enables a novel 'when' query and empirically outperforms PHC. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhi Wang (Wuhan University)
- 2. Ming Zhong (Wuhan University)
- 3. Yuanyuan Zhu (Wuhan University)
- 4. Tieyun Qian (Wuhan University)
- 5. Mengchi Liu (South China Normal University)
- 6. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{wang_vldb25,
title = {{On More Efficiently and Versatilely Querying Historical k-Cores}},
author = {Wang, Zhi and Zhong, Ming and Zhu, Yuanyuan and Qian, Tieyun and Liu, Mengchi and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {5},
pages = {1335--1347},
doi = {10.14778/3718057.3718063},
url = {https://doi.org/10.14778/3718057.3718063},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,266 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 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 | 8,687 | MCR-Tree: An Efficient Index for Multi-dimensional Core Search | 2024 | SIGMOD |
| 2 | 6,156 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB |
| 3 | 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 4 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 5 | 8,718 | Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation | 2024 | VLDB |
| 6 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 7 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 9 | 6,635 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 10 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |