Not all transactions care about repeatable reads. They are willing to forego problems arising with phantoms. We’ll call this level “nonrepeatable reads”. (This is called degree 2 isolation also called cursor stability (CS)). CS differs from RR in that read locks are discarded once a tuple has been read. Write locks on tuples, like RR, are held to the end of the transaction. Note that CS executions are not truely serializable (because of the nonrepeatability of reads).
Sameh Elnikety合作论文数Microsoft Research in Cambridge61
Gerhard Weikum合作论文数Department of Databases and Information Systems, Max-Planck Institute for Informatics43
Marcus Herzog合作论文数Computer Science department of the Vienna University of Technology,43
Philippe Bonnet合作论文数IT University of Copenhagen42
Carson Kai-Sang Leung合作论文数Database & Data Mining Lab, Department of Computer Science, University of Manitoba39