Back to papers
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs
Summary: GPU-based subgraph enumeration scales beyond GPU memory by partitioning graphs into chunks processed sequentially. To avoid cross-partition redundancy and PCIe transfers, this work uses a shared execution model to yield correct global instances.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 5915
- Venue
- SIGMOD
- Year
- 2020
- Pagerank
- 7.0460627e-05
- Overall Rank
- 3,488 | 75.76%
- DOI
-
10.1145/3318464.3389699
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 5,502 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.4730826e-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,609 |
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods |
2025 |
VLDB |
4.6921981e-05 |
| 7,711 |
Accelerating Exact Constrained Shortest Paths on GPUs |
2021 |
VLDB |
4.6670758e-05 |
| 7,936 |
Fast Local Subgraph Counting |
2024 |
VLDB |
4.6089395e-05 |
| 8,269 |
GraphINC: Graph Pattern Mining at Network Speed |
2023 |
SIGMOD |
4.5406632e-05 |
| 9,106 |
TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database |
2023 |
SIGMOD |
4.3909979e-05 |
| 9,206 |
Themis: A GPU-accelerated Relational Query Execution Engine |
2025 |
VLDB |
4.3695556e-05 |
| 9,272 |
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware |
2024 |
SIGMOD |
4.3621803e-05 |
| 10,079 |
Fast Optimal Group Steiner Tree Search using GPUs |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,163 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,264 |
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination |
2026 |
VLDB |
4.1905499e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
4.1905499e-05 |
| 10,288 |
AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling |
2026 |
VLDB |
4.1905499e-05 |
| 10,320 |
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching |
2026 |
VLDB |
4.1905499e-05 |
| 10,323 |
Efficient Temporal Edge-Core Maintenance in Streaming Graphs |
2026 |
VLDB |
4.1905499e-05 |
| 10,496 |
Rule-Based Graph Cleaning with GPUs on a Single Machine |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,523 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
4.1905499e-05 |
| 10,867 |
Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment |
2025 |
VLDB |
4.1905499e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1905499e-05 |
| 10,982 |
Atom: An Efficient Query Serving System for Embedding-based Knowledge Graph Reasoning with Operator-level Batching |
2024 |
SIGMOD |
4.1905499e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 25 of 25 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 55 |
Efficiently Updating Materialized Views |
1986 |
SIGMOD |
0.00065687017 |
| 106 |
Truss Decomposition in Massive Networks |
2012 |
VLDB |
0.00048373761 |
| 395 |
One Trillion Edges: Graph Processing at Facebook-Scale |
2015 |
VLDB |
0.00024440144 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 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 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 1,630 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.00011073047 |
| 1,746 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.0001069135 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,545 |
Efficient Distributed Memory Management with RDMA and Caching |
2018 |
VLDB |
8.5616487e-05 |
| 2,787 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.1219297e-05 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 4,525 |
GPU-based Graph Traversal on Compressed Graphs |
2019 |
SIGMOD |
6.1087614e-05 |
| 4,578 |
Accelerating Dynamic Graph Analytics on GPUs |
2018 |
VLDB |
6.0651154e-05 |
| 5,315 |
Clustering Stream Data by Exploring the Evolution of Density Mountain |
2018 |
VLDB |
5.5702177e-05 |
| 5,562 |
Fast Failure Recovery for Main-Memory DBMSs on Multicores |
2017 |
SIGMOD |
5.4343594e-05 |
| 5,670 |
BriskStream: Scaling Data Stream Processing on Shared-Memory Multicore Architectures |
2019 |
SIGMOD |
5.3799054e-05 |
| 5,693 |
Parallel Personalized PageRank on Dynamic Graphs |
2018 |
VLDB |
5.3683002e-05 |
| 5,809 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.3175972e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 5,809 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.3175972e-05 |
| 3,600 |
Parallel Local Graph Clustering |
2016 |
VLDB |
6.9285467e-05 |
| 4,525 |
GPU-based Graph Traversal on Compressed Graphs |
2019 |
SIGMOD |
6.1087614e-05 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 5,002 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.7610359e-05 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 4,756 |
Efficient GPU-Accelerated Subgraph Matching |
2023 |
SIGMOD |
5.9364786e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1905499e-05 |
| 10,276 |
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs |
2026 |
VLDB |
4.1905499e-05 |
| 2,799 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
8.109137e-05 |