On the scalability of snapshot isolation

Masoud Saeida Ardekani; Pierre Sutra; Marc Shapiro; Nuno Preguiça

doi:10.1007/978-3-642-40047-6_39

On the scalability of snapshot isolation

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

Sorbonne Université
University of Neuchatel
INRIA Institut National de Recherche en Informatique et en Automatique
Universidade Nova de Lisboa

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
titre	Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings
Pages	369-381
Nombre de pages	13
Les DOIs	https://doi.org/10.1007/978-3-642-40047-6_39
état	Publié - 3 sept. 2013
Modification externe	Oui
Evénement	19th International Conference on Parallel Processing, Euro-Par 2013 - Aachen, Allemagne Durée: 26 août 2013 → 30 août 2013

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8097 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	19th International Conference on Parallel Processing, Euro-Par 2013
Pays/Territoire	Allemagne
La ville	Aachen
période	26/08/13 → 30/08/13

Accès au document

10.1007/978-3-642-40047-6_39

Contient cette citation

Saeida Ardekani, M., Sutra, P., Shapiro, M., & Preguiça, N. (2013). On the scalability of snapshot isolation. Dans Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings (p. 369-381). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 8097 LNCS). https://doi.org/10.1007/978-3-642-40047-6_39

@inproceedings{47294b09a438489a9587e6da29691161,

title = "On the scalability of snapshot isolation",

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.",

author = "\{Saeida Ardekani\}, Masoud and Pierre Sutra and Marc Shapiro and Nuno Pregui{\c c}a",

year = "2013",

month = sep,

day = "3",

doi = "10.1007/978-3-642-40047-6\_39",

language = "English",

isbn = "9783642400469",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "369--381",

booktitle = "Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings",

note = "19th International Conference on Parallel Processing, Euro-Par 2013 ; Conference date: 26-08-2013 Through 30-08-2013",

}

Saeida Ardekani, M, Sutra, P, Shapiro, M & Preguiça, N 2013, On the scalability of snapshot isolation. Dans Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 8097 LNCS, p. 369-381, 19th International Conference on Parallel Processing, Euro-Par 2013, Aachen, Allemagne, 26/08/13. https://doi.org/10.1007/978-3-642-40047-6_39

On the scalability of snapshot isolation. / Saeida Ardekani, Masoud; Sutra, Pierre; Shapiro, Marc et al.
Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings. 2013. p. 369-381 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 8097 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - On the scalability of snapshot isolation

AU - Saeida Ardekani, Masoud

AU - Sutra, Pierre

AU - Shapiro, Marc

AU - Preguiça, Nuno

PY - 2013/9/3

Y1 - 2013/9/3

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-40047-6_39

DO - 10.1007/978-3-642-40047-6_39

M3 - Conference contribution

AN - SCOPUS:84883194436

SN - 9783642400469

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 369

EP - 381

BT - Euro-Par 2013 Parallel Processing - 19th International Conference, Proceedings

T2 - 19th International Conference on Parallel Processing, Euro-Par 2013

Y2 - 26 August 2013 through 30 August 2013

ER -

On the scalability of snapshot isolation

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation