-
Karl Bringmann
(Max-Planck-Institut für Informatik)
Tight Fine-Grained Bounds for Direct Access on Join Queries
-
Sebastian Siebertz
(Universität Bremen)
First-Order Logic with Connectivity Operators: Expressiveness and Model-Checking
-
Matthias Lanzinger
(University of Oxford)
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation
-
Benny Kimelfeld
(Technion)
Quantitative Reasoning about Database Inconsistency
-
Maximilian Merz
(Humboldt-Universität zu Berlin)
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration
-
Nofar Carmeli
(ENS, PSL University)
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
-
Diego Figueira
(CNRS, LaBRI, Université de Bordeaux)
Semantic Optimization of Conjunctive Queries
-
Markus Schmid
(Humboldt-Universität Berlin)
Fine-Grained Complexity of Regular Path Queries
-
Alejandro Grez
(PUC & IMFD, Chile)
Ranked Enumeration of MSO Logic on Words
-
Matthias Niewerth
(Universität Bayreuth)
Maintaining Tree Representations with Forest Algebra Formulas of Logarithmic Height
-
Szymon Torunczyk
(University of Warsaw)
Aggregate Queries on Sparse Databases
-
Pierre Bourhis
(CNRS, CRIStAL)
Provenance for Updates
-
Antoine Amarilli
(Télécom Paris)
The Dynamic Membership Problem for Regular Languages
-
Nicole Schweikardt
(Humboldt-Universität zu Berlin)
A Hardness-Result for Bulk-Updates: A Preliminary Report on Ongoing Work
-
Kick-Off Meeting