scispace - formally typeset
Journal ArticleDOI

The notions of consistency and predicate locks in a database system

Kapali P. Eswaran, +3 more
- 01 Nov 1976 - 
- Vol. 19, Iss: 11, pp 624-633
Reads0
Chats0
TLDR
It is argued that a transaction needs to lock a logical rather than a physical subset of the database, and an implementation of predicate locks which satisfies the consistency condition is suggested.
Abstract
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 satisfies the consistency condition is suggested.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings Article

The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data

TL;DR: An efficient algorithm for managing replicated data that imposes a logical tree structure on the set of copies of an object that provides faulttolerance without imposing unnecessary costs on the failure-free mode of operations.
Proceedings ArticleDOI

Views, authorization, and locking in a relational data base system

TL;DR: 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.
Journal ArticleDOI

Observations on optimistic concurrency control schemes

TL;DR: A number of general properties of optimistic concurrency control schemes is derived, and their advantages and drawbacks w.r.t. two-phase locking approaches are discussed.
Dissertation

An evaluation of concurrency control with one thousand cores

Xiangyao Yu
TL;DR: It is concluded that rather than pursuing incremental solutions, many-core chips may require a completely redesigned DBMS architecture that is built from ground up and is tightly coupled with the hardware.
Journal ArticleDOI

A Survey on NoSQL Stores

TL;DR: This survey mainly aims at elucidating the design decisions of NoSQL stores with regard to the four nonorthogonal design principles of distributed database systems: data model, consistency model, data partitioning, and the CAP theorem.
References
More filters
Journal ArticleDOI

A relational model of data for large shared data banks

TL;DR: In this article, a model based on n-ary relations, a normal form for data base relations, and the concept of a universal data sublanguage are introduced, and certain operations on relations are discussed and applied to the problems of redundancy and consistency in the user's model.
Book

Introduction to Metamathematics

H. Rasiowa
Proceedings ArticleDOI

Recovery semantics for a DB/DC system

TL;DR: A unified, systematic view of integrity/recovery as it relates to a data-processing system—whether man, machine, or both is presented.
Proceedings ArticleDOI

Recovery scenario for a DB/DC system

TL;DR: Previously developed sphere-of-control (SOC) concepts are used to develop a scenario for post-process recovery where an information structure provides the recovery boundary around the effects of the usage of a resource.