The Space Complexity of Transactional Interactive Reads

Masoud Saeida Ardekani (1) , Marek Zawirski (1) , Pierre Sutra (1) , Marc Shapiro (1)

1 Regal - Large-Scale Distributed Systems and Applications

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.

Mots clés: Transactional Processing; Consistent Snapshot; Cloud Computing; Data Freshness; Key-Value Stores

Domaines: Autre [cs.OH]

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⟩