The notions of consistency and predicate locks in a database system

  title={The notions of consistency and predicate locks in a database system},
  author={K. Eswaran and J. Gray and R. Lorie and I. Traiger},
  journal={Commun. ACM},
In database systems, users access shared data under the assumption that the data satisfies certain consistency constraints. This paper defines the concepts of transaction, consistency and schedule and shows that consistency requires that a transaction cannot request new locks after releasing a lock. Then it is argued that a transaction needs to lock a logical rather than a physical subset of the database. These subsets may be specified by predicates. An implementation of predicate locks which… Expand
Consistency in Hierarchical Database Systems
It is shown that the protocol ensures consistency and that a data item may be locked at most once as a result of each transacuon. Expand
Effects of locking granularity in a database management system
Using a simulation model, the desired size of a granule is explored under a wide variety of seemingly realistic conditions, surprisingly coarse granularity is called for. Expand
Views, authorization, and locking in a relational data base system
The examples in this paper will be drawn from a data base which describes a department store and consists of three relations: EMP, SAL, MGR, DEPT, and LOC. Expand
At tribute Inheritance Implemented on Top of a Relational Database System
We present an implementation technique which solves integrity checking, query evaluation and transaction synchronization tasks in database systems with multiple attribute inheritance and which usesExpand
Advanced Locking Protocols
The locking protocols presented thus far assume that the lockable units of the database are single tuples, which is appropriate to transactions that access a few tuples only but must also acquire many locks if a transaction accesses many tuples. Expand
Optimal Database Locks for Efficient Integrity Checking
This paper shows in this paper how to apply one such method to automatically extend update transactions with locks and simplified consistency tests on the locked entities to preserve consistency. Expand
Contribution to the Theory of Concurrency in Databases
A database can be seen as a set of entities which satisfy certain assertions called integrity constraints and it is necessary to limit the simultaneous execution of transactions to guarantee the good execution of all the operations and the integrity of the database. Expand
Scheduling Algorithms for Avoiding Inconsistency in Large Databases
By introducing the concepts of permutability of operations and of connected class of entities, it is possible to design scheduling algorithms avoiding inconsistency conflicts and a better caracterisation of operation modes and a new primitive UNCOLOCK is proposed to implement these concepts in a real system. Expand
Attribute inheritance implemented on top of a relational database system
  • S. Bottcher
  • Computer Science
  • [1990] Proceedings. Sixth International Conference on Data Engineering
  • 1990
An implementation technique which solves integrity checking, query evaluation, and transaction synchronization tasks in database systems with multiple attribute inheritance and uses the support of aExpand
Reliable transaction management in a multidatabase system
A fault tolerant transaction management algorithm and recovery procedures that retain global database consistency are designed and shown that their algorithms ensure freedom from global deadlocks of any kind. Expand


A Relational Model for Large Shared Data Banks
His goal is to describe data, not to build a model of computation (which one would then be expected to prove equivalent to Turing Machines), and the idea of using a relation view of data to avoid ordering dependencies, access path dependencies and other implementation dependencies. Expand
Recovery semantics for a DB/DC system
A unified, systematic view of integrity/recovery as it relates to a data-processing system—whether man, machine, or both is presented. Expand
Recovery scenario for a DB/DC system
Previously developed sphere-of-control (SOC) concepts are used to develop a scenario for post-process recovery. An information structure provides the recovery boundary around the effects of the usageExpand
Conversion and Planning Guide
  • IBM Information Management System for Virtual Storage (IMS/VS)
  • 1973
System for Virtual Storage (IMS/VS), Conversion and Planning Guide
  • Form No. SH209034, IBM, Armonk, N.Y.,
  • 1973
Data Base Task Group Report
  • 1971
Introduction to Metamathematics