跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20845 · v1

Tight Width Minimisation of Self-Join-Free Quantified Conjunctive Queries

首次提交 2026-11-16 18:22
版本更新 2026-11-16 18:22
雷达观测 2026-11-17 17:11
arXiv ↗PDF ↗

摘要

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.

作者备注:To appear at PODS 2027

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 18:22 · 最新观测版本

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.

查看此版本解读 →查看此版本原文 ↗