A Queue-oriented Transaction Processing Paradigm

TL;DR

This paper advocates for a queue-oriented paradigm in deterministic transaction processing, demonstrating through experiments that it significantly improves performance in modern computing environments.

Contribution

It introduces a novel queue-oriented approach that enhances the design and implementation of deterministic transaction processing protocols.

Findings

Significant performance gains demonstrated in experiments

Better design and implementation of deterministic protocols

Effective in modern multi-core and distributed environments

Abstract

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.