Finite Queries do not Have Effective Syntax
Summary: No effective syntactic characterization of finite (safe) relational-calculus queries: construct a recursive domain with decidable theory where every decidable/enumerable subclass either contains an infinite query or omits some finite one. Also proves state-finiteness undecidable. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Alexei P. Stolboushkin (University of California Los Angeles)
- 2. Michael A. Taitslin (Tver State University)
BibTeX Citation
@inproceedings{stolboushkin_pods95,
address = {New York, NY, USA},
series = {{PODS} '95},
title = {{Finite Queries do not Have Effective Syntax}},
url = {https://dl.acm.org/doi/10.1145/212433.212477},
doi = {10.1145/212433.212477},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Stolboushkin, Alexei P. and Taitslin, Michael A.},
year = {1995}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,013 | Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) | 1996 | PODS | 6.9565842e-05 |
| 4,226 | Safe Constraint Queries | 1998 | PODS | 6.8211482e-05 |
| 9,002 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD | 5.3346995e-05 |
| 12,029 | Bounded Query Rewriting Using Views | 2016 | PODS | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 174 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS |
| 2 | 9,002 | An Effective Syntax for Bounded Relational Queries | 2016 | SIGMOD |
| 3 | 1,630 | On the Decidability of Query Containment under Constraints | 1998 | PODS |
| 4 | 6,926 | On the Decidability of Containment of Recursive Datalog Queries - Preliminary report | 2004 | PODS |
| 5 | 13,023 | Universal Finiteness and Satisfiability | 1994 | PODS |
| 6 | 4,226 | Safe Constraint Queries | 1998 | PODS |
| 7 | 1,498 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS |
| 8 | 7,356 | Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable. | 2016 | PODS |
| 9 | 4,235 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD |
| 10 | 2,241 | Finitely Representable Databases | 1994 | PODS |