The Fixpoint Bounded-Variable Queries are PSPACE-Complete
AbstractWe study complexity of the evaluation of fixpoint bounded-variable
queries in relational databases. We exhibit a finite database such
that the problem whether a closed fixpoint formula using only 2 individual variables is satisfied in this database is PSPACE-complete. This clarifies the issues raised by Moshe Vardi in [Var95]. We study also the complexity of query evaluation for a number of restrictions of fixpoint logic. In particular we exhibit a sublogic for which the upper bound postulated by Vardi holds.
How to Cite
Dziembowski, S. (1996). The Fixpoint Bounded-Variable Queries are PSPACE-Complete. BRICS Report Series, 3(41). https://doi.org/10.7146/brics.v3i41.20023
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.