Database Paper Browser

Back to papers

Fast Methods For Testing Quantified Relational Calculus Assertions

Summary: Develops a fast evaluation algorithm for assertions produced by simplification, boosting integrity-enforcement efficiency. Defines a two-step class: per-relation simple selections followed by set-emptiness tests; extends these ideas to broader assertions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2166
Venue
SIGMOD
Year
1982
Pagerank
0.0001284615
Overall Rank
1,283 | 91.08%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

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

Rank Cited Paper Year Venue Pagerank
69 Implementation of Integrity Constraints and Views by Query Modification 1975 SIGMOD 0.00060379399
311 Efficient Monitoring of Database Assertions 1978 SIGMOD 0.00028116403
Previous Page 1 / 1 Next

Semantically Similar Papers