The complexity of strict serializability revisited

DOI10.1016/0020-0190(87)90220-1zbMATH Open0653.68007OpenAlexW2023087184MaRDI QIDQ1107969FDOQ1107969

Authors: 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

Recommendations

• scientific article; zbMATH DE number 3947612
• scientific article
• Correctness criteria for databases using abstract data types
• Generalized theory of serializability
• On serializability

zbMATH Keywords

NP-completeconcurrency control theorydead valuesfinal-state serializabilitystrict serializabilityuseless values

Mathematics Subject Classification ID

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

Cites Work

• The serializability of concurrent database updates
• Formal Aspects of Serializability in Database Concurrency Control
• Title not available (Why is that?)
• Useless Actions Make a Difference
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Serializability for eventual consistency: criterion, analysis, and applications
• Title not available (Why is that?)

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

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