Back to papers
I/O-Efficient Butterfly Counting at Scale
Summary: I/O-efficient butterfly counting on hierarchical memory; semi-witnessing counts butterflies via small subgraph witnesses, not full exploration. IOBufs nears I/O-optimal bounds, parallelizes well, and outperforms EMRC/BFC-EM while scaling to 37B edges and ~10^18 butterflies.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6538
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.3268721e-05
- Overall Rank
- 5,782 | 59.82%
- DOI
-
10.1145/3588714
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 57 |
Discovering Large Dense Subgraphs in Massive Graphs |
2005 |
VLDB |
0.00065421423 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 588 |
Massive Graph Triangulation |
2013 |
SIGMOD |
0.00019588834 |
| 888 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015549756 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,219 |
The Input/Output Complexity of Triangle Enumeration |
2014 |
PODS |
9.2653868e-05 |
| 2,721 |
Anonymizing Bipartite Graph Data using Safe Groupings |
2008 |
VLDB |
8.2331032e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 4,554 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0839934e-05 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,460 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1592411e-05 |
| 12,049 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1905499e-05 |
| 7,789 |
Towards Distributed Bitruss Decomposition on Bipartite Graphs |
2022 |
VLDB |
4.6465475e-05 |
| 11,065 |
Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph |
2024 |
VLDB |
4.1905499e-05 |
| 4,158 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3898204e-05 |
| 5,483 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4829054e-05 |
| 10,572 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1905499e-05 |
| 7,450 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks |
2023 |
SIGMOD |
4.7218383e-05 |
| 4,484 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1426351e-05 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011705344 |