Multi-granularity locking for nested transactions: A proof using a possibilities mapping

DOI10.1007/S002360050038MaRDI QIDQ1901697zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 November 1995

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050038

zbMATH Keywords

correctness algorithmmulti-granularity locking algorithmnested transactions

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Review text

The choice of granularity for locking times in a database involves performance trade-offs. In order to provide a choice between different locking granularities within a single system, the two-phase locking algorithm needs to be modified to include intention locks. This paper extends the well-known multi-granularity locking algorithm of \textit{J. Gray} et al. to deal with nested transactions, and verifies the correctedness of the extended algorithm, using a possibility mapping to abstract commutativity-based locking.

Recommendations

• Commutativity-based locking for nested transactions
• A model for concurrency in nested transactions systems
• Hybrid atomicity for nested transactions
• Introduction to the theory of nested transactions
• On the power of safe locking

Cites work

• Commutativity-based locking for nested transactions
• On the correctness of orphan management algorithms

Cited in

(2)

• Implementation of automated fine-granularity locking in a persistent programming language
• Nested, but separate: isolating unrelated critical sections in real-time nested locking

This page was built for publication: Multi-granularity locking for nested transactions: A proof using a possibilities mapping

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