Querying Structural Diversity in Streaming Graphs
Summary: Querying per-vertex structural diversity over arbitrary time windows on streaming graphs, addressing limitations of static-only methods. Proposes a compact index with an optimized incremental update algorithm for continuous edge arrivals, cutting index size and update cost; validated on real-world streams. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaiyu Chen (University of New South Wales)
- 2. Dong Wen (University of New South Wales)
- 3. Wenjie Zhang (University of New South Wales)
- 4. Ying Zhang (Zhejiang Gongshang University)
- 5. Xiaoyang Wang (University of New South Wales)
- 6. Xuemin Lin (Shanghai Jiao Tong University)
BibTeX Citation
@article{chen_vldb24,
title = {{Querying Structural Diversity in Streaming Graphs}},
author = {Chen, Kaiyu and Wen, Dong and Zhang, Wenjie and Zhang, Ying and Wang, Xiaoyang and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {5},
pages = {1034--1046},
doi = {10.14778/3641204.3641213},
url = {https://doi.org/10.14778/3641204.3641213},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,977 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 5.2449137e-05 |
| 10,102 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB | 5.0789354e-05 |
| 10,479 | Maintaining Biconnected Components in Streaming Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 4.9793485e-05 |
| 10,712 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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,257 | Regular Path Query Evaluation on Streaming Graphs | 2020 | SIGMOD | 8.7434588e-05 |
| 2,540 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.3274854e-05 |
| 2,669 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 8.1531412e-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 |
| 5,277 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB | 6.1999805e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,290 | Effective Indexing for Dynamic Structural Graph Clustering | 2022 | VLDB |
| 2 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 3 | 2,186 | Graph Stream Summarization: From Big Bang to Big Crunch | 2016 | SIGMOD |
| 4 | 5,477 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 5 | 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 6 | 1,849 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 7 | 7,013 | Incremental Sliding Window Connectivity over Streaming Graphs | 2024 | VLDB |
| 8 | 9,150 | Truss-based Community Search over Streaming Directed Graphs | 2024 | VLDB |
| 9 | 2,540 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |
| 10 | 5,277 | Top-K Structural Diversity Search in Large Networks | 2013 | VLDB |