The Space Complexity of Transactional Interactive Reads

Masoud Saeida Ardekani 1, 2, * Marek Zawirski 1, 2 Pierre Sutra 2, 1 Marc Shapiro 1, 2
* Corresponding author
2 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00932803
Contributor : Marc Shapiro <>
Submitted on : Friday, January 17, 2014 - 4:54:01 PM
Last modification on : Wednesday, June 12, 2019 - 1:34:50 AM
Long-term archiving on : Friday, April 18, 2014 - 11:51:30 AM

File

interactive-reads-HotCDP-2012....
Files produced by the author(s)

Identifiers

Citation

Masoud Saeida Ardekani, Marek Zawirski, Pierre Sutra, Marc Shapiro. The Space Complexity of Transactional Interactive Reads. HotCDP '12 - 1st International Workshop on Hot Topics in Cloud Data Processing, Apr 2012, Bern, Switzerland. ⟨10.1145/2169090.2169094⟩. ⟨hal-00932803⟩

Share

Metrics

Record views

238

Files downloads

178