Back to papers
Efficient GPU-Accelerated Subgraph Matching
Summary: EGSM advances GPU-based subgraph matching with a Cuckoo Trie for candidate maintenance and on-the-fly vertex ordering using estimated counts. Memory-aware hybrid BFS/DFS enumeration mitigates explosion and memory pressure, outperforming GSI and CuTS.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6684
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.7956205e-05
- Overall Rank
- 4,968 | 65.44%
- DOI
-
10.1145/3589326
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 6,281 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.128862e-05 |
| 7,607 |
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods |
2025 |
VLDB |
4.6967024e-05 |
| 9,267 |
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware |
2024 |
SIGMOD |
4.3663649e-05 |
| 9,916 |
TenGraph: A Tensor-Based Graph Query Engine |
2024 |
VLDB |
4.2561557e-05 |
| 9,935 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2482599e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,163 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,270 |
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration |
2026 |
VLDB |
4.1945683e-05 |
| 10,292 |
Aquila: A High-Concurrency System for Incremental Graph Query |
2026 |
VLDB |
4.1945683e-05 |
| 10,486 |
Rule-Based Graph Cleaning with GPUs on a Single Machine |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,514 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 10,850 |
Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining |
2025 |
VLDB |
4.1945683e-05 |
| 10,948 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
2024 |
SIGMOD |
4.1945683e-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 |
| 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 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,394 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.0001221552 |
| 1,500 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011674394 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,756 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.00010664542 |
| 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 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,751 |
Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores |
2015 |
VLDB |
8.1760621e-05 |
| 2,801 |
Scalable Distributed Subgraph Enumeration |
2017 |
VLDB |
8.0992955e-05 |
| 2,910 |
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine |
2016 |
SIGMOD |
7.9266529e-05 |
| 2,912 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9130459e-05 |
| 2,997 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.7559339e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |
| 5,499 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4750222e-05 |
| 5,926 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.271318e-05 |
| 6,395 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0829204e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 10,084 |
GraphMatch: Subgraph Query Processing on Steroids |
2026 |
SIGMOD |
4.1945683e-05 |
| 651 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018648572 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |
| 10,514 |
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns |
2025 |
SIGMOD |
4.1945683e-05 |