The complexity of strict serializability revisited

DOI10.1016/0020-0190(87)90220-1zbMath0653.68007OpenAlexW2023087184MaRDI QIDQ1107969

Udo Kelter

Publication date: 1987

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90220-1

zbMATH Keywords

NP-completeconcurrency control theorydead valuesfinal-state serializabilitystrict serializabilityuseless values

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Cites Work

• The serializability of concurrent database updates
• Useless Actions Make a Difference
• Formal Aspects of Serializability in Database Concurrency Control
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of strict serializability revisited