Tobias Goetz

Tobias Goetz

Auto-generated profile, based on publicly available information

Tobias Goetz

TU Munich, Munich, Germany

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 December 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
JDJonas Dann
Jonas Dann
TGTobias Goetz
Tobias Goetz
DRDaniel Ritter
Daniel Ritter
JGJana Giceva
Jana Giceva
HFHolger Fröning
Holger Fröning
GAGustavo Alonso
Gustavo Alonso
Recently, graphs are becoming increasingly interesting in the context of large language models and as overlays for commercial databases. Subgraph query processing is an especially challenging workload for graph analysis that is bottlenecked by slow set intersection performance on CPUs. Previous work has shown the viability of utilizing hardware acceleration for related domains like graph and relational join processing. We propose GraphMatch, a hardware-accelerated subgraph query processing system based on worst-case optimal joins (WCOJ). For efficient processing of various data and query graphs, we propose a novel set intersection algorithm, called MaxStep, that leverages hardware parallelism. GraphMatch combines MaxStep operators in a data flow architecture which efficiently solves multi-set intersections in subgraph query processing, superior to CPU-based approaches. GraphMatch achieves an average speedup of over 6.98x and 17.08x, compared to the state-of-the-art WCOJ-based systems GraphFlow and RapidMatch, respectively. On labeled graphs, GraphMatch outperforms the fastest subgraph query processing accelerator FAST by orders of magnitude.