Abstract: Subgraph matching is a core primitive in graph analytics, yet it remains difficult to scale due to its combinatorial complexity and highly irregular memory access patterns. Despite decades ...