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

DOI10.1007/S002360050038zbMath0837.68019OpenAlexW2091024916MaRDI QIDQ1901697

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

nested transactionscorrectness algorithmmulti-granularity locking algorithm

Mathematics Subject Classification ID

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

Cites Work

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

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