DBScholar

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
6904
Venue
SIGMOD
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,165 | 23.40%
DOI
10.1145/3639288

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{ye_sigmod24,
        title = {{gSWORD: GPU-accelerated Sampling for Subgraph Counting}},
        author = {Ye, Chang and Li, Yuchen and Sun, Shixuan and Guo, Wentian},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3639288},
        url = {https://dl.acm.org/doi/10.1145/3639288},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
9,948 uBlade: Efficient Batch Processing for Uncertain Graph Queries 2024 SIGMOD 5.1915905e-05
Previous Page 1 / 1 Next

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
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
388 Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors 2009 VLDB 0.00019410042
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,958 A General Framework for Estimating Graphlet Statistics via Random Walk 2017 VLDB 9.4093057e-05
2,607 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3489531e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,194 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6491858e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
6,003 ThunderRW: An In-Memory Graph Random Walk Engine 2021 VLDB 6.0130964e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
6,924 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.738697e-05
7,011 GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection 2021 SIGMOD 5.7263348e-05
7,491 Self-adaptive Graph Traversal on GPUs 2021 SIGMOD 5.6059269e-05
Previous Page 1 / 1 Next

Semantically Similar Papers