direct access 1functional dependencies 1information-theoretic bounds 1join queries 1preprocessing complexity 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DB2026
Lexicographic Direct Access with Functional Dependencies
Florent Capelli, Nofar Carmeli, Stefan Mengel
The paper investigates how quickly one can retrieve join query results in lexicographic order from databases that satisfy functional dependencies, providing fine‑grained lower and…
cs.DB2025
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…