DBScholar

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
1055
Venue
PODS
Year
1995
Pagerank
5.9269746e-05
Overall Rank
6,286 | 56.88%
DOI
10.1145/212433.212477

Incoming Non-self Citations Over Time

Authors

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