DBScholar

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
2228
Venue
SIGMOD
Year
1982
Pagerank
0.00010194403
Overall Rank
1,624 | 88.86%
DOI
10.1145/582353.582361

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bernstein_sigmod82,
        title = {{FAST METHODS FOR TESTING QUANTIFIED RELATIONAL CALCULUS ASSERTIONS}},
        author = {Bernstein, Philip A. and Blaustein, Barbara T.},
        series = {{SIGMOD} '82},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/582353.582361},
        url = {https://dl.acm.org/doi/10.1145/582353.582361},
        year = {1982}
}

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
81 Implementation of Integrity Constraints and Views by Query Modification 1975 SIGMOD 0.00036443459
541 Efficient Monitoring of Database Assertions 1978 SIGMOD 0.00016860824
Previous Page 1 / 1 Next

Semantically Similar Papers