A Decidable Case of Query Determinacy: Project-Select Views
Databases
2024-11-14 v1
Abstract
Query determinacy is decidable for project-select views and a project-select-join query with no self joins, as long as the selection predicates are in a first-order theory for which satisfiability is decidable.
Cite
@article{arxiv.2411.08874,
title = {A Decidable Case of Query Determinacy: Project-Select Views},
author = {Wen Zhang and Aurojit Panda and Mooly Sagiv and Scott Shenker},
journal= {arXiv preprint arXiv:2411.08874},
year = {2024}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Logical Queries over Views: Decidability and Expressiveness
James Bailey, Guozhu Dong, Anthony Widjaja To
2008-12-18
Databases · Computer Science
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
2015-12-08
Logic in Computer Science · Computer Science
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Ian Pratt-Hartmann
2024-04-24
Databases · Computer Science
The First Order Truth behind Undecidability of Regular Path Queries Determinacy
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2019-01-29
Logic in Computer Science · Computer Science
On monotonic determinacy and rewritability for recursive queries and views
Michael Benedikt, Stanislav Kikot, Piotr Ostropolski-Nalewaja, Miguel Romero
2020-03-13
Databases · Computer Science
Well-Definedness and Semantic Type-Checking in the Nested Relational Calculus and XQuery
Jan Van den Bussche, Dirk Van Gucht, Stijn Vansummeren
2007-05-23
Logic in Computer Science · Computer Science
Negated String Containment is Decidable (Technical Report)
Vojtěch Havlena, Michal Hečko, Lukáš Holík, Ondřej Lengál
2025-07-02
Logic in Computer Science · Computer Science
Order-Invariance of Two-Variable Logic is Decidable
Thomas Zeume, Frederik Harwath
2016-04-21
Formal Languages and Automata Theory · Computer Science
Some Remarks on First-Order Definable Tree Languages
Achim Blumensath
2024-07-02
Databases · Computer Science
Can One Escape Red Chains? Regular Path Queries Determinacy is Undecidable
Grzegorz Głuch, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2018-02-06
Logic in Computer Science · Computer Science
Unary negation
Luc Segoufin, Balder ten Cate
2015-07-01
Databases · Computer Science
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
2015-12-08
Programming Languages · Computer Science
Variant-Based Decidable Satisfiability in Initial Algebras with Predicates
Raúl Gutiérrez, José Meseguer
2017-09-18
Logic in Computer Science · Computer Science
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
2014-06-03
Logic in Computer Science · Computer Science
Decidability of Querying First-Order Theories via Countermodels of Finite Width
Thomas Feller, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph
2025-04-30
Logic in Computer Science · Computer Science
On the Satisfiability of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2024-08-07
Databases · Computer Science
Determinacy of Real Conjunctive Queries. The Boolean Case
Jarosław Kwiecień, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
2021-12-24
Logic in Computer Science · Computer Science
Decidable Expansions of Labelled Linear Orderings
Alexis Bes, Alexander Rabinovich
2015-07-01
Logic in Computer Science · Computer Science
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Viktor Kuncak, Martin Rinard
2007-05-23
Logic in Computer Science · Computer Science
Deciding Predicate Logical Theories of Real-Valued Functions
Stefan Ratschan
2025-04-30
Logic in Computer Science · Computer Science
Decidability and Undecidability Results for Propositional Schemata
Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier
2014-01-17
Logic in Computer Science · Computer Science
Monadic second order finite satisfiability and unbounded tree-width
Tomer Kotek, Helmut Veith, Florian Zuleger
2016-04-19
Logic · Mathematics
Choice Revision
Li Zhang
2018-05-02
Logic in Computer Science · Computer Science
Eine entscheidbare Klasse n-stelliger Horn-Pr\"adikate
Jochen Burghardt
2014-04-09
Databases · Computer Science
On the satisfiability problem for SPARQL patterns
Xiaowang Zhang, Jan Van den Bussche, François Picalausa
2016-06-03