Calvin: fast distributed transactions for partitioned database systems
Calvin: fast distributed transactions for partitioned database systems
复制标题
DOI：
10.1145/2213836.2213838
复制
发表时间：
2012-05
期刊：
影响因子：
--
通讯作者：
Alexander Thomson;Thaddeus Diamond;Shu-Chun Weng;Kun Ren;Philip Shao;D. Abadi
中科院分区：
文献类型：
--
作者：
Alexander Thomson;Thaddeus Diamond;Shu-Chun Weng;Kun Ren;Philip Shao;D. Abadi
许多分布式存储系统通过分区和复制来实现高数据访问吞吐量，每个系统都有自己的优点和权衡。然而，为了实现高可伸缩性，当今的系统通常减少事务支持，不允许单个事务跨越多个分区。卡尔文是一个实用的事务调度和数据复制层，它使用确定性排序保证来显著降低与分布式事务相关联的通常禁止的争用成本。与以前的确定性数据库系统原型不同，卡尔文支持基于磁盘的存储，在商品机器集群上几乎线性地扩展，并且没有单点故障。通过复制事务输入而不是效果，卡尔文还能够支持多个一致性级别-包括跨地理上遥远的副本的基于Paxos的强一致性-而不影响事务吞吐量。
Many distributed storage systems achieve high data access throughput via partitioning and replication, each system with its own advantages and tradeoffs. In order to achieve high scalability, however, today's systems generally reduce transactional support, disallowing single transactions from spanning multiple partitions. Calvin is a practical transaction scheduling and data replication layer that uses a deterministic ordering guarantee to significantly reduce the normally prohibitive contention costs associated with distributed transactions. Unlike previous deterministic database system prototypes, Calvin supports disk-based storage, scales near-linearly on a cluster of commodity machines, and has no single point of failure. By replicating transaction inputs rather than effects, Calvin is also able to support multiple consistency levels---including Paxos-based strong consistency across geographically distant replicas---at no cost to transactional throughput.