OPT: A New Framework for Overlapped and Parallel Triangulation in Large-scale Graphs
Summary: OPT is a disk-based, overlapped, parallel triangulation framework for billion-scale graphs, achieving near-ideal cost by CPU–I/O overlap. It uses internal/external triangles, macro/micro overlaps, and vertex- and edge-iterator models, with linear speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jinha Kim
- 2. Wook-Shin Han
- 3. Sangyeon Lee
- 4. Kyungyeol Park
- 5. Hwanjo Yu
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,530 | Truss-based Community Search: a Truss-equivalence Based Indexing Approach | 2017 | VLDB | 0.00011495611 |
| 2,910 | DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine | 2016 | SIGMOD | 7.9266529e-05 |
| 3,063 | Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges | 2021 | SIGMOD | 7.6321424e-05 |
| 4,798 | Ringo: Interactive Graph Analytics on Big-Memory Machines | 2015 | SIGMOD | 5.9121709e-05 |
| 4,879 | Approximately Counting Triangles in Large Graph Streams Including Edge Duplicates with a Fixed Memory Usage | 2018 | VLDB | 5.8575676e-05 |
| 5,518 | Hypergraph Motifs: Concepts, Algorithms, and Discoveries | 2020 | VLDB | 5.4621935e-05 |
| 8,540 | On Asymptotic Cost of Triangle Listing in Random Graphs | 2017 | PODS | 4.4937074e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,041 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1945683e-05 |
| 9,091 | Efficiently Enumerating Minimal Triangulations | 2017 | PODS | 4.39823e-05 |
| 5,017 | TurboGraph++: A Scalable and Fast Graph Analytics System | 2018 | SIGMOD | 5.7574792e-05 |
| 392 | Counting Triangles in Data Streams | 2006 | PODS | 0.00024556183 |
| 9,072 | GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations | 2015 | VLDB | 4.4024417e-05 |
| 3,975 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 6.5736847e-05 |
| 5,046 | Better Algorithms for Counting Triangles in Data Streams | 2016 | PODS | 5.7405307e-05 |
| 110 | On Triangulation-based Dense Neighborhood Graph Discovery | 2011 | VLDB | 0.00047892924 |
| 4,168 | Accelerating Triangle Counting on GPU | 2021 | SIGMOD | 6.391271e-05 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |