  Transaction processing has been an active area of research for several
decades. A fundamental characteristic of classical transaction processing
protocols is non-determinism, which causes them to suffer from performance
issues on modern computing environments such as main-memory databases using
many-core, and multi-socket CPUs and distributed environments. Recent proposals
of deterministic transaction processing techniques have shown great potential
in addressing these performance issues. In this position paper, I argue for a
queue-oriented transaction processing paradigm that leads to better design and
implementation of deterministic transaction processing protocols. I support my
approach with extensive experimental evaluations and demonstrate significant
performance gains.
