|Title||When Is Operation Ordering Required in Replicated Transactional Storage?|
|Publication Type||Journal Article|
|Year of Publication||2016|
|Authors||Zhang I, Sharma NKr., Szekeres A, Krishnamurthy A, Ports DRK|
|Journal||IEEE Data Engineering Bulletin|
|Date or Month Published||March|
Today's replicated transactional storage systems typically have a layered architecture, combining protocols for transaction coordination, consistent replication, and concurrency control. These systems generally require costly strongly-consistent replication protocols like Paxos, which assign a total order to all operations. To avoid this cost, we ask whether all replicated operations in these systems need to be strictly ordered. Recent research has yielded replication protocols that can avoid unnecessary ordering, e.g., by exploiting commutative operations, but it is not clear how to apply these to replicated transaction processing systems. We answer this question by analyzing existing transaction processing designs in terms of which replicated operations require ordering and which simply require fault tolerance. We describe how this analysis leads to our recent work on TAPIR, a transaction protocol that efficiently provides strict serializability by using a new replication protocol that provides fault tolerance but not ordering for most operations.