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
- 6685
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 5.9364786e-05
- Overall Rank
- 4,756 | 66.95%
- DOI
-
10.1145/3589326
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 15 of 15 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 7,609 |
Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods |
2025 |
VLDB |
4.6921981e-05 |
| 9,272 |
PimPam: Efficient Graph Pattern Matching on Real Processing-in-Memory Hardware |
2024 |
SIGMOD |
4.3621803e-05 |
| 9,915 |
TenGraph: A Tensor-Based Graph Query Engine |
2024 |
VLDB |
4.2520778e-05 |
| 9,936 |
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach |
2025 |
SIGMOD |
4.2441896e-05 |
| 10,085 |
GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries |
2026 |
SIGMOD |
4.1905499e-05 |
| 10,163 |
Enumerating Graph Pattern Matches with ML Oracles |
2026 |
SIGMOD |
4.1905499e-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 |
| 10,304 |
Aquila: A High-Concurrency System for Incremental Graph Query |
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,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 10,854 |
Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining |
2025 |
VLDB |
4.1905499e-05 |
| 10,951 |
gSWORD: GPU-accelerated Sampling for Subgraph Counting |
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 |
| 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 |
| 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,334 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012543633 |
| 1,392 |
Real-time Constrained Cycle Detection in Large Dynamic Graphs |
2018 |
VLDB |
0.00012224015 |
| 1,487 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011691164 |
| 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,746 |
Graphflow: An Active Graph Database |
2017 |
SIGMOD |
0.0001069135 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 1,948 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9938634e-05 |
| 2,172 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.37776e-05 |
| 2,753 |
Mega-KV: A Case for GPUs to Maximize the Throughput of In-Memory Key-Value Stores |
2015 |
VLDB |
8.1722714e-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,882 |
TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data |
2018 |
SIGMOD |
7.9666138e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 3,488 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
7.0460627e-05 |
| 5,490 |
Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming |
2021 |
VLDB |
5.4788004e-05 |
| 5,921 |
RapidFlow: An Efficient Approach to Continuous Subgraph Matching |
2022 |
VLDB |
5.2681722e-05 |
| 6,391 |
An In-Depth Study of Continuous Subgraph Matching |
2022 |
VLDB |
5.0780425e-05 |
Semantically Similar Papers