Obladi: Oblivious Serializable Transactions in the Cloud
Obladi: Oblivious Serializable Transactions in the Cloud
复制标题
DOI：
--
复制
发表时间：
2018-09
期刊：
影响因子：
--
通讯作者：
Natacha Crooks;Matthew Burke;Ethan Cecchetti;Sitar Harel;R. Agarwal;L. Alvisi
中科院分区：
文献类型：
--
作者：
Natacha Crooks;Matthew Burke;Ethan Cecchetti;Sitar Harel;R. Agarwal;L. Alvisi
本文介绍了Obladi的设计和实现，它是第一个在提供ACID事务的同时隐藏访问模式的系统。Obladi使用不经意的RAM作为其构建块，但将支持事务的需求转化为性能机会。通过在纪元内执行事务并将提交决策延迟到纪元结束，Obladi降低了不经意存储的摊销带宽成本，并增加了整体系统吞吐量。这些性能提升与用于并发控制和恢复的新不经意机制相结合，使Obladi能够以合理的吞吐量执行OLTP工作负载：它与TPC-C、SmallBank和FreeHealth应用程序的不经意基线相差5倍至12倍。然而，延迟开销更高(TPC-C的70倍)。
This paper presents the design and implementation of Obladi, the first system to provide ACID transactions while also hiding access patterns. Obladi uses as its building block oblivious RAM, but turns the demands of supporting transactions into a performance opportunity. By executing transactions within epochs and delaying commit decisions until an epoch ends, Obladi reduces the amortized bandwidth costs of oblivious storage and increases overall system throughput. These performance gains, combined with new oblivious mechanisms for concurrency control and recovery, allow Obladi to execute OLTP workloads with reasonable throughput: it comes within 5x to 12x of a non-oblivious baseline on the TPC-C, SmallBank, and FreeHealth applications. Latency overheads, however, are higher (70x on TPC-C).