BⓈX: Subgraph Matching with Batch Backtracking Search

Y Lu, Z Zhang, W Zheng - Proceedings of the ACM on Management of …, 2025 - dl.acm.org
Subgraph matching is a fundamental problem in graph analysis. Recently, many algorithms
have been developed, often using classic backtracking search. This traditional backtracking …

[PDF][PDF] Rethinking MIMD-SIMD Interplay for Analytical Query Processing in In-Memory Database Engines

L Schmidt, J Pietrzyk, J Hildebrandt, A Krause… - memory - vldb.org
Exploiting parallelism is the name of the game for executing analytical queries with low
latency in in-memory database engines. Most prominently, modern general-purpose CPUs …

Exploiting Data-Level-Parallelism for Modern In-Memory OLAP Query Engines

J Pietrzyk - 2024 - tud.qucosa.de
Abstract (DE) Kontinuierlich wachsende Mengen an zu verwaltenden Daten und komplexer
werdende analytische Anfragen erfordern eine stetige Weiterentwicklung und Verbesserung …