gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
Summary: gMatch enables GPU subgraph matching with fine-grained execution, warp-level batch exploration, and lightweight load balancing, reducing memory overhead and thread underutilization. It outscales prior matchers and small-pattern miners on large queries and datasets. (summarized by gpt-5.6-luna on Jul 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Weitian Chen (Shanghai Jiao Tong University)
- 2. Shixuan Sun (Shanghai Jiao Tong University)
- 3. Cheng Chen (ByteDance)
- 4. Yongmin Hu (ByteDance)
- 5. Yingqian Hu (ByteDance)
- 6. Minyi Guo (Guizhou University)
BibTeX Citation
@article{chen_vldb26,
title = {{gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs}},
author = {Chen, Weitian and Sun, Shixuan and Chen, Cheng and Hu, Yongmin and Hu, Yingqian and Guo, Minyi},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {8},
pages = {1740--1753},
doi = {10.14778/3811243.3811248},
url = {https://doi.org/10.14778/3811243.3811248},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,107 | GuP: Fast Subgraph Matching by Guard-based Pruning | 2023 | SIGMOD |
| 2 | 2,478 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 3 | 10,498 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 4 | 9,882 | Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences | 2025 | VLDB |
| 5 | 11,270 | cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns | 2025 | SIGMOD |
| 6 | 10,952 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 7 | 10,811 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB |
| 8 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 9 | 10,303 | GraphMatch: Subgraph Query Processing on Steroids | 2026 | SIGMOD |
| 10 | 3,020 | Efficient GPU-Accelerated Subgraph Matching | 2023 | SIGMOD |