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
- 6843
- Venue
- SIGMOD
- Year
- 2024
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,951 | 23.89%
- 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 |
| 341 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026850764 |
| 502 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021528261 |
| 616 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.00019068362 |
| 627 |
Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors |
2009 |
VLDB |
0.00018959896 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 941 |
Wander Join: Online Aggregation via Random Walks |
2016 |
SIGMOD |
0.00015147831 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,372 |
Random Sampling over Joins Revisited |
2018 |
SIGMOD |
0.0001233325 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,715 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010776518 |
| 1,724 |
A General Framework for Estimating Graphlet Statistics via Random Walk |
2017 |
VLDB |
0.00010736699 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 2,988 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7752463e-05 |
| 3,488 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
7.0460627e-05 |
| 3,644 |
G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching |
2020 |
SIGMOD |
6.8842065e-05 |
| 3,781 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7691344e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 6,063 |
ThunderRW: An In-Memory Graph Random Walk Engine |
2021 |
VLDB |
5.2259989e-05 |
| 6,705 |
Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation |
2021 |
SIGMOD |
4.9507418e-05 |
| 7,157 |
GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection |
2021 |
SIGMOD |
4.8097601e-05 |
| 7,226 |
Self-adaptive Graph Traversal on GPUs |
2021 |
SIGMOD |
4.7910164e-05 |
| 7,304 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7628386e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,640 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 4,525 |
GPU-based Graph Traversal on Compressed Graphs |
2019 |
SIGMOD |
6.1087614e-05 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1905499e-05 |
| 5,483 |
Efficient Load-Balanced Butterfly Counting on GPU |
2022 |
VLDB |
5.4829054e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,570 |
Accelerating Sampling and Aggregation Operations in GNN Frameworks with GPU Initiated Direct Storage Accesses |
2024 |
VLDB |
5.4280174e-05 |
| 4,146 |
Accelerating Triangle Counting on GPU |
2021 |
SIGMOD |
6.4065776e-05 |
| 4,903 |
On Sampling from Massive Graph Streams |
2017 |
VLDB |
5.8403259e-05 |
| 3,488 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
7.0460627e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
4.1905499e-05 |