Efficient Index for Temporal Core Queries over Bipartite Graphs
Summary: Introduces time-windowed (α,β)-core queries for temporal bipartite graphs, capturing cross-layer degree cohesion over time. A qualified-window DAG hierarchy and space-optimized index support efficient queries and dynamic edge updates. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anxin Tian (Hong Kong University of Science and Technology)
- 2. Alexander Zhou (Hong Kong University of Science and Technology)
- 3. Yue Wang (Shenzhen University)
- 4. Xun Jian (Hong Kong University of Science and Technology)
- 5. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{tian_vldb24,
title = {{Efficient Index for Temporal Core Queries over Bipartite Graphs}},
author = {Tian, Anxin and Zhou, Alexander and Wang, Yue and Jian, Xun and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {11},
pages = {2813--2825},
doi = {10.14778/3681954.3681965},
url = {https://doi.org/10.14778/3681954.3681965},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,273 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD | 5.093636e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 17 of 17 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 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 2 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 3 | 8,812 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB |
| 4 | 6,635 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 5 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 6 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 7 | 5,044 | Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs | 2021 | VLDB |
| 8 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |
| 9 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 10 | 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |