Many distributed applications require transactions. However, transactional protocols that require strong synchronization are costly in large scale environments. Two properties help with scalability of a transactional system: genuine partial replication (GPR), which leverages the intrinsic parallelism of a workload, and snapshot isolation (SI), which decreases the need for synchronization. We show that under standard assumptions (data store accesses are not known in advance, and transactions may access arbitrary objects in the data store), it is impossible to have both SI and GPR. Our impossibility result is based on a novel decomposition of SI which proves that, like serializability, SI is expressible on plain histories. © 2013 Springer-Verlag.
CITATION STYLE
Saeida Ardekani, M., Sutra, P., Shapiro, M., & Preguiça, N. (2013). On the scalability of snapshot isolation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8097 LNCS, pp. 369–381). https://doi.org/10.1007/978-3-642-40047-6_39
Mendeley helps you to discover research relevant for your work.