Back to papers
gSWORD: GPU-accelerated Sampling for Subgraph Counting
Summary: gSWORD accelerates iterative subgraph-count sampling on GPUs, using sample inheritance and warp streaming to tame irregular workloads and scale to millions of samples per second. A CPU-GPU co-processing pipeline overlaps sampling and enumeration to mitigate underestimation.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6842
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,948 | 23.84%
- DOI
-
10.1145/3639288
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 23 of 23 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 506 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021475362 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 629 |
Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors |
2009 |
VLDB |
0.00018942366 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 943 |
Wander Join: Online Aggregation via Random Walks |
2016 |
SIGMOD |
0.00015145883 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,369 |
Random Sampling over Joins Revisited |
2018 |
SIGMOD |
0.00012339777 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,740 |
A General Framework for Estimating Graphlet Statistics via Random Walk |
2017 |
VLDB |
0.0001071792 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 3,001 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7404487e-05 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |
| 3,646 |
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching |
2020 |
SIGMOD |
6.8853079e-05 |
| 3,778 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7747398e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 4,968 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.7956205e-05 |
| 6,058 |
ThunderRW: An In-Memory Graph Random Walk Engine |
2021 |
VLDB |
5.2310254e-05 |
| 6,704 |
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation |
2021 |
SIGMOD |
4.9554912e-05 |
| 7,158 |
GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection |
2021 |
SIGMOD |
4.8143783e-05 |
| 7,225 |
Self-adaptive Graph Traversal on GPUs |
2021 |
SIGMOD |
4.7956162e-05 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,799 |
CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor |
2024 |
VLDB |
5.3219334e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 4,522 |
GPU-based Graph Traversal on Compressed Graphs |
2019 |
SIGMOD |
6.1146374e-05 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 5,474 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4881807e-05 |
| 4,968 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.7956205e-05 |
| 5,561 |
Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses |
2024 |
VLDB |
5.4332062e-05 |
| 4,168 |
Accelerating Triangle Counting on GPU |
2021 |
SIGMOD |
6.391271e-05 |
| 4,898 |
On Sampling from Massive Graph Streams |
2017 |
VLDB |
5.8459467e-05 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |