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
- 6537
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.3319911e-05
- Overall Rank
- 5,773 | 59.84%
- 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.00065491112 |
| 461 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022499343 |
| 589 |
Massive Graph Triangulation |
2013 |
SIGMOD |
0.00019576567 |
| 891 |
Maximum Biclique Search at Billion Scale |
2020 |
VLDB |
0.00015564292 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,215 |
The Input/Output Complexity of Triangle Enumeration |
2014 |
PODS |
9.2717602e-05 |
| 2,718 |
Anonymizing Bipartite Graph Data using Safe Groupings |
2008 |
VLDB |
8.2409647e-05 |
| 4,171 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3879236e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,459 |
Efficient Bi-triangle Counting for Large Bipartite Networks |
2021 |
VLDB |
6.1651553e-05 |
| 12,041 |
I/O Efficient: Computing SCCs in Massive Graphs |
2013 |
SIGMOD |
4.1945683e-05 |
| 7,788 |
Towards Distributed Bitruss Decomposition on Bipartite Graphs |
2022 |
VLDB |
4.651009e-05 |
| 11,062 |
Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph |
2024 |
VLDB |
4.1945683e-05 |
| 4,171 |
Butterfly Counting on Uncertain Bipartite Graphs |
2022 |
VLDB |
6.3879236e-05 |
| 5,474 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4881807e-05 |
| 10,563 |
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index |
2025 |
VLDB |
4.1945683e-05 |
| 7,451 |
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks |
2023 |
SIGMOD |
4.7263711e-05 |
| 4,481 |
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs |
2024 |
VLDB |
6.1485442e-05 |
| 1,484 |
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks |
2019 |
VLDB |
0.00011714263 |