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
Journal ArticleDOI

Concurrency control in mobile environments : issues & challenges

TL;DR: This paper analyzes and compares various concurrency control strategies in mobile environments proposed in literature and the design requirement for preserving isolation property inMobile environments is presented.
Dissertation

Object management for persistence and recoverability

TL;DR: In this paper, the authors propose a method to solve the problem of "I.i.d., I.I.d." problem, i.e., the "I
Journal Article

A High Performance Payment Processing System Designed for Central Bank Digital Currencies

TL;DR: The first phase of Project Hamilton as discussed by the authors describes the technical design of Hamilton, a research transaction processing system flexible enough to support experimentation with multiple central bank digital currency models, including Bitcoin and Ethereum.
Proceedings ArticleDOI

Efficient algorithms for persistent transactional memory

TL;DR: In this paper, the authors explore different trade-offs in terms of memory usage vs. number of fences and flushes for durable transactions on persistent memory (PM) and present two new algorithms, named Trinity and Quadra, which implement each of them in the form of a user-level library persistent transactional memory (PTM).
Journal ArticleDOI

A High Performance Concurrency Protocol for Smart Contracts of Permissioned Blockchain

TL;DR: In this paper , a two-phase concurrency control protocol is proposed to optimize both phases for the first time, where the primary node executes transactions in parallel and generates a transaction dependency graph with high parallelism for validators, and a graph partition algorithm is devised to divide the original graph into several sub-graphs to preserve parallelism and reduce communication cost remarkably.
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.