Journal ArticleDOI
The notions of consistency and predicate locks in a database system
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
Citations
More filters
Journal ArticleDOI
Optimistic concurrency control for abstract data types
TL;DR: This paper describes several new optimistic concurrency control techniques for objects in distributed systems, proves their correctness and optimality properties, and characterizes the circumstances under which each is likely to be useful.
Book ChapterDOI
An efficient method for performing record deletions and updates using index scans
TL;DR: A method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index that has been implemented in DB2 V7 to address specific customer requirements and to improve performance on the TPC-H benchmark.
Journal ArticleDOI
Epoch-based commit and replication in distributed OLTP databases
TL;DR: The key idea behind COCO is that it separates transactions into epochs and treats a whole epoch of transactions as the commit unit, which reduces the overhead of 2PC and synchronous replication by up to a factor of four.
Journal ArticleDOI
A characterization of database graphs admitting a simple locking protocol
TL;DR: Necessary and sufficient conditions which assure serializability and deadlock-freedom in the absence of a concurrency control are derived.
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.
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.