Reducing conflict graph of multi-step transactions accessing ordered data with gaps

MaRDI QIDQ5402947zbMATH OpenFDO

Authors Rafat Alshorman, Hamed Fawareh

Publication date 17 March 2014

zbMATH Keywords

conflict graphscycle reductionserializability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On serializability
• scientific article; zbMATH DE number 784430
• Relative serializability: An approach for relaxing the atomicity of transactions
• Serialization of concurrent programs
• On the serializability theorem for nested transactions

This page was built for publication: Reducing conflict graph of multi-step transactions accessing ordered data with gaps

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