Database Paper Browser

Back to papers

Transactions And Integrity Constraints

Summary: Defines transactional schemas—sets of admissible transactions—to specify valid DB states and proves they are incomparable with traditional integrity-constraint schemas while many FDs and some inclusion dependencies admit transactional encodings. Shows transactions can simulate ER/IFO models, express dynamic constraints beyond static ICs, and analyzes decidability/undecidability trade-offs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
736
Venue
PODS
Year
1985
Pagerank
6.0213009e-05
Overall Rank
4,643 | 67.74%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
1,920 A Transaction Language Complete for Database Update and Specification 1987 PODS 0.00010092077
1,931 Foundations of Data-Aware Process Analysis: A Database Theory Perspective 2013 PODS 0.0001005178
4,502 Possible and Certain SQL Keys 2015 VLDB 6.1322784e-05
4,710 Verifiable Properties of Database Transactions 1996 PODS 5.9737802e-05
5,139 Extending the Relational Algebra to Support Transaction Time 1987 SIGMOD 5.6640252e-05
7,219 Deciding Properties of Transactional Schemas 1986 PODS 4.7930382e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 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