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.
|Title of host publication||Lecture Notes in Computer Science|
|Publication status||Published - 1 Jan 2013|
|Event||Euro-Par 2013 - 19th International Conference on Parallel Processing - |
Duration: 1 Jan 2013 → …
|Conference||Euro-Par 2013 - 19th International Conference on Parallel Processing|
|Period||1/01/13 → …|