The D-DAL team was created in 2025 as a successor of the LINKS team.
D-DAL’s focus is on the foundations of efficient query evaluation. We investigate data such as text, trees, graphs, and relational data, in the presence of uncertainty, probabilities, incompleteness, heterogeneity, and updates. We wish to support expressive queries featuring recursivity and involving schemas and logical constraints: we investigate how to automatically compile such queries to efficient pipelines using parallelism and hardware acceleration. For this, we use circuits as an abstraction layer, drawing from the fields of circuit complexity and knowledge compilation.
D-DAL’s work is also connected to other areas in computer science such as algorithms (in particular for counting, enumeration, approximation, and incremental maintenance), graph theory, formal languages (automata, transducers, string algorithms), logics (static analysis, finite model theory), artificial intelligence (explainability, factorized representations, symbolic AI), and database theory and practice.