Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Summary: Proposes the first graph-structure-aware indexing for historical butterfly counting in temporal bipartite networks, combining two novel indices whose space scales with counts of butterflies and wedges. Adds index compression and unbiased approximation, proves asymptotic gains on power-law graphs, and achieves up to 10^5x query speedups with modest memory. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiuyang Mang (Chinese University of Hong Kong)
- 2. Jingbang Chen (University of Waterloo)
- 3. Hangrui Zhou (Tsinghua University)
- 4. Yu Gao (Independent)
- 5. Yingli Zhou (Chinese University of Hong Kong)
- 6. Qingyu Shi (Independent)
- 7. Richard Peng (Carnegie Mellon University)
- 8. Yixiang Fang (Chinese University of Hong Kong)
- 9. Chenhao Ma (Chinese University of Hong Kong)
BibTeX Citation
@article{mang_vldb25,
title = {{Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index}},
author = {Mang, Qiuyang and Chen, Jingbang and Zhou, Hangrui and Gao, Yu and Zhou, Yingli and Shi, Qingyu and Peng, Richard and Fang, Yixiang and Ma, Chenhao},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {6},
pages = {1607--1620},
doi = {10.14778/3725688.3725693},
url = {https://doi.org/10.14778/3725688.3725693},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 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 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 2 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 3 | 5,674 | Efficient Core Maintenance in Large Bipartite Graphs | 2023 | SIGMOD |
| 4 | 11,269 | Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph | 2024 | VLDB |
| 5 | 5,317 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB |
| 6 | 5,427 | I/O-Efficient Butterfly Counting at Scale | 2023 | SIGMOD |
| 7 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |
| 9 | 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |
| 10 | 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |