GraphMatch: Subgraph Query Processing on Steroids
Summary: GraphMatch: hardware-accelerated subgraph query engine using WCOJ and MaxStep, a novel hardware-parallel set-intersection algorithm for efficient multi-set intersections. MaxStep dataflow yields 6.98×–17.08× speedups vs GraphFlow/RapidMatch and orders-of-magnitude gains over FAST on labeled graphs. (summarized by gpt-5-mini on Feb 11 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jonas Dann (ETH Zurich)
- 2. Tobias Götz (SAP; Technical University of Munich)
- 3. Daniel Ritter (SAP)
- 4. Jana Giceva (Technical University of Munich)
- 5. Holger Fröning (Heidelberg University)
- 6. Gustavo Alonso (ETH Zurich)
BibTeX Citation
@inproceedings{dann_sigmod26,
title = {{GraphMatch: Subgraph Query Processing on Steroids}},
author = {Dann, Jonas and Götz, Tobias and Ritter, Daniel and Giceva, Jana and Fröning, Holger and Alonso, Gustavo},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3769797},
url = {https://dl.acm.org/doi/10.1145/3769797},
year = {2026}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,823 | X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs | 2026 | VLDB | 4.9769913e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 22 of 22 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,012 | Efficient GPU-Accelerated Subgraph Matching | 2023 | SIGMOD |
| 2 | 1,180 | In-Memory Subgraph Matching: An In-depth Study | 2020 | SIGMOD |
| 3 | 289 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 4 | 10,251 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 5 | 10,750 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB |
| 6 | 11,212 | cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns | 2025 | SIGMOD |
| 7 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 8 | 10,432 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 9 | 2,017 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 10 | 10,756 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |