gMatch delivers better performance and scalability for subgraph matching on GPUs via fine-grained scheduling and warp optimizations, succeeding on large queries where prior systems like STMatch and EGSM fail.
Tamer Özsu, Lin Hu, and Fan Zhang
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
gMatch delivers better performance and scalability for subgraph matching on GPUs via fine-grained scheduling and warp optimizations, succeeding on large queries where prior systems like STMatch and EGSM fail.