Optimizing Nested Recursive Queries

MAXIMILIAN SCHLEICH, RelationalAI, USA HUNG NGO, RelationalAI, USA Datalog is a declarative programming language that has gained popularity in various domains due to its simplicity, expressiveness, and eciency. But "pure" Datalog is limited to monotone queries, and cannot be used in most practical applications. For that reason, newer systems are relaxing the language by allowing non-monotone queries to be freely combined with recursion. But by departing from the elegant xpoint semantics of pure datalog, these systems often result in inecient query execution, for example they perform redundant computations, or use redundant storage. In this paper, we propose Temporel, a system that allows recursion to be freely combined with non-monotone operators. Temporel optimizes the program by compiling it into a novel intermediate representation that we call TempoDL. Our experimental results show that our system outperforms a state-of-the-art Datalog engine as well as a vectorized and a compiled in-memory database system for a wide range of applications from machine learning to graph processing.