On Concurrency Control by Multiple Versions

DOI10.1145/348.318588zbMath0547.68092OpenAlexW1992044086MaRDI QIDQ3339325

Paris C. Kanellakis, Christos H. Papadimitriou

Publication date: 1984

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

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

zbMATH Keywords

NP-completeconcurrency controlschedulerserializabilitydatabase management systemmultiple versionsspace-parallelism trade-off

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (11)

Shifting timestamps for concurrency control in an information hierarchy ⋮ On serializability ⋮ Hybrid concurrency control for abstract data types ⋮ A graph transformation algorithm for concurrency control in a partitioned database ⋮ 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 ⋮ Concurrency control by transactions carrying states and preordering multiversioned entities

This page was built for publication: On Concurrency Control by Multiple Versions