On the scalability of snapshot isolation

  • Masoud Saeida Ardekani
  • , Pierre Sutra
  • , Marc Shapiro
  • , Nuno Preguiça

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationEuro-Par 2013 Parallel Processing - 19th International Conference, Proceedings
Pages369-381
Number of pages13
DOIs
Publication statusPublished - 3 Sept 2013
Externally publishedYes
Event19th International Conference on Parallel Processing, Euro-Par 2013 - Aachen, Germany
Duration: 26 Aug 201330 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8097 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Conference on Parallel Processing, Euro-Par 2013
Country/TerritoryGermany
CityAachen
Period26/08/1330/08/13

Fingerprint

Dive into the research topics of 'On the scalability of snapshot isolation'. Together they form a unique fingerprint.

Cite this