The space complexity of transactional interactive reads

Masoud Saeida Ardekani; Marek Zawirski; Pierre Sutra; Marc Shapiro

doi:10.1145/2169090.2169094

The space complexity of transactional interactive reads

Masoud Saeida Ardekani
, Marek Zawirski
, Pierre Sutra
, Marc Shapiro

LIP6, UPMC Sorbonne Universités - Paris 6

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.

Original language	English
Title of host publication	Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12
Publisher	Association for Computing Machinery
ISBN (Print)	9781450311625
DOIs	https://doi.org/10.1145/2169090.2169094
Publication status	Published - 10 Apr 2012
Externally published	Yes
Event	1st International Workshop on Hot Topics in Cloud Data Processing, HotCDP 2012 - Bern, Switzerland Duration: 10 Apr 2012 → 10 Apr 2012

Publication series

Name	Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12

Conference

Conference	1st International Workshop on Hot Topics in Cloud Data Processing, HotCDP 2012
Country/Territory	Switzerland
City	Bern
Period	10/04/12 → 10/04/12

Keywords

Cloud computing
Consistent snapshot
Data freshness
Key-value stores
Transactional processing

Access to Document

10.1145/2169090.2169094

Cite this

@inproceedings{2826882a806e4617b9ecb7cd343c341d,

title = "The space complexity of transactional interactive reads",

abstract = "Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.",

keywords = "Cloud computing, Consistent snapshot, Data freshness, Key-value stores, Transactional processing",

author = "Ardekani, \{Masoud Saeida\} and Marek Zawirski and Pierre Sutra and Marc Shapiro",

year = "2012",

month = apr,

day = "10",

doi = "10.1145/2169090.2169094",

language = "English",

isbn = "9781450311625",

series = "Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12",

publisher = "Association for Computing Machinery",

booktitle = "Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12",

note = "1st International Workshop on Hot Topics in Cloud Data Processing, HotCDP 2012 ; Conference date: 10-04-2012 Through 10-04-2012",

}

Ardekani, MS, Zawirski, M, Sutra, P & Shapiro, M 2012, The space complexity of transactional interactive reads. in Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12., 4, Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12, Association for Computing Machinery, 1st International Workshop on Hot Topics in Cloud Data Processing, HotCDP 2012, Bern, Switzerland, 10/04/12. https://doi.org/10.1145/2169090.2169094

The space complexity of transactional interactive reads. / Ardekani, Masoud Saeida; Zawirski, Marek; Sutra, Pierre et al.
Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12. Association for Computing Machinery, 2012. 4 (Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The space complexity of transactional interactive reads

AU - Ardekani, Masoud Saeida

AU - Zawirski, Marek

AU - Sutra, Pierre

AU - Shapiro, Marc

PY - 2012/4/10

Y1 - 2012/4/10

N2 - Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.

AB - Transactional Web Applications need to perform fast interactive reads while ensuring reasonable isolation guarantees. This paper studies the problem of taking consistent snapshots for transactions with interactive reads. We introduce four levels of freshness, and solutions to guarantee them. We also explore trade-offs between the space complexity and the freshness levels.

KW - Cloud computing

KW - Consistent snapshot

KW - Data freshness

KW - Key-value stores

KW - Transactional processing

U2 - 10.1145/2169090.2169094

DO - 10.1145/2169090.2169094

M3 - Conference contribution

AN - SCOPUS:84860560302

SN - 9781450311625

T3 - Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12

BT - Proceedings of the Workshop on Hot Topics in Cloud Data Processing, HotCDP'12

PB - Association for Computing Machinery

T2 - 1st International Workshop on Hot Topics in Cloud Data Processing, HotCDP 2012

Y2 - 10 April 2012 through 10 April 2012

ER -

The space complexity of transactional interactive reads

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this