The complexity of strict serializability revisited

DOI10.1016/0020-0190(87)90220-1MaRDI QIDQ1107969zbMATH OpenOpenAlexFDO

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3947612 (Why is no real title available?)
• scientific article; zbMATH DE number 3714911 (Why is no real title available?)
• scientific article; zbMATH DE number 3995093 (Why is no real title available?)
• Formal Aspects of Serializability in Database Concurrency Control
• The serializability of concurrent database updates
• Useless Actions Make a Difference

Cited in

(2)

• scientific article; zbMATH DE number 3947612 (Why is no real title available?)
• Serializability for eventual consistency: criterion, analysis, and applications

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)