14 citations · 26 across the 14 of their papers we have counts for
6 papers · 1 filter
Lexicographic Direct Access with Functional Dependencies
Florent Capelli, Nofar Carmeli, Stefan Mengel
We study the complexity of lexicographic direct access to join query answers over databases that satisfy functional dependencies (FDs). More precisely, we give fine-grained lower a…
Dynamic direct access of MSO query evaluation over strings
Pierre Bourhis, Florent Capelli, Stefan Mengel +1
We study the problem of evaluating a Monadic Second Order (MSO) query over strings under updates in the setting of direct access. We present an algorithm that, given an MSO query w…
Ranked Enumeration for MSO on Trees via Knowledge Compilation
Antoine Amarilli, Pierre Bourhis, Florent Capelli +1
We study the problem of enumerating the satisfying assignments for circuit classes from knowledge compilation, where assignments are ranked in a specific order. In particular, we s…
Linear Programs with Conjunctive Database Queries
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language LP(CQ) for specifying li…
Solving linear programs on factorized databases
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the so…
Connecting Knowledge Compilation Classes and Width Parameters
Antoine Amarilli, Florent Capelli, Mikaël Monet +1
The field of knowledge compilation establishes the tractability of many tasks by studying how to compile them to Boolean circuit classes obeying some requirements such as structure…