Multiversion concurrency control—theory and algorithms

DOI10.1145/319996.319998zbMath0531.68060OpenAlexW2435606122MaRDI QIDQ3313318

Nathan Goodman, Philip A. Bernstein

Publication date: 1983

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/319996.319998

zbMATH Keywords

database managementtransaction processingcorrectness of concurrency control algorithms for multiversion database systems

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (13)

Correctness proof for the majority consensus algorithm ⋮ Serializability theory for replicated databases ⋮ Shifting timestamps for concurrency control in an information hierarchy ⋮ On serializability ⋮ Lockless blockchain sharding with multiversion control ⋮ A graph transformation algorithm for concurrency control in a partitioned database ⋮ Semantics of Concurrent Revisions ⋮ On-line multiversion database concurrency control ⋮ A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control ⋮ Algorithmic aspects of multiversion concurrency control ⋮ Commutativity-based locking for nested transactions ⋮ A conservative multiversion locking-graph scheduler algorithm ⋮ A fault-tolerant file management algorithm in distributed computer system ``THUDS

This page was built for publication: Multiversion concurrency control—theory and algorithms