Conflict detection tradeoffs for replicated data
Conflict detection tradeoffs for replicated data
复制标题
复制数据的冲突检测权衡
DOI：
10.1145/115302.115289
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
M. Livny
中科院分区：
文献类型：
--
作者：
M. Carey;M. Livny
许多并发控制算法已被提出用于分布式数据库系统。尽管有大量的可用算法和分布式数据库系统正在成为一个商业现实的事实，分布式并发控制性能的权衡仍然没有得到很好的理解。在本文中，我们研究这些权衡使用一个详细的模型，分布式DBMS研究了一组有代表性的算法，包括几个衍生物的两阶段锁定，时间戳排序，乐观的方法来分布式并发控制。特别是，我们研究这些算法的性能更新事务的数据复制和“分布式”的访问复制的数据的各个级别的数据争用的函数。结果提供了一些有趣的见解，早期和晚期冲突检测之间的权衡如何作为消息成本的函数而变化，并应证明是有用的分布式数据库系统设计者。
Many concurrency control algorithms have been proposed for use in distributed database systems. Despite the large number of available algorithms and the fact that distributed database systems are becoming a commercial reality, distributed concurrency control performance trade-offs are still not well understood. In this paper we examine some of these trade-offs by using a detailed model of a distributed DBMS to study a set of representative algorithms, including several derivatives of the two-phase locking, timestamp ordering, and optimistic approaches to distributed concurrency control. In particular, we examine the performance of these algorithms for update transactions as a function of data contention for various levels of data replication and “distributedness” of accesses to replicated data. The results provide some interesting insights into how the trade-offs between early and late conflict detection vary as a function of message cost, and should prove useful to distributed database system designers.