Accurate and Fast Approximate Graph Pattern Mining at Scale
Summary: ScaleGPM provides theoretically confidence-guaranteed, stable online convergence detection for sampling-based approximate graph pattern mining. Eager verification and adaptive hybrid sampling address needle-in-a-hay patterns, yielding up to 610K× speedups and billion-scale processing in seconds. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Anna Arpaci-Dusseau (Massachusetts Institute of Technology)
- 2. Zixiang Zhou (Massachusetts Institute of Technology)
- 3. Xuhao Chen (Massachusetts Institute of Technology)
BibTeX Citation
@article{arpacidusseau_vldb25,
title = {{Accurate and Fast Approximate Graph Pattern Mining at Scale}},
author = {Arpaci-Dusseau, Anna and Zhou, Zixiang and Chen, Xuhao},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {2},
pages = {93--107},
doi = {10.14778/3705829.3705831},
url = {https://doi.org/10.14778/3705829.3705831},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,205 | Bound-Tightened Densest Subgraph Discovery on GPU | 2026 | SIGMOD | 5.093636e-05 |
| 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 5.093636e-05 |
| 10,558 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 5.093636e-05 |
| 10,575 | AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling | 2026 | VLDB | 5.093636e-05 |
| 10,909 | LLMLog: Advanced Log Template Generation via LLM-driven Multi-Round Annotation | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 458 | Counting Triangles in Data Streams | 2006 | PODS | 0.0001810876 |
| 809 | Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins | 2019 | VLDB | 0.00013874588 |
| 1,103 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000121583 |
| 1,958 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 9.4093057e-05 |
| 2,288 | Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU | 2020 | VLDB | 8.8025299e-05 |
| 2,522 | Fractal: A General-Purpose Graph Pattern Mining System | 2019 | SIGMOD | 8.4713567e-05 |
| 3,028 | Motivo: fast motif counting via succinct color coding and adaptive sampling | 2019 | VLDB | 7.8349117e-05 |
| 6,363 | The Complexity of Counting Cycles in the Adjacency List Streaming Model | 2019 | PODS | 5.9000002e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,703 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 2 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 3 | 9,749 | Auto-Approximation of Graph Computing | 2014 | VLDB |
| 4 | 1,128 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 5 | 6,325 | Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation | 2021 | SIGMOD |
| 6 | 5,603 | Output Space Sampling for Graph Patterns | 2009 | VLDB |
| 7 | 11,762 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 8 | 8,179 | GraphINC: Graph Pattern Mining at Network Speed | 2023 | SIGMOD |
| 9 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 10 | 10,575 | AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling | 2026 | VLDB |