Effective Indexing for Dynamic Structural Graph Clustering
Summary: Presents a parameter-free index for approximate SCAN clustering on dynamic graphs under Jaccard similarity. Bottom-k vertex sketches and bucketing enable efficient updates, with probabilistic guarantees and up to 100× speedups over prior indexing. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Fangyuan Zhang (Chinese University of Hong Kong)
- 2. Sibo Wang (Chinese University of Hong Kong)
BibTeX Citation
@article{zhang_vldb22,
title = {{Effective Indexing for Dynamic Structural Graph Clustering}},
author = {Zhang, Fangyuan and Wang, Sibo},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {11},
pages = {2908--2920},
doi = {10.14778/3551793.3551840},
url = {https://doi.org/10.14778/3551793.3551840},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD | 5.6127752e-05 |
| 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 5.093636e-05 |
| 10,954 | Approximate 2-hop neighborhoods on incremental graphs: An efficient lazy approach | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 364 | Graph Clustering Based on Structural/Attribute Similarities | 2009 | VLDB | 0.00020054172 |
| 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.5183361e-05 |
| 2,839 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB | 8.066541e-05 |
| 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD | 6.7459836e-05 |
| 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD | 6.7107949e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,796 | Reachability Queries on Large Dynamic Graphs: A Total Order Approach | 2014 | SIGMOD |
| 2 | 9,690 | Searching and Detecting Structurally Similar Communities in Large Heterogeneous Information Networks | 2025 | VLDB |
| 3 | 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD |
| 4 | 8,477 | Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed Graphs | 2025 | SIGMOD |
| 5 | 2,839 | SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs | 2015 | VLDB |
| 6 | 10,448 | Efficient Influential Community Search over Dynamic Graphs | 2026 | SIGMOD |
| 7 | 4,358 | Parallel Index-Based Structural Graph Clustering and Its Approximation | 2021 | SIGMOD |
| 8 | 9,444 | An Efficient Algorithm for Distance-based Structural Graph Clustering | 2023 | SIGMOD |
| 9 | 4,423 | Dynamic Structural Clustering on Graphs | 2021 | SIGMOD |
| 10 | 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB |