Tight Width Minimisation of Self-Join-Free Quantified Conjunctive Queries
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
- Sam M. Thompson (ORCID: https://orcid.org/0000-0002-3476-6739)
- Fabio Mogavero (ORCID: https://orcid.org/0000-0002-5140-5783)
- Hubie Chen
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.20845
- Primary Topic
- Advanced Database Systems and Queries
- Type
- preprint