Snapshot Isolation is a popular and efficient protocol for concurrency control. In this paper we discuss Snapshot Isolation in view of the classical theory for transaction processing. In addition to summarizing previous research we prove that the set SI of histories that may be generated by Snapshot Isolation is incomparable to final state, view and conflict serializability, that SI is monotone, and that schedules generated by Snapshot Isolation are strict and thus have good properties with respect to recoverability. Categories and Subject Descriptors H.2.4 [Database Management]: Systems--Concurrency, Transaction processing General Terms Theory Keywords Snapshot Isolation, concurrency, transaction, serializability, monotonicity, recoverability
Ragnar Normann, Lene T. Østby