DBScholar

Back to papers

Safe Constraint Queries

Summary: Syntactic characterization of safe queries in relational calculus extended with interpreted functions (e.g., real +, ×, exponentiation), giving an interpreted analogue of range-restriction and an effective syntax for real-arithmetic/polynomial queries. Shows decidability of safety for Boolean combinations of CQs over broad interpreted structures, proves a polynomial output-growth dichotomy, and applies results to finitely representable and geometric (convex/polyhedral/semi-linear) databases. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1134
Venue
PODS
Year
1998
Pagerank
6.8211482e-05
Overall Rank
4,226 | 71.01%
DOI
10.1145/275487.275499

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{benedikt_pods98,
        address = {New York, NY, USA},
        series = {{PODS} '98},
        title = {{Safe Constraint Queries}},
        url = {https://dl.acm.org/doi/10.1145/275487.275499},
        doi = {10.1145/275487.275499},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Benedikt, Michael and Libkin, Leonid},
        year = {1998}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers