System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Coordinating concurrent access in a distributed database architecture
CAW '78 Proceedings of the fourth workshop on Computer architecture for non-numeric processing
IEEE Transactions on Software Engineering
McROSS: a multi-computer programming system
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
| Hi-index | 0.00 |
A database is called internally consistent (or just consistent) with respect to a given set of invariant properties if, in the absence of any database activity, the above said invariants hold true. These properties reflect relations among objects of the application domain and characterize its semantic consistency (e.g., 'last name appears first on all government forms'). Because a single database may support many different applications, these relations are generally assumed to be known solely by the database user and not by the database designer. The very definition of a transaction (a sequence of primitive database activities which, when acting alone, preserves, as a whole, all invariants) is in recognition of the fact that it is the user's duty to guarantee the integrity of the data he manipulates.