Project SherlockEst. Knowledge

Paper

2013

Highly Available Transactions: Virtues and Limitations

Peter Bailis et al.

Identifies exactly which transactional guarantees are compatible with high availability, showing most applications need far less isolation than full ACID promises.

Before you start

FreeAdvancedlink checked 17 Sept 2026

Read these first

Not a difficulty warning — a route. These are in the library too.

Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web ServicesSeth Gilbert & Nancy Lynch, 2002Proves Brewer's conjecture formally: under network partition a system must give up either consistency or availability.

Filed under Distributed Systems in Computer Science.