The serializability of concurrent database updates
From MaRDI portal
Publication:3853111
DOI10.1145/322154.322158zbMath0419.68036OpenAlexW2023304911MaRDI QIDQ3853111
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322154.322158
concurrency controldatabase managementserializabilitytransactionsschedulersconcurrent update problem
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Theory of operating systems (68N25)
Related Items
On the correctness problem for serializability ⋮ Serializability theory for replicated databases ⋮ I-serializability: generalized correctness for transaction-based environments ⋮ Modular verification of chemical reaction network encodings via serializability analysis ⋮ An efficient approach to achieve compositionality using optimized multi-version object based transactional systems ⋮ Model checking transactional memories ⋮ On the complexity of concurrency control using semantic information ⋮ A proof technique for concurrency control and recovery algorithms for replicated databases ⋮ Last-use opacity: a strong safety property for transactional memory with prerelease support ⋮ Mixed product and asynchronous automata ⋮ Static and dynamic aspects of goal-oriented concurrency control ⋮ A cautious scheduler for multistep transactions ⋮ The complexity of strict serializability revisited ⋮ A dynamic majority determination algorithm for reconfiguration of network partitions ⋮ Une approche quantitative de l'exclusion mutuelle ⋮ On serializability ⋮ Relative serializability: An approach for relaxing the atomicity of transactions ⋮ Mechanized proofs of opacity: a comparison of two techniques ⋮ Some constraints assuring serializability in multidatabases ⋮ Unnamed Item ⋮ General purpose schedulers for database systems ⋮ Correctness of concurrent executions of closed nested transactions in transactional memory systems ⋮ On speculative replication of transactional systems ⋮ Abstraction for concurrent objects ⋮ Cut-off theorems for the \textit{PV}-model ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ Proving opacity of transactional memory with early release ⋮ Serializable graphs ⋮ On the power of safe locking ⋮ Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) ⋮ Verifying atomic data types ⋮ Pebble games for studying storage sharing ⋮ Verification of STM on relaxed memory models ⋮ Concurrent operations in linear hashing ⋮ Transactional scheduling for read-dominated workloads ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency ⋮ Permissiveness in Transactional Memories ⋮ Towards formally specifying and verifying transactional memory ⋮ Linearizable counting networks ⋮ Completeness and Nondeterminism in Model Checking Transactional Memories ⋮ Asynchronous group mutual exclusion ⋮ X-Ability: a theory of replication ⋮ Hybrid concurrency control for abstract data types ⋮ Robustness Against Transactional Causal Consistency. ⋮ Extensible transactional memory testbed ⋮ Checking robustness between weak transactional consistency models ⋮ Concurrent correctness in vector space ⋮ On avoiding spare aborts in transactional memory ⋮ Conceptual level concurrency control of relational update transactions ⋮ Context-specific synchronization for atomic data types in object-based databases ⋮ Abstraction and mining of traces to explain concurrency bugs ⋮ A formal semantics of nested atomic sections with thread escape ⋮ The impact of recovery on concurrency control ⋮ On-line multiversion database concurrency control ⋮ Serializable histories in quantified propositional temporal logic ⋮ Modular Verification of DNA Strand Displacement Networks via Serializability Analysis ⋮ A single-version STM that is multi-versioned permissive ⋮ Inherent limitations on disjoint-access parallel implementations of transactional memory ⋮ A transaction model and multiversion concurrency control for mobile database systems ⋮ Algorithmic aspects of multiversion concurrency control ⋮ Deadlock-freedom (and safety) of transactions in a distributed database ⋮ Unnamed Item ⋮ Verifying Opacity of a Transactional Mutex Lock ⋮ Commutativity-based locking for nested transactions ⋮ Toward a Formal Semantic Framework for Deterministic Parallel Programming ⋮ A Formal Model for the Deferred Update Replication Technique ⋮ The serializability problem for a temporal logic of transaction queries ⋮ Comparison of algorithms controlling concurrent access to a database: A combinatorial approach ⋮ Concurrency control by transactions carrying states and preordering multiversioned entities ⋮ Combinatoire des mots et étude quantitative de la sérialisabilité: Application à la concurrence d'accès à une base de données. (Combinatorics of words and the quantitative study of serializability: Application to the concurrence of database access) ⋮ In the Search for Optimal Concurrency ⋮ A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition ⋮ Timing conditions for linearizability in uniform counting networks ⋮ Linearizable read/write objects ⋮ Integrated concurrency control in shared B-trees ⋮ Strict Linearizability and Abstract Atomicity ⋮ Multi-version concurrency control scheme for a database system ⋮ Global serializability of concurrent programs ⋮ Generalized theory of serializability ⋮ Non-interference and local correctness in transactional memory
