2 citations · 2 across the 4 of their papers we have counts for
4 papers
Size Bounds for CQs Under Acyclic Constraints
Stefan Mengel, Andrei Romashchenko
We study size bounds for conjunctive query (CQ) results which in recent years have played a crucial role in database theory. In particular, we compare the so-called entropic bound…
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…
Lower Bounds for Conjunctive Query Evaluation
Stefan Mengel
In this tutorial, we will survey known results on the complexity of conjunctive query evaluation in different settings, ranging from Boolean queries over counting to more complex m…
An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages
Hélène Fargier, Stefan Mengel, Jérôme Mengin
Conditional preference statements have been used to compactly represent preferences over combinatorial domains. They are at the core of CP-nets and their generalizations, and lexic…