Year: 2026
Type: preprint
Abstract: Query minimisation is a classical problem in database theory and the width of a formula, defined as the maximum number of free variables over all subformulae, is a central measure for query evaluation. We study width minimisation for a subclass of quantified conjunctive queries (QCQs), namely self-join-free QCQs. For this subclass, we show that rewriting optimality coincides with semantic optimality: given a query $ϕ$, the minimum-width query obtainable from $ϕ$ by applying natural and established rewriting rules has minimum width among all first-order formulae logically equivalent to $ϕ$. As a consequence, the width of a self-join-free QCQ can be optimised by a logical-equivalence-preserving rewriting algorithm.
Authors: Chen, Hubie, Mogavero, Fabio, Thompson, Sam M.
Institutions: University of London, University of Naples Federico II
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235292921
