The notions of consistency and predicate locks in a database system
From MaRDI portal
Publication:4109287
DOI10.1145/360363.360369zbMath0341.68023OpenAlexW1991199257WikidataQ56224673 ScholiaQ56224673MaRDI QIDQ4109287
Kapali P. Eswaran, Raymond A. Lorie, Irving L. Traiger, Jim Gray
Publication date: 1976
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360363.360369
Related Items (69)
On the correctness problem for serializability ⋮ Correctness proof for the majority consensus algorithm ⋮ Probabilistic analysis of transaction blocking under arbitrary data access distribution in database systems ⋮ Management of concurrency in interpolation based grid file organization and its performance ⋮ File allocation in a distributed database ⋮ Serializability theory for replicated databases ⋮ I-serializability: generalized correctness for transaction-based environments ⋮ Serializability by commitment ordering ⋮ Constraint-preserving snapshot isolation ⋮ On the complexity of concurrency control using semantic information ⋮ A lower bound on the probability of conflict under nonuniform access in database systems ⋮ A proof technique for concurrency control and recovery algorithms for replicated databases ⋮ Concurrent execution of transaction copies ⋮ On-the-fly, incremental, consistent reading of entire databases ⋮ Algorithms for reducing rollbacks in concurrency control by certification ⋮ Shifting timestamps for concurrency control in an information hierarchy ⋮ On serializability ⋮ Introduction to the theory of nested transactions ⋮ Relative serializability: An approach for relaxing the atomicity of transactions ⋮ Deleting completed transactions ⋮ Serialization of concurrent programs ⋮ Mathematical studies on a transaction's waits and deadlocks in a 2pl environment ⋮ General purpose schedulers for database systems ⋮ Transaction management in RDBMSs with XML support ⋮ A characterization of database graphs admitting a simple locking protocol ⋮ Lockless blockchain sharding with multiversion control ⋮ Serializable graphs ⋮ On the power of safe locking ⋮ Adding relational query facilities to software development environments ⋮ Verifying atomic data types ⋮ Algebraic specification of concurrent systems ⋮ Exploiting logical structures in replicated databases ⋮ Pebble games for studying storage sharing ⋮ Algebraic implementation of abstract data types ⋮ Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach ⋮ From non-preemptive to preemptive scheduling using synchronization synthesis ⋮ On deadlocks of exclusive AND-requests for resources ⋮ Asynchronous group mutual exclusion ⋮ Performance issues in database systems ⋮ Transaction synchronisation in object bases ⋮ Hybrid concurrency control for abstract data types ⋮ Integrity aspects of quasi serializability ⋮ Hybrid atomicity for nested transactions ⋮ Context-specific synchronization for atomic data types in object-based databases ⋮ Algebraic and functional specification of an interactive serializable database interface ⋮ Operational specification with joint actions: Serializable databases ⋮ Compensation methods to support cooperative applications: A case study in automated verification of schema requirements for an advanced transaction model ⋮ The impact of recovery on concurrency control ⋮ On-line multiversion database concurrency control ⋮ Locking based on a pairwise decomposition of the transaction system ⋮ cJoin: Join with communicating transactions ⋮ The cost of concurrent, low-contention Read \& Modify \& Write ⋮ A transaction model and multiversion concurrency control for mobile database systems ⋮ Deadlock-freedom (and safety) of transactions in a distributed database ⋮ On mobile transaction processing in dynamically configurable mobile database communities ⋮ Achieving graceful performance in distributed error-prone databases ⋮ Commutativity-based locking for nested transactions ⋮ Safe locking policies for dynamic databases ⋮ A structure for access control lists ⋮ Operation-specific locking in balanced structures ⋮ Concurrency control by transactions carrying states and preordering multiversioned entities ⋮ A formal model of atomicity in asynchronous systems ⋮ Multiserialization of iterated transactions ⋮ Model-checking of correctness conditions for concurrent objects ⋮ Multi-version concurrency control scheme for a database system ⋮ Is distributed locking harder? ⋮ Maximal serializability of iterated transactions ⋮ Distributed management of transactions in heterogeneous distributed database systems ⋮ A fair Banker's Algorithm for read and write locks
This page was built for publication: The notions of consistency and predicate locks in a database system
