Database Paper Browser

Back to papers

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)

Paper ID
1056
Venue
PODS
Year
1995
Pagerank
5.0841675e-05
Overall Rank
6,380 | 55.66%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
3,787 Linear vs. Order Constraint Queries Over Rational Databases (Extended Abstract) 1996 PODS 6.7633131e-05
4,376 Safe Constraint Queries 1998 PODS 6.233754e-05
8,963 An Effective Syntax for Bounded Relational Queries 2016 SIGMOD 4.4165156e-05
11,834 Bounded Query Rewriting Using Views 2016 PODS 4.1905499e-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