Warp: Multi-Key Transactions for Key-Value Stores
đź“ś Abstract
Current production systems that offer transactions over key-value stores rely on a central lock manager, which limits scalability and performance of these systems. We propose Warp, a new approach to provide multi-key transactions for key-value stores. Warp is based on a novel non-blocking distributed protocol that is deadlock-free. We have implemented Warp and evaluated it using well-known benchmarks (YCSB and TPC-C) and production workloads at a global company accelerated through Warp. Our evaluations show that Warp offers near-linear scalability and significantly reduces the performance penalty of transactions in key-value stores, providing up to 6.5Ă— better latency and 11Ă— better throughput compared to state-of-the-art transaction management systems.
✨ Summary
The paper “Warp: Multi-Key Transactions for Key-Value Stores” presents a novel approach to handling transactions in key-value stores by introducing Warp, a non-blocking distributed protocol that ensures deadlock-free multi-key transactions. The authors propose this system to improve on the limitations of traditional transaction models that depend heavily on central lock managers, which usually impair scalability and performance.
Warp distinguishes itself by enabling near-linear scalability and reducing the transactional overhead, demonstrated through both synthetic benchmarks such as YCSB and TPC-C, as well as production workloads from a global company. The results indicate significant improvements, achieving up to 6.5 times better latency and 11 times better throughput than existing transaction management systems.
Upon conducting a web search, it appears that while the research introduces influential concepts, direct citations or applications of Warp in other academic or industrial contexts have not been widely documented. Therefore, further dissemination of this paper’s findings might be limited or not yet fully realized in subsequent developments in distributed transaction systems.