Hybrid atomicity for nested transactions

DOI10.1016/0304-3975(95)00029-VzbMath0874.68223OpenAlexW1856862575MaRDI QIDQ672342

Nancy A. Lynch, Alan Fekete, William E. Weihl

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00029-v

zbMATH Keywords

hybrid atomicitynested transaction systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Commutativity-based locking for nested transactions
• Hybrid concurrency control for abstract data types
• Necessary and sufficient conditions for R-graph synthesis
• Commutativity-based concurrency control for abstract data types
• Locking Primitives in a Database System
• The notions of consistency and predicate locks in a database system

This page was built for publication: Hybrid atomicity for nested transactions