Database Paper Browser

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
1135
Venue
PODS
Year
1998
Pagerank
6.2397591e-05
Overall Rank
4,379 | 69.54%
DOI
-

Incoming Non-self Citations Over Time

Authors

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