Formal Aspects of Serializability in Database Concurrency Control

DOI10.1109/TSE.1979.234182MaRDI QIDQ4179819zbMATH OpenFDO

Authors Philip A. Bernstein, David W. Shipman, Wing Shing Wong

Publication date 1979

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TSE.1979.234182

zbMATH Keywords

Database Concurrency ControlDatabase SystemSynchronization

Mathematics Subject Classification ID

Theory of operating systems (68N25) Data structures (68P05)

Cited in

(12)

• Serializability theory for replicated databases
• A proof technique for concurrency control and recovery algorithms for replicated databases
• A cautious scheduler for multistep transactions
• The complexity of strict serializability revisited
• Global serializability of concurrent programs
• Relative serializability: An approach for relaxing the atomicity of transactions
• Last-use opacity: a strong safety property for transactional memory with prerelease support
• Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
• Serializable graphs
• Context-specific synchronization for atomic data types in object-based databases
• Multi-version concurrency control scheme for a database system
• Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach

This page was built for publication: Formal Aspects of Serializability in Database Concurrency Control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179819)