The space complexity of transactional interactive reads
Masoud Saeida Ardekani, Marek Zawirski, Pierre Sutra, Marc Shapiro · 2012
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.