2 citations · 2 across the 4 of their papers we have counts for
Showing 2026 · cs.DBShow all
2 papers · 2 filters
cs.DB2026
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…
cs.DB2026
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…